首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
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.  相似文献   

2.
Learning latent representations for users and points of interests (POIs) is an important task in location-based social networks (LBSN), which could largely benefit multiple location-based services, such as POI recommendation and social link prediction. Many contextual factors, like geographical influence, user social relationship and temporal information, are available in LBSN and would be useful for this task. However, incorporating all these contextual factors for user and POI representation learning in LBSN remains challenging, due to their heterogeneous nature. Although the encouraging performance of POI recommendation and social link prediction are delivered, most of the existing representation learning methods for LBSN incorporate only one or two of these contextual factors. In this paper, we propose a novel joint representation learning framework for users and POIs in LBSN, named UP2VEC. In UP2VEC, we present a heterogeneous LBSN graph to incorporate all these aforementioned factors. Specifically, the transition probabilities between nodes inside the heterogeneous graph are derived by jointly considering these contextual factors. The latent representations of users and POIs are then learnt by matching the topological structure of the heterogeneous graph. For evaluating the effectiveness of UP2VEC, a series of experiments are conducted with two real-world datasets (Foursquare and Gowalla) in terms of POI recommendation and social link prediction. Experimental results demonstrate that the proposed UP2VEC significantly outperforms the existing state-of-the-art alternatives. Further experiment shows the superiority of UP2VEC in handling cold-start problem for POI recommendation.  相似文献   

3.
This paper focuses on personalized outfit generation, aiming to generate compatible fashion outfits catering to given users. Personalized recommendation by generating outfits of compatible items is an emerging task in the recommendation community with great commercial value but less explored. The task requires to explore both user-outfit personalization and outfit compatibility, any of which is challenging due to the huge learning space resulted from large number of items, users, and possible outfit options. To specify the user preference on outfits and regulate the outfit compatibility modeling, we propose to incorporate coordination knowledge in fashion. Inspired by the fact that users might have coordination preference in terms of category combination, we first define category combinations as templates and propose to model user-template relationship to capture users’ coordination preferences. Moreover, since a small number of templates can cover the majority of fashion outfits, leveraging templates is also promising to guide the outfit generation process. In this paper, we propose Template-guided Outfit Generation (TOG) framework, which unifies the learning of user-template interaction, user–item interaction and outfit compatibility modeling. The personal preference modeling and outfit generation are organically blended together in our problem formulation, and therefore can be achieved simultaneously. Furthermore, we propose new evaluation protocols to evaluate different models from both the personalization and compatibility perspectives. Extensive experiments on two public datasets have demonstrated that the proposed TOG can achieve preferable performance in both evaluation perspectives, namely outperforming the most competitive baseline BGN by 7.8% and 10.3% in terms of personalization precision on iFashion and Polyvore datasets, respectively, and improving the compatibility of the generated outfits by over 2%.  相似文献   

4.
拟合用户偏好的个性化搜索   总被引:2,自引:0,他引:2  
文章从用户偏好的角度对个性化搜索进行了优化研究,提出了基于语义关联树的查询扩展算法以及基于该算法的拟合用户偏好的个性化搜索系统架构。语义关联树可以灵活有效地控制查询扩展模型,在此之上的拟合用户偏好的个性化搜索系统具有用户偏好自学习能力。实验证明,该方法能有效提高文本检索的准确率。  相似文献   

5.
王连喜 《现代情报》2015,35(12):41-46
个性化图书推荐主要是以用户特征和借阅行为为挖掘对象,通过获取用户的兴趣特征及隐含的需求模式,实现用户与图书相互关联的个性化图书推荐服务。本文通过挖掘用户的背景信息构建用户特征模型,然后在设计喜好值计算、用户相似度计算和内容相似度计算以及标签信息获取方法的基础上,研究多种不同的图书推荐方法,以挖掘用户的潜在信息需求。最后利用图书馆的真实数据设计面向高校图书馆的个性化图书推荐系统,同时以标准网络数据集通过实验验证来评估推荐方法的有效性。  相似文献   

6.
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.  相似文献   

