共查询到20条相似文献，搜索用时 31 毫秒
1.
2.
《Information processing & management》2020,57(4):102251
The primary aim of location recommendation is to predict users’ future movement by modeling user preference. Multiple types of information have been adopted in profiling users; however, simultaneously combining them for a better recommendation is challenging. In this study, a novel location recommendation method that incorporates geographical, categorical, and social preferences with location popularity is proposed. Experimental results on two public datasets show that the proposed method significantly outperforms two state-of-the-art recommendation methods. Geographical preference generally shows more importance than both categorical and social preferences. A category hierarchy that unleashes the independent assumption of location tags improves categorical preference. Location popularity proves to be a useful metric in ranking candidate locations. The findings of this study can provide practical guidelines for location recommendation services. 相似文献
3.
4.
《Information processing & management》2022,59(3):102936
Session-based recommendation aims to predict items that a user will interact with based on historical behaviors in anonymous sessions. It has long faced two challenges: (1) the dynamic change of user intents which makes user preferences towards items change over time; (2) the uncertainty of user behaviors which adds noise to hinder precise preference learning. They jointly preclude recommender system from capturing real intents of users. Existing methods have not properly solved these problems since they either ignore many useful factors like the temporal information when building item embeddings, or do not explicitly filter out noisy clicks in sessions. To tackle above issues, we propose a novel Dynamic Intent-aware Iterative Denoising Network (DIDN) for session-based recommendation. Specifically, to model the dynamic intents of users, we present a dynamic intent-aware module that incorporates item-aware, user-aware and temporal-aware information to learn dynamic item embeddings. A novel iterative denoising module is then devised to explicitly filter out noisy clicks within a session. In addition, we mine collaborative information to further enrich the session semantics. Extensive experimental results on three real-world datasets demonstrate the effectiveness of the proposed DIDN. Specifically, DIDN obtains improvements over the best baselines by 1.66%, 1.75%, and 7.76% in terms of P@20 and 1.70%, 2.20%, and 10.48% in terms of MRR@20 on all datasets. 相似文献
5.
《Information processing & management》2022,59(2):102858
Recommender Systems (RSs) aim to model and predict the user preference while interacting with items, such as Points of Interest (POIs). These systems face several challenges, such as data sparsity, limiting their effectiveness. In this paper, we address this problem by incorporating social, geographical, and temporal information into the Matrix Factorization (MF) technique. To this end, we model social influence based on two factors: similarities between users in terms of common check-ins and the friendships between them. We introduce two levels of friendship based on explicit friendship networks and high check-in overlap between users. We base our friendship algorithm on users’ geographical activity centers. The results show that our proposed model outperforms the state-of-the-art on two real-world datasets. More specifically, our ablation study shows that the social model improves the performance of our proposed POI recommendation system by 31% and 14% on the Gowalla and Yelp datasets in terms of Precision@10, respectively. 相似文献
6.
《Information processing & management》2022,59(5):103030
The prevalence of Location-based Social Networks (LBSNs) services makes next personalized Point-of-Interest (POI) predictions become a trending research topic. However, due to device failure or intention camouflage, geolocation information missing prevents existing POI-oriented researches for advanced user preference analysis. To this end, we propose a novel model named Bi-STAN, which fuses bi-direction spatiotemporal transition patterns and personalized dynamic preferences, to identify where the user has visited at a past specific time, namely missing check-in POI identification. Furthermore, to relieve data sparsity issues, Bi-STAN explicitly exploits spatiotemporal characteristics by doing bilateral traceback to search related items with high predictive power from user mobility traces. Specifically, Bi-STAN introduces (1) a temporal-aware attention semantic category encoder to unveil the latent semantic category transition patterns by modeling temporal periodicity and attenuation; (2) a spatial-aware attention POI encoder to capture the latent POI transition pattern by modeling spatial regularity and proximity; (3) a multitask-oriented decoder to incorporate personalized and temporal variance preference into learned transition patterns for missing check-in POI and category identification. Based on the complementarity and compatibility of multi-task learning, we further develop Bi-STAN with a self-adaptive learning rate for model optimization. Experimental results on two real-world datasets show the effectiveness of our proposed method. Significantly, Bi-STAN can also be adaptively applied to next POI prediction task with outstanding performances. 相似文献
7.
Graph-based recommendation approaches use a graph model to represent the relationships between users and items, and exploit the graph structure to make recommendations. Recent graph-based recommendation approaches focused on capturing users’ pairwise preferences and utilized a graph model to exploit the relationships between different entities in the graph. In this paper, we focus on the impact of pairwise preferences on the diversity of recommendations. We propose a novel graph-based ranking oriented recommendation algorithm that exploits both explicit and implicit feedback of users. The algorithm utilizes a user-preference-item tripartite graph model and modified resource allocation process to match the target user with users who share similar preferences, and make personalized recommendations. The principle of the additional preference layer is to capture users’ pairwise preferences, provide detailed information of users for further recommendations. Empirical analysis of four benchmark datasets demonstrated that our proposed algorithm performs better in most situations than other graph-based and ranking-oriented benchmark algorithms. 相似文献
8.
针对创新社区日益增长的海量信息阻碍了用户对知识进行有效获取和创造的现状,将模糊形式概念分析（FFCA）理论应用于创新社区领先用户的个性化知识推荐研究。首先识别出创新社区领先用户并对其发帖内容进行文本挖掘得到用户——知识模糊形式背景,然后构建带有相似度的模糊概念格对用户偏好进行建模,最后基于模糊概念格和协同过滤的推荐算法为领先用户提供个性化知识推荐有序列表。以手机用户创新社区为例,验证了基于FFCA的领先用户个性化知识推荐方法的可行性,有助于满足用户个性化知识需求,促进用户更好地参与社区知识创新。 相似文献
9.
随着移动互联网的发展,越来越多的用户信息获取过程通过移动终端完成.但当前个性化推荐系统对用户情境的感知能力不足,缺乏为用户提供符合当前情境的个性化信息推荐服务.为此,本文提出了基于贝叶斯方法的情境化用户资源类别偏好学习以及融合该类别偏好的协同过滤个性化信息推荐.运用贝叶斯方法学习用户在不同情境下对各资源类别的偏好,然后将该类别偏好与传统协同过滤推荐算法相结合,生成符合用户当前情境的个性化信息推荐.实验表明本文提出的改进算法可以提高推荐的准确率. 相似文献
10.
《Information processing & management》2023,60(2):103169
Point-of-interest (POI) recommendation helps users quickly filter out irrelevant POI by considering the spatio-temporal factor. In this paper, we address the problem of check-in preference modeling in POI recommendation, and propose a novel POI recommendation method that depicts user preference by constructing unique hypersphere interest model for each user. Different from existing works, we have done three innovative work. (1) We build a check-in graph and adopt DeepWalk algorithm to learn POI embedding, further aggregating them to obtain a hypersphere interest space with an interest center and interest radius. (2) We established a stacked neural network module by a bidirectional LSTM, a self-attention and a memory network, to grasp memory features contained in check-in histories. (3) We proposed a novel candidate POI filter method that updates ranking score by evaluating the Euclidean distance between the vectors of candidate POI and interest center. We evaluate the performance of our method on the four real-world check-in datasets constructed from Foursquare. The comparison between our method and six baselines demonstrates the outstanding performance on various measurements. Compared to the best baseline method, our method achieves about 50% performance improvement on NDCG. In terms of MRR, Precision and Recall, our method achieves about 37%, 21% and 9% performance improvement over the best baseline method. Further ablation experiments verified the importance and effectiveness of the hypersphere interest model, as removing this component caused significant performance degradation. 相似文献
11.
基于SOM聚类的个性化图书推荐研究 总被引：1，自引：0，他引：1
个性化推荐是图书馆个性化信息服务的主要方式之一。本文在传统推荐算法的基础上,提出了一种基于SOM聚类的个性化图书推荐方法,该方法结合中国图书馆分类法对读者的借阅信息进行分析,并利用SOM网络对借阅文档进行聚类。利用个性化推荐技术来调整图书馆的信息服务模式,推送最贴近读者需求的信息给读者,从而提高图书馆馆藏资源的利用率和图书馆的服务质量。 相似文献
12.
13.
《Information processing & management》2022,59(2):102814
With the rapid development of social media and big data technology, user’s sequence behavior information can be well recorded and preserved on different media platforms. It is crucial to model the user preference through mining their sequential behaviors. The goal of sequential recommendation is to predict what a user may interact with in the next moment based on the user’s historical record of interactive sequence. However, existing sequential recommendation methods generally adopt a negative sampling mechanism (e.g. random and uniform sampling) for the pairwise learning, which brings the defect of insufficient training to the model, and decrease the evaluation performance of the entire model. Therefore, we propose a Non-sampling Self-attentive Sequential Recommendation (NSSR) model that combines non-sampling mechanism and self-attention mechanism. Under the premise of ensuring the efficient training of the model, NSSR model takes all pairs in the training set as training samples, so as to achieve the goal of fully training the model. Specifically, we take the interactive sequence as the current user representation, and propose a new loss function to implement the non-sampling training mechanism. Finally, the state-of-the-art result is achieved on three public datasets, Movielens-1M, Amazon Beauty and Foursquare_TKY, and the recommendation performance increase by about 29.3%, 25.7% and 42.1% respectively. 相似文献
14.
基于协同过滤（CF）的个性化推荐技术,提出一种移动设备个性化软件推荐系统.该系统根据协同过滤的理论,首先通过软件类别兴趣相似度的计算,筛选出软件类别相似的用户候选集,过滤所有移动用户,减小产生的用户候选推荐集;然后对用户候选推荐集进行最近邻居的相似性计算以找出目标用户的邻居集合,并且对邻居集合中的邻居评分进行实时更新;最后根据兴趣相似度最大的K个邻居形成目标用户的Top-N推荐集.在第三方手机软件管理平台上通过监测推荐软件的下载或浏览量,验证系统的有效性和准确性. 相似文献
15.
16.
《Information processing & management》2022,59(1):102755
General recommenders and sequential recommenders are two modeling paradigms of recommender. The main focus of a general recommender is to identify long-term user preferences, while the user’s sequential behaviors are ignored and sequential recommenders try to capture short-term user preferences by exploring item-to-item relations, failing to consider general user preferences. Recently, better performance improvement is reported by combining these two types of recommenders. However, most of the previous works typically treat each item separately and assume that each user–item interaction in a sequence is independent. This may be a too simplistic assumption, since there may be a particular purpose behind buying the successive item in a sequence. In fact, a user makes a decision through two sequential processes, i.e., start shopping with a particular intention and then select a specific item which satisfies her/his preferences under this intention. Moreover, different users usually have different purposes and preferences, and the same user may have various intentions. Thus, different users may click on the same items with an attention on a different purpose. Therefore, a user’s behavior pattern is not completely exploited in most of the current methods and they neglect the distinction between users’ purposes and their preferences. To alleviate those problems, we propose a novel method named, CAN, which takes both users’ purposes and preferences into account for the next-item recommendation. We propose to use Purpose-Specific Attention Unit (PSAU) in order to discriminately learn the representations of user purpose and preference. The experimental results on real-world datasets demonstrate the advantages of our approach over the state-of-the-art methods. 相似文献
17.
基于社会标签的推荐系统研究 总被引：1，自引：0，他引：1
社会标签是一种新颖的大众索引方法,在Web 2.0时代各种收藏、检索、共享网站中得到广泛的应用,个性化推荐系统是基于用户的偏好为用户提供个性化信息服务的重要技术。本文针对推荐技术如何与社会标签结合的问题,分析了最新的研究现状和应用。详细阐述了3个方面的研究进展:标签推荐系统的研究、基于社会标签的个性化推荐系统的研究、社会标签的推荐应用系统。 相似文献
18.
针对目前传统数字图书馆无法为用户提供准确个性化服务的问题,提出通过本体构建智能数字图书馆,并且分析如何通过本体的作用使传统的数字图书馆达到智能个性推荐的基本原理,最后重点分析基于本体的个性推荐中的关键性问题,即用户本体的构建——读者用户本体库,包括用户基本信息本体、用户个性本体和用户需求本体,并用六元组表示方法实践本体的表示,以及通过流程图诠释本体间的作用机制。 相似文献
19.
Jun Wang Maarten Clements Jie Yang Arjen P. de Vries Marcel J.T. Reinders 《Information processing & management》2010,46(1):58-70
Social media systems have encouraged end user participation in the Internet, for the purpose of storing and distributing Internet content, sharing opinions and maintaining relationships. Collaborative tagging allows users to annotate the resulting user-generated content, and enables effective retrieval of otherwise uncategorised data. However, compared to professional web content production, collaborative tagging systems face the challenge that end-users assign tags in an uncontrolled manner, resulting in unsystematic and inconsistent metadata.This paper introduces a framework for the personalization of social media systems. We pinpoint three tasks that would benefit from personalization: collaborative tagging, collaborative browsing and collaborative search. We propose a ranking model for each task that integrates the individual user’s tagging history in the recommendation of tags and content, to align its suggestions to the individual user preferences. We demonstrate on two real data sets that for all three tasks, the personalized ranking should take into account both the user’s own preference and the opinion of others. 相似文献
20.
《Information processing & management》2022,59(2):102797
In event-based social networks (EBSN), group event recommendation has become an important task for groups to quickly find events that they are interested in. Existing methods on group event recommendation either consider just one type of information, explicit or implicit, or separately model the explicit and implicit information. However, these methods often generate a problem of data sparsity or of model vector redundancy. In this paper, we present a Graph Multi-head Attention Network (GMAN) model for group event recommendation that integrates the explicit and implicit information in EBSN. Specifically, we first construct a user-explicit graph based on the user's explicit information, such as gender, age, occupation and the interactions between users and events. Then we build a user-implicit graph based on the user's implicit information, such as friend relationships. The incorporated both explicit and implicit information can effectively describe the user's interests and alleviate the data sparsity problem. Considering that there may be a correlation between the user's explicit and implicit information in EBSN, we take the user's explicit vector representation as the input of the implicit information aggregation when modeling with graph neural networks. This unified user modeling can solve the aforementioned problem of user model vector redundancy and is also suitable for event modeling. Furthermore, we utilize a multi-head attention network to learn richer implicit information vectors of users and events from multiple perspectives. Finally, in order to get a higher level of group vector representation, we use a vanilla attention mechanism to fuse different user vectors in the group. Through experimenting on two real-world Meetup datasets, we demonstrate that GMAN model consistently outperforms state-of-the-art methods on group event recommendation. 相似文献