A personalized POI route recommendation system based on heterogeneous tourism data and sequential pattern mining

Multimedia Tools and Applications - Planning a personalized POI route before touring a new city is an important travel preparation activity; however, it is a challenging and time-consuming task for...     

Neural TV program recommendation with label and user dual attention

TV program recommendation is very important for users to find interesting TV programs and avoid confusing users with a lot of information. Currently, they are basically traditional collaborative filtering algorithms, which only recommend through the interactive data between users and programs ignoring the important value of some auxiliary information. In addition, the neural network method based on attention mechanism can well capture the relationship between program labels to obtain accurate program and user representations. In this paper, we propose a neural TV program recommendation with label and user dual attention (NPR-LUA), which can focus on auxiliary information in program and user modules. In the program encoder module, we learn the auxiliary information from program labels through neural networks and word attention to identify important program labels. In the user encoder module, we learn the user representation through the programs that the user watches and use personalized attention mechanism to distinguish the importance of programs for each user. Experiments on real data sets show that our method can effectively improve the effectiveness of TV program recommendations than other existing models.

     

Discovering user profiles for Web personalized recommendation

With the growing popularity of the World Wide Web, large volume of user access data has been gathered automatically by Web servers and stored in Web logs. Discovering and understanding user behavior patterns from log files can provide Web personalized recommendation services. In this paper, a novel clustering method is presented for log files called Clustering large Weblog based on Key Path Model (CWKPM), which is based on user browsing key path model, to get user behavior profiles. Compared with the previous Boolean model, key path model considers the major features of users‘ accessing to the Web: ordinal, contiguous and duplicate. Moreover, for clustering, it has fewer dimensions. The analysis and experiments show that CWKPM is an efficient and effective approach for clustering large and high-dimension Web logs.     

用户个性化推荐系统的设计与实现

为实现个性化服务,理解用户兴趣就成了提供服务的关键任务,因此,提出了隐性采集用户浏览内容、用户浏览时间和用户操作时间的信息方法,通过对网络爬虫程序抓取的网页进行内容清洗提取出主要内容之后,利用VSM建立文档模型,并采用SVM分类方法建立推荐库.基于从客户端采集的用户兴趣信息建模,以及根据该模型和推荐库的相似度,给用户推荐信息.此外,给出了基于该模型的推荐原型系统的实现,使用查准率来评价该系统.试验结果表明,系统较好地实现了基于用户兴趣来推荐阅读的信息.     

Automatic metadata expansion and indirect collaborative filtering for TV program recommendation system

TV Program recommendation is a good example of a novel application of networked appliances using personalization technologies. The aim of this paper is to propose methods to improve the accuracy of TV program recommendation. Automatic metadata expansion (AME) is a method to enhance TV program metadata from electronic program guide (EPG) data, and indirect collaborative filtering (ICF) is a method to recommend non-persistent items such as TV programs based on the preferences of other members in a community. In this paper, the effectiveness of these methods is confirmed through experiments. This online TV recommendation system is currently being used by 230,000 members in Japan. The result of the actual operation is also discussed.     

Combining long-term and short-term user interest for personalized hashtag recommendation

Hashtags, terms prefixed by a hash-symbol #, are widely used and inserted anywhere within short messages (tweets) on micro-blogging systems as they present rich sentiment information on topics that people are interested in. In this paper, we focus on the problem of hashtag recommendation considering their personalized and temporal aspects. As far as we know, this is the first work addressing this issue specially to recommend personalized hashtags combining longterm and short-term user interest.We introduce three features to capture personal and temporal user interest: 1) hashtag textual information; 2) user behavior; and 3) time. We offer two recommendation models for comparison: a linearcombined model, and an enhanced session-based temporal graph (STG) model, Topic-STG, considering the features to learn user preferences and subsequently recommend personalized hashtags. Experiments on two real tweet datasets illustrate the effectiveness of the proposed models and algorithms.     

Automatic generation and recommendation of personalized challenges for gamification

User Modeling and User-Adapted Interaction - Gamification, that is, the usage of game content in non-game contexts, has been successfully employed in several application domains to foster end...     

Scalable and parallel sequential pattern mining using spark

World Wide Web - The performance of the existing parallel sequential pattern mining algorithms is often unsatisfactory due to high IO overhead and imbalanced load among the computing nodes. To...     

冷启动下用户特征模型的构建与个性化推荐