7.
基于标签的个性化推荐应用越来越普遍,但是标签带有的语义模糊、时序动态性等问题影响着个性化推荐质量,现有研究仅从数量和结构上考虑用户与标签的关系。基于社会化标注系统的个性化推荐首先对融合社会关系的标签进行潜在语义主题挖掘,然后构建多层、多维度用户兴趣模型,提出模型更新策略,最后实现个性化推荐。采集CiteUlike站点数据进行实验分析,结果表明改进算法比传统算法更准确表达用户兴趣偏好,有效提高了个性化推荐准确率。  相似文献   

8.
关芳  高一弘  林强 《情报探索》2020,(4):109-115
[目的/意义]旨在为高校图书馆提高纸质资源采购质量与利用率提供参考。[方法/过程]基于用户画像的理论对不同用户进行多维度的刻画,利用机器学习中监督学习的方法,通过采用协同过滤的推荐算法对用户偏好特征做精细统计分析的定量化计算,并从用户需求的角度建立用户偏好同步变化的自适应优化在线学习的纸本资源推荐系统。[结果/结论]该研究从实证分析角度为用户实现精准的个性化纸本资源推荐服务,为高校图书馆纸质文献检索库实现智能偏好的检索功能,建立纸质文献检索库合理有效的动态更新机制,提升用户体验。  相似文献   

9.
This paper constructs a novel enhanced latent semantic model based on users’ comments, and employs regularization factors to capture the temporal evolution characteristics of users’ potential topics for each commodity, so as to improve the accuracy of recommendation. The adaptive temporal weighting of multiple preference features is also improved to calculate the preferences of different users at different time periods using human forgetting features, item interest overlap, and similarity at the semantic level of the review text to improve the accuracy of sparse evaluation data. The paper conducts comparison experiments with six temporal matrix-based decomposition baseline methods in nine datasets, and the results show that the accuracy is 31.64% better than TimeSVD++, 21.08% better than BTMF, 15.51% better than TMRevCo, 13.99% better than BPTF, 9.24% better than TCMF, and 3.19% better than MUTPD ,which indicates that the model is more effective in capturing users’ temporal interest drift and better reflects the evolutionary relationship between users’ latent topics and item ratings.  相似文献   

10.
【目的/意义】社会感知是借助海量时空数据研究人类时空间行为特征,进而揭示社会经济现象的时空分 布、联系及过程的理论与方法。用户画像旨在通过挖掘用户属性特征和行为模式,以揭示群体、领域乃至社会现象 的内在规律。用户画像是实现社会感知的重要手段。【方法/过程】紧密围绕社会感知数据涉及的情感认知、行为习 惯和社交网络关系三个维度梳理与之映射的用户画像内容维度,更深层次地,对其三个维度中与用户画像息息相 关的应用情境进行分类描述,以期总结其应用价值。【结果/结论】研究发现:当前用户画像的数据源拓展到多源异 构时空数据;研究内容集中在情感及场所语义、空间交互以及社交网络挖掘等方面;时空语义推理等研究是该领域 的拓展;应用情境可以在跨地域空间信息服务、城市人地交互关系挖掘、政府高效治理、领域事件时空关联趋势预 测等主题领域加以展开。【创新/局限】社会感知数据的利用可以在多任务场景下实现态势感知和知识推理。通过 融合多源异构时空数据和集成多种用户画像维度,能够实现多场景的精准知识服务。  相似文献   

11.
本文在分析用户文档和文献个性化推荐特点的基础上,提出了一个基于语义扩展的个性化推荐方法.试验结果表明,采用本方法在提高用户满意度上明显优于传统的基于关键词的方法.  相似文献   

