2017 IEEE International Conference on Information Reuse and Integration (IRI)最新文献

筛选
英文 中文
Predicting the Users' Clickstreams Using Time Series Representation, Symbolic Sequences, and Deep Learning: Application on Job Offers Recommendation Tasks 使用时间序列表示、符号序列和深度学习预测用户点击流:在工作机会推荐任务中的应用
Sidahmed Benabderrahmane, N. Mellouli, M. Lamolle
{"title":"Predicting the Users' Clickstreams Using Time Series Representation, Symbolic Sequences, and Deep Learning: Application on Job Offers Recommendation Tasks","authors":"Sidahmed Benabderrahmane, N. Mellouli, M. Lamolle","doi":"10.1109/IRI.2017.54","DOIUrl":"https://doi.org/10.1109/IRI.2017.54","url":null,"abstract":"During the last decade, the expansion of automatic e-recruitment systems has led to the multiplication of web channels (job boards) that are dedicated to job offers disseminations. In a strategic and economic context where cost control is fundamental, the identification of the relevant job board for a given new job offers has become necessary. The purpose of this work is to present the recent results that we have obtained on a new job board recommendation system that is a decisionmaking tool intended to guide recruiters while they are posting a job on the Internet. First, the job applicant clickstreams history on various job boards are stored in a large learning database, and then represented as time series. Second, a deep neural network architecture is used to predict future values of the clicks on the job boards. Third, and in a parallel way, dimensionality reduction techniques are used to transform the clicks multivariate numerical time series into temporal symbolic sequences. Ngrams are then used to predict future symbols for each sequence. Finally, a list of top ranked job boards are kept by maximizing the clickstreams forecasting in both representations. Our experiments are tested on a real dataset, coming from a job-posting database of an industrial partner. The promising results have shown that using deep learning, the recommendation system outperforms standard multivariate models.","PeriodicalId":254330,"journal":{"name":"2017 IEEE International Conference on Information Reuse and Integration (IRI)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114734469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Mining Social Media Data Using Topological Data Analysis 利用拓扑数据分析挖掘社交媒体数据
Khaled Almgren, Minkyu Kim, JeongKyu Lee
{"title":"Mining Social Media Data Using Topological Data Analysis","authors":"Khaled Almgren, Minkyu Kim, JeongKyu Lee","doi":"10.1109/IRI.2017.41","DOIUrl":"https://doi.org/10.1109/IRI.2017.41","url":null,"abstract":"Topological data analysis is a noble method to analyze high-dimensional qualitative data using a set of properties from topology. In this paper, we explore the feasibility of topological data analysis for mining social media data by investigating the problem of image popularity. We randomly crawl images from Instagram, convert their captions to 300 dimensional numerical vectors using Word2vec, calculate cosine distances to evaluate the similarities of the caption vectors, and then apply the distances to a topological data analysis algorithm called mapper.With caption vectors, the results show that topological data analysis is able to cluster the images related to the images’ popularity. Moreover, the results show relationships between the clusters that are represented as a monotonic increase of popularity. This approach is compared with traditional clustering algorithms, including k-means and hierarchical clustering, and the results show that topological data analysis outperforms the others.","PeriodicalId":254330,"journal":{"name":"2017 IEEE International Conference on Information Reuse and Integration (IRI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124760937","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Infusing Latent User-Concerns from User Reviews into Collaborative Filtering 将用户评论中的潜在用户关注点注入协同过滤
Ligaj Pradhan, Chengcui Zhang, Steven Bethard
{"title":"Infusing Latent User-Concerns from User Reviews into Collaborative Filtering","authors":"Ligaj Pradhan, Chengcui Zhang, Steven Bethard","doi":"10.1109/IRI.2017.24","DOIUrl":"https://doi.org/10.1109/IRI.2017.24","url":null,"abstract":"Traditionally, Collaborative Filtering (CF) based recommendation employs past rating behaviors of users on items to discover similar users and similar items. We can further improve on discovering user similarities by better understanding user behaviors through analyzing user reviews. In their reviews, users generally mention about things that are of greater interest to them, and these cues can provide an effective medium to discover users with similar interests and concerns. In this paper, we extract latent User-Concerns from user reviews and construct their hierarchical tree (UC-Tree). By associating each user with the corresponding concerns in the UC-Tree, we then generate vectors that represent intricate user behaviors. Finally, we infuse such additional knowledge about the users into the conventional CF-based rating prediction process. Our experiments and results show that such additional behavioral knowledge assists the discovery of similar users and improves the accuracy of conventional CF-based rating prediction.","PeriodicalId":254330,"journal":{"name":"2017 IEEE International Conference on Information Reuse and Integration (IRI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129638930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
On Using Disparate Scholarly Data to Identify Potential Members for Interdisciplinary Research Groups 利用不同的学术数据来确定跨学科研究小组的潜在成员
F. Osuna, Monika Akbar, A. Gates
{"title":"On Using Disparate Scholarly Data to Identify Potential Members for Interdisciplinary Research Groups","authors":"F. Osuna, Monika Akbar, A. Gates","doi":"10.1109/IRI.2017.33","DOIUrl":"https://doi.org/10.1109/IRI.2017.33","url":null,"abstract":"Supporting interdisciplinary research (IDR) requires detecting the expertise needed to solve complex problems and identifying researchers with that expertise. Universities have adopted various expertise systems, many of which use publications and keywords to identify experts. Research expertise is dynamic in nature as one's expertise may change over time. Relying solely on publications to infer research interests can be less effective in identifying potential collaborators as different types of scholarly activities demonstrate the change in research direction at different times. This paper uses disparate scholarly data to propose and evaluate different approaches for building research footprints and presents experimental results to show how these footprints perform in identifying potential members for IDR groups. Results indicate that grant data is a better predictor of IDR membership than publication data. The paper also describes two approaches for building IDR-specific classifier models, along with the accuracy of those models in identifying potential IDR group membership.","PeriodicalId":254330,"journal":{"name":"2017 IEEE International Conference on Information Reuse and Integration (IRI)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126551160","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Predicting Movie Market Revenue Using Social Media Data 利用社交媒体数据预测电影市场收入
Steve Shim, M. Pourhomayoun
{"title":"Predicting Movie Market Revenue Using Social Media Data","authors":"Steve Shim, M. Pourhomayoun","doi":"10.1109/IRI.2017.68","DOIUrl":"https://doi.org/10.1109/IRI.2017.68","url":null,"abstract":"The amount of data being created and processed daily has grown exponentially with the introduction of the internet and social media. While the data are available, there is a struggle to determine how to effectively use and interpret the data. One of the most popular uses for the large quantities of data is to create models to predict the behavior or tendencies. One important application of prediction is predicting financial outcomes using datasets. As a specific case, this study focuses on the use of Twitter data collected leading up to a movie's opening weekend to predict its revenue over the course of each of the opening weekends. Due to the lack of readily available data, the data must be first gathered weekly using Twitter's API and related third party libraries. Construction of the predictive model is based on several machine learning algorithms using a set of features derived from user tweets. The results show that our predictive model can be used to determine the success of movies during the opening weekend by prediction the gross per day value. The modelling and process are presented such that they can be used as an aid to create similar models using other popular social media networks and their data.","PeriodicalId":254330,"journal":{"name":"2017 IEEE International Conference on Information Reuse and Integration (IRI)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127217826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Knowledge Amplification through Randomization for Scheduling Systems 调度系统随机化中的知识放大
T. Bouabana-Tebibel, S. Rubin, Miled B. Bentaiba, Abdelghani Allaoua, Ahcene Boumhand
{"title":"Knowledge Amplification through Randomization for Scheduling Systems","authors":"T. Bouabana-Tebibel, S. Rubin, Miled B. Bentaiba, Abdelghani Allaoua, Ahcene Boumhand","doi":"10.1109/IRI.2017.31","DOIUrl":"https://doi.org/10.1109/IRI.2017.31","url":null,"abstract":"Case-Based Reasoning (CBR) is an analogy-based method allowing for resolving new problems by exploiting previously accumulated knowledge and experiences. Randomization is a novel approach for knowledge generation and compactification. Randomization improves CBR when integrated with it. The work presented in this paper pertains to knowledge amplification based on randomization. New knowledge is deduced from hidden knowledge by subsumption. The approach is applied to a scheduling system, thus highlighting its strength in enhancing case-based reasoning by inferring pertinent new and valid knowledge. Experimental results show the efficiency of the approach.","PeriodicalId":254330,"journal":{"name":"2017 IEEE International Conference on Information Reuse and Integration (IRI)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127708244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
EARRING: Efficient Authentication of Outsourced Record Matching 耳环:外包记录匹配的有效认证
Boxiang Dong, Wendy Hui Wang
{"title":"EARRING: Efficient Authentication of Outsourced Record Matching","authors":"Boxiang Dong, Wendy Hui Wang","doi":"10.1109/IRI.2017.16","DOIUrl":"https://doi.org/10.1109/IRI.2017.16","url":null,"abstract":"Cloud computing enables the outsourcing of big data analytics, where a third-party server is responsible for data management and processing. In this paper, we consider the outsourcing model in which a third-party server provides record matching as a service. In particular, given a target record, the service provider returns all records from the outsourced dataset that match the target according to specific distance metrics. Identifying matching records in databases plays an important role in information integration and entity resolution. A major security concern of this outsourcing paradigm is whether the service provider returns the correct record matching results. To solve the problem, we design EARRING, an Efficient Authentication of outsouRced Record matchING framework. EARRING requires the service provider to construct the verification object (VO) of the record matching results. From the VO, the client is able to catch any incorrect result with cheap computational cost. Experiment results on real-world datasets demonstrate the efficiency of EARRING.","PeriodicalId":254330,"journal":{"name":"2017 IEEE International Conference on Information Reuse and Integration (IRI)","volume":"600 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116285108","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the Verification of UML State Machine Diagrams to Colored Petri Nets Transformation Using Isabelle/HOL 基于Isabelle/HOL的UML状态机图对彩色Petri网转换的验证
Said Meghzili, A. Chaoui, M. Strecker, E. Kerkouche
{"title":"On the Verification of UML State Machine Diagrams to Colored Petri Nets Transformation Using Isabelle/HOL","authors":"Said Meghzili, A. Chaoui, M. Strecker, E. Kerkouche","doi":"10.1109/IRI.2017.63","DOIUrl":"https://doi.org/10.1109/IRI.2017.63","url":null,"abstract":"The Unified Modeling Language (UML) is a modeling language standardized by the OMG. The goal of UML is to supply software engineers, software developers, and system architects with tools for analysis, design, and implementation of software-based systems as well as for modeling business and similar processes. However, UML semantics is not formally defined. On the other hand, Colored Petri nets models (CPNs) are based on mathematical principle and have several verification capabilities. In this paper, we present another way to transform State Machine Diagrams (UML SMD) into Colored petri nets models and prove certain structural properties in this transformation itself. Therefore, we have described UML SMD (source model), Colored Petri nets (target model) and the transformation algorithm within Isabelle/HOL theorem prover. We demonstrate, also within Isabelle/HOL, that this transformation preserves certain structural properties for any input model (UML SMD).","PeriodicalId":254330,"journal":{"name":"2017 IEEE International Conference on Information Reuse and Integration (IRI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114850177","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
A Multi-stage Approach to Personalized Course Selection and Scheduling 个性化课程选择和排课的多阶段方法
Tyler Morrow, A. Hurson, Sahra Sedigh Sarvestani
{"title":"A Multi-stage Approach to Personalized Course Selection and Scheduling","authors":"Tyler Morrow, A. Hurson, Sahra Sedigh Sarvestani","doi":"10.1109/IRI.2017.58","DOIUrl":"https://doi.org/10.1109/IRI.2017.58","url":null,"abstract":"Recommender systems that utilize pertinent and available contextual information are applicable to and useful in a broad range of domains. This paper utilizes context-aware recommendation to facilitate personalized education and assist students in selecting courses (or in non-traditional curricula, learning artifacts) that meet curricular requirements, leverage their skills and background, and are relevant to their interests. The research contribution described in this paper is a methodology that generates a schedule of courses (and associated course content) that takes into consideration a student's profile, while meeting curricular and prerequisite requirements and aiming to reduce attributes such as cost and time-to-degree. The optimization problem - multiple integer linear programming problems and a single scheduling problem - is solved in stages using a known linear solver as well as graph-based heuristics. The efficacy of the algorithm is demonstrated through a case study.","PeriodicalId":254330,"journal":{"name":"2017 IEEE International Conference on Information Reuse and Integration (IRI)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124152520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Heuristics-Based Schema Extraction for Deep Web Query Interfaces 基于启发式的深度Web查询接口模式提取
Chichang Jou, Yucheng Cheng
{"title":"Heuristics-Based Schema Extraction for Deep Web Query Interfaces","authors":"Chichang Jou, Yucheng Cheng","doi":"10.1109/IRI.2017.80","DOIUrl":"https://doi.org/10.1109/IRI.2017.80","url":null,"abstract":"Along with the popularity of the internet, contents inside web databases also increase quickly. These data, hidden behind the query interfaces, are called deep web. These contents normally are not collected by the search engines. Many deep web contents related applications, like contents collection, topic-focused crawling, and data integration, are based on understanding the schema of these query interfaces. The schema needs to cover mappings of input elements and labels, data types of valid input values, and range constraints of the input values. We propose a Heuristics-based deep web query interface Schema Extraction system (HSE) that identifies labels, elements, mappings among labels and elements, and relationships among elements. In HSE, texts surrounding elements are collected as candidate labels. We propose a string similarity function and dynamic similarity threshold setup to cleanse candidate labels. In HSE, elements, candidate labels, and new lines in the query interface are streamlined to produce its Interface Expression (IEXP). By combining the user's view and the designer's view, with the aid of semantic information, we build heuristic rules to extract schema from IEXP of query interfaces in the ICQ dataset. These rules are constructed through utilizing (1) the characteristics of labels and elements, and (2) the spatial, group, and range relationships of labels and elements. Our schema not only helps extracting contents of the deep web, but also benefits the processes of schema matching and schema merging. The experimental results on the TEL-8 dataset show that HSE produces effective performance.","PeriodicalId":254330,"journal":{"name":"2017 IEEE International Conference on Information Reuse and Integration (IRI)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124293564","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信