针对个性化推荐中的冷启动和用户模型主观个性特征描述不足的问题,提出一种基于用户初始特征模型优化构建的个性化推荐方法.通过对成对比较矩阵构建方法的优化和改进,减少提取主观性权重比较结果时,用户的比较操作次数,通过推导计算得出用户的初始特征模型,并据此完成推荐.通过将该方法应用到周边美食个性化推荐中,验证该方法所建立的初始...     

Modeling and broadening temporal user interest in personalized news recommendation

User profiling is an important step for solving the problem of personalized news recommendation. Traditional user profiling techniques often construct profiles of users based on static historical data accessed by users. However, due to the frequent updating of news repository, it is possible that a user’s fine-grained reading preference would evolve over time while his/her long-term interest remains stable. Therefore, it is imperative to reason on such preference evaluation for user profiling in news recommenders. Besides, in content-based news recommenders, a user’s preference tends to be stable due to the mechanism of selecting similar content-wise news articles with respect to the user’s profile. To activate users’ reading motivations, a successful recommender needs to introduce “somewhat novel” articles to users.In this paper, we initially provide an experimental study on the evolution of user interests in real-world news recommender systems, and then propose a novel recommendation approach, in which the long-term and short-term reading preferences of users are seamlessly integrated when recommending news items. Given a hierarchy of newly-published news articles, news groups that a user might prefer are differentiated using the long-term profile, and then in each selected news group, a list of news items are chosen as the recommended candidates based on the short-term user profile. We further propose to select news items from the user–item affinity graph using absorbing random walk model to increase the diversity of the recommended news list. Extensive empirical experiments on a collection of news data obtained from various popular news websites demonstrate the effectiveness of our method.     

3PRS: a personalized popular program recommendation system for digital TV for P2P social networks

Digital TV channels require users to spend more time to choose their favorite TV programs. Electronic Program Guides (EPG) cannot be used to find popular TV programs. Hence, this paper proposes a personalized Digital Video Broadcasting — Terrestrial(DVB-T) Digital TV program recommendation system for P2P social networks. From the DVB-T signal, we obtain EPG of TV programs. The frequency and duration of the programs that users have watched are used to extract programs that users are interested in. The information is collected and weighted by Information Retrieval (IR). The program information is then clustered by k-means. Clusters of users are also grouped by k-means to find cluster relationships. In each group, we decide the most popular program in the group according to the program weight of the channel. When a new user begins to watch the TV program, the K-Nearest Neighbor (kNN) classification method is used to determine the user’s predicted cluster label. Then, our system recommends popular programs in the predicted cluster and similar clusters.     

基于用户浏览行为的个性化推荐研究综述

研究如何充分利用海量用户浏览行为数据,构建更加精确的推荐算法和模型,以提高推荐系统性能,是目前个性化推荐领域研究的热点.针对这些问题,首先对用户的浏览行为进行了简要概括表述,给出了基于浏览行为推荐系统的总体框架,回顾总结了基于用户浏览行为的推荐系统的发展历程.对其关键技术和单一浏览行为量化方法与混合浏览行为量化方法进行总结、对比和分析.最后讨论了结合多源异构数据的浏览行为推荐的最新成果,总结了该领域未来研究难点和发展趋势.     

DSIM: dynamic and static interest mining for sequential recommendation

Knowledge and Information Systems - Sequential recommendation aims to predict the next interaction by mining users’ evolving interest from their historical behaviors. Through comprehensive...     

Clustering of tourist routes for individual tourists using sequential pattern mining

Grouping individual tourists who have the same or similar tourist routes over the same time period makes it more convenient for the tourists at a low cost by providing transportation means such as regular or occasional tour buses, driver, and tourism guides. In this paper, we propose a mathematical formulation for the tour routes clustering problem and two phases for a sequential pattern algorithm for clustering similar or identical routes according to the tourist routes of individual tourists, with illustrative examples. The first phase is to construct a site by site frequency matrix and prune infrequent tour route patterns from the matrix. The second phase is to perform clustering of the tour routes to determine the tour route using a sequential pattern mining algorithm. We compare and evaluate the performance of our algorithms, i.e., in terms of execution time and memory used. The proposed algorithm is efficient in both runtime and memory usage for the increasing number of transactions.

     

Exploiting behavioral user models for point of interest recommendation in smart museums

ABSTRACT