12.
Users of Social Networking Sites (SNSs) like Facebook, LinkedIn or Twitter, are facing two problems: (1) it is difficult for them to keep track of their social friendships and friends’ social activities scattered across different SNSs; and (2) they are often overwhelmed by the huge amount of social data (friends’ updates and other activities). To address these two problems, we propose a user-centric system called “SocConnect” (Social Connect) for aggregating social data from different SNSs and allowing users to create personalized social and semantic contexts for their social data. Users can blend and group friends on different SNSs, and rate the friends and their activities as favourite, neutral or disliked. SocConnect then provides personalized recommendation of friends’ activities that may be interesting to each user, using machine learning techniques. A prototype is also implemented to demonstrate these functionalities of SocConnect. Evaluation on real users confirms that users generally like the proposed functionalities of our system, and machine learning can be effectively applied to provide personalized recommendation of friends’ activities and help users deal with cognitive overload.  相似文献   

13.
Recently, graph neural network (GNN) has been widely used in sequential recommendation because of its powerful ability to capture high-order collaborative relations, greatly promoting recommendation performance. However, some existing GNN-based methods fail to make full use of multiple relevant features of nodes and ignore the impact of semantic association between nodes on extracting user preferences. To this end, we propose a multi-feature fused collaborative attention network MASR, which sufficiently learns the temporal and positional features of nodes, and innovatively measures the importance of these two features for analyzing the nodes’ dynamic patterns. In addition, we incorporate semantic-enriched contrastive learning into collaborative filtering to enhance the semantic association between nodes and reduce the noise from the structural neighborhood, which has a positive effect on the sequential recommendation. Compared with the baseline models, the performance of MASR on MovieLens, CDs and Beauty datasets is improved by 2.0%, 2.1% and 1.7% respectively, proving its effectiveness in the sequential recommendation.  相似文献   

14.
蒋焰 《现代情报》2014,34(3):82-86
本文主要介绍了基于网络环境和基于图书馆的自主学习平台建设方法,采用Web3.0中的语义网、概念图相关理论与技术,将语义网技术与概念图理论应用到数字图书馆中实现图书馆资源整合、个性化图书推荐与个性化导航等自主学习平台中,该个性化自主学习平台包括个性化处理模块、信息资源整合处理模块、语义分析处理模块、查询模块,为提高图书馆有效利用信息资源与提高读者自主学习提供一种可行性解决方案。  相似文献   

15.
如何准确分析用户行为,向用户提供满意的网页信息,一直以来都是个性化信息推荐系统设计的目标。本文在分析现有个性化信息推荐模型的基础上,针对以往研究在推荐兴趣时仅根据语义相关度进行协助性信息推荐,而忽略用户行为规律所包含的潜在兴趣信息的不足,尝试提出一个结合Web语义挖掘和FP-tree规则发现技术的个性化信息推荐模型。该模型利用本体对语义的明确化描述,在挖掘用户行为信息时获取用户兴趣偏好的语义信息,并利用FP-tree技术根据以获取的语义信息推理出用户兴趣行为模式,从而在信息推荐时不仅能准确理解用户兴趣偏好,也能根据用户潜在兴趣规律,推荐给用户更全面的网页信息。  相似文献   

16.
Existing approaches to learning path recommendation for online learning communities mainly rely on the individual characteristics of users or the historical records of their learning processes, but pay less attention to the semantics of users’ postings and the context. To facilitate the knowledge understanding and personalized learning of users in online learning communities, it is necessary to conduct a fine-grained analysis of user data to capture their dynamical learning characteristics and potential knowledge levels, so as to recommend appropriate learning paths. In this paper, we propose a fine-grained and multi-context-aware learning path recommendation model for online learning communities based on a knowledge graph. First, we design a multidimensional knowledge graph to solve the problem of monotonous and incomplete entity information presentation of the single layer knowledge graph. Second, we use the topic preference features of users’ postings to determine the starting point of learning paths. We then strengthen the distant relationship of knowledge in the global context using the multidimensional knowledge graph when generating and recommending learning paths. Finally, we build a user background similarity matrix to establish user connections in the local context to recommend users with similar knowledge levels and learning preferences and synchronize their subsequent postings. Experiment results show that the proposed model can recommend appropriate learning paths for users, and the recommended similar users and postings are effective.  相似文献   