The Internet of Things (IoT) holds the promise to blend real-world and online behaviors in principled ways, yet we are only beginning to understand how to effectively exploit insights from the online realm into effective applications in smart environments. Such smart environments aim to provide an improved, personalized experience based on the trail of user interactions with smart devices, but how does recommendation in smart environments differ from the usual online recommender systems? And can we exploit similarities to truly blend behavior in both realms to address the fundamental cold-start problem? In this article, we experiment with behavioral user models based on interactions with smart devices in a museum, and investigate the personalized recommendation of what to see after visiting an initial set of Point of Interests (POIs), a key problem in personalizing museum visits or tour guides, and focus on a critical one-shot POI recommendation task—where to go next? We have logged users' onsite physical information interactions during visits in an IoT-augmented museum exhibition at scale. Furthermore, we have collected an even larger set of search logs of the online museum collection. Users in both sets are unconnected, for privacy reasons we do not have shared IDs. We study the similarities between users' online digital and onsite physical information interaction behaviors, and build new behavioral user models based on the information interaction behaviors in (i) the physical exhibition space, (ii) the online collection, or (iii) both. Specifically, we propose a deep neural multilayer perceptron (MLP) based on explicitly given users' contextual information, and set-based extracted features using users' physical information interaction behaviors and similar users' digital information interaction behaviors. Our experimental results indicate that the proposed behavioral user modeling approach, using both physical and online user information interaction behaviors, improves the onsite POI recommendation baselines' performances on all evaluation metrics. Our proposed MLP approach achieves 83% precision at rank 1 on the critical one-shot POI recommendation problem, realizing the high accuracy needed for fruitful deployment in practical situations. Furthermore, the MLP model is less sensitive to amount of real-world interactions in terms of the seen POIs set-size, by backing of to the online data, hence helps address the cold start problem in recommendation. Our general conclusion is that it is possible to fruitfully combine information interactions in the online and physical world for effective recommendation in smart environments.     

序列模式挖掘综述

综述了序列模式挖掘的研究状况。首先介绍了序列模式挖掘背景与相关概念;其次总结了序列模式挖掘的一般方法,介绍并分析了最具代表性的序列模式挖掘算法;最后展望序列模式挖掘的研究方向。便于研究者对已有算法进行改进,提出具有更好性能的新的序列模式挖掘算法。     

DFIAM: deep factorization integrated attention mechanism for smart TV recommendation

World Wide Web - Users are frequently overwhelmed by their uninterested programs due to the development of smart TV and the excessive number of programs. For addressing this issue, various...     

Infrequent pattern mining in smart healthcare environment using data summarization

A summarization technique creates a concise version of large amount of data (big data!) which reduces the computational cost of analysis and decision-making. There are interesting data patterns, such as rare anomalies, which are more infrequent in nature than other data instances. For example, in smart healthcare environment, the proportion of infrequent patterns is very low in the underlying cyber physical system (CPS). Existing summarization techniques overlook the issue of representing such interesting infrequent patterns in a summary. In this paper, a novel clustering-based technique is proposed which uses an information theoretic measure to identify the infrequent frequent patterns for inclusion in a summary. The experiments conducted on seven benchmark CPS datasets show substantially good results in terms of including the infrequent patterns in summaries than existing techniques.     

Closed sequential pattern mining for sitemap generation

World Wide Web - A sitemap represents an explicit specification of the design concept and knowledge organization of a website and is therefore considered as the website’s basic ontology. It...     

Community detection in social networks using user frequent pattern mining

Recently, social networking sites are offering a rich resource of heterogeneous data. The analysis of such data can lead to the discovery of unknown information and relations in these networks. The detection of communities including ‘similar’ nodes is a challenging topic in the analysis of social network data, and it has been widely studied in the social networking community in the context of underlying graph structure. Online social networks, in addition to having graph structures, include effective user information within networks. Using this information leads to enhance quality of community discovery. In this study, a method of community discovery is provided. Besides communication among nodes to improve the quality of the discovered communities, content information is used as well. This is a new approach based on frequent patterns and the actions of users on networks, particularly social networking sites where users carry out their preferred activities. The main contributions of proposed method are twofold: First, based on the interests and activities of users on networks, some small communities of similar users are discovered, and then by using social relations, the discovered communities are extended. The F-measure is used to evaluate the results of two real-world datasets (Blogcatalog and Flickr), demonstrating that the proposed method principals to improve the community detection quality.