17.
张彬  徐建民  吴树芳 《情报科学》2020,38(4):147-152
【目的/意义】通过对大数据环境下的多源用户兴趣特征有效融合,缓解个性化推荐中用户兴趣偏好数据的稀疏性和准确性问题。【方法/过程】考虑到多域的数据权威度、内容质量及体系结构的差异化较为明显,提出了基于多源用户标签的跨域兴趣融合模型,首先把多个域中的用户兴趣进行标签化处理,然后利用跨域用户识别和标签权重归一方法得到多个域的用户实体-标签矩阵,最后使用域权重影响系数对标签进行融合,构造具有复合权重的用户兴趣标签集。【结果/结论】使用5个来源数据域进行实验与分析,融合模型能够有效提高标签用户覆盖效果,在查全率不断提高的情况,融合域能够保持较高的标签用户查准率,有效提高用户兴趣特征的描绘效果。  相似文献   

18.
Topic models are widely used for thematic structure discovery in text. But traditional topic models often require dedicated inference procedures for specific tasks at hand. Also, they are not designed to generate word-level semantic representations. To address the limitations, we propose a neural topic modeling approach based on the Generative Adversarial Nets (GANs), called Adversarial-neural Topic Model (ATM) in this paper. To our best knowledge, this work is the first attempt to use adversarial training for topic modeling. The proposed ATM models topics with dirichlet prior and employs a generator network to capture the semantic patterns among latent topics. Meanwhile, the generator could also produce word-level semantic representations. Besides, to illustrate the feasibility of porting ATM to tasks other than topic modeling, we apply ATM for open domain event extraction. To validate the effectiveness of the proposed ATM, two topic modeling benchmark corpora and an event dataset are employed in the experiments. Our experimental results on benchmark corpora show that ATM generates more coherence topics (considering five topic coherence measures), outperforming a number of competitive baselines. Moreover, the experiments on event dataset also validate that the proposed approach is able to extract meaningful events from news articles.  相似文献   

19.
吕果  李法运 《情报探索》2014,(2):101-105,110
基于协同过滤(CF)的个性化推荐技术,提出一种移动设备个性化软件推荐系统.该系统根据协同过滤的理论,首先通过软件类别兴趣相似度的计算,筛选出软件类别相似的用户候选集,过滤所有移动用户,减小产生的用户候选推荐集;然后对用户候选推荐集进行最近邻居的相似性计算以找出目标用户的邻居集合,并且对邻居集合中的邻居评分进行实时更新;最后根据兴趣相似度最大的K个邻居形成目标用户的Top-N推荐集.在第三方手机软件管理平台上通过监测推荐软件的下载或浏览量,验证系统的有效性和准确性.  相似文献   

20.
Identifying and extracting user communities is an important step towards understanding social network dynamics from a macro perspective. For this reason, the work in this paper explores various aspects related to the identification of user communities. To date, user community detection methods employ either explicit links between users (link analysis), or users’ topics of interest in posted content (content analysis), or in tandem. Little work has considered temporal evolution when identifying user communities in a way to group together those users who share not only similar topical interests but also similar temporal behavior towards their topics of interest. In this paper, we identify user communities through multimodal feature learning (embeddings). Our core contributions can be enumerated as (a) we propose a new method for learning neural embeddings for users based on their temporal content similarity; (b) we learn user embeddings based on their social network connections (links) through neural graph embeddings; (c) we systematically interpolate temporal content-based embeddings and social link-based embeddings to capture both social network connections and temporal content evolution for representing users, and (d) we systematically evaluate the quality of each embedding type in isolation and also when interpolated together and demonstrate their performance on a Twitter dataset under two different application scenarios, namely news recommendation and user prediction. We find that (1) content-based methods produce higher quality communities compared to link-based methods; (2) methods that consider temporal evolution of content, our proposed method in particular, show better performance compared to their non-temporal counter-parts; (3) communities that are produced when time is explicitly incorporated in user vector representations have higher quality than the ones produced when time is incorporated into a generative process, and finally (4) while link-based methods are weaker than content-based methods, their interpolation with content-based methods leads to improved quality of the identified communities.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号