首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
[目的/意义]在社会化标注系统自组织运行的基础上,构建个性化信息推荐的多维度融合与优化模型,进而在大数据环境下,为用户提供精准的个性化信息推荐服务,从而进一步丰富个性化信息推荐的理论体系以及拓展个性化信息推荐的研究方法。[方法/过程]首先,对每一种个性化信息推荐方法的优点和不足进行深入分析;然后,将基于图论(社会网络关系)、基于协同过滤以及基于内容(主题)3种个性化信息推荐方法进行多维度深度融合,构建个性化信息推荐多维度融合模型;最后,对社会化标注系统中个性化信息推荐多维度融合模型进行优化,从而解决个性化推荐过程中用户"冷启动"、数据稀疏性和用户偏好漂移等问题。[结果/结论]通过综合考虑现有的基于图论(社会网络关系)、基于协同过滤以及基于内容(主题)的个性化信息推荐方法各自的贡献和不足,实现3种方法之间的多维度深度融合,并结合心理认知、用户情境以及时间、空间等优化因素,最终构建出社会化标注系统中个性化信息推荐多维度融合与优化模型。  相似文献   

2.
结合社会网络分析的推荐方法研究已成为热点。电子商务中用户的动态行为异常丰富,隐含了用户的关联关系,利用这些信息进行商品推荐是个新研究思路。分析电子商务系统中用户动态行为关联关系及用户间明确好友关系形成复杂隐性社会网络,将社团划分算法应用到该网络中,则社团内部用户联系紧密且具有更相似的消费偏好,据此设计了电子商务中社团内部的推荐方法,应用R语言进行了算法的验证并与传统的协同过滤算法进行比较。实验表明,该推荐算法提高了推荐的质量,缓解了传统推荐算法中数据稀疏性及冷启动问题等。  相似文献   

3.
A recommender system has an obvious appeal in an environment where the amount of on-line information vastly outstrips any individual’s capability to survey. Music recommendation is considered a popular application area. In order to make personalized recommendations, many collaborative music recommender systems (CMRS) focus on capturing precise similarities among users or items based on user historical ratings. Despite the valuable information from audio features of music itself, however, few studies have investigated how to utilize information extracted directly from music for personalized recommendation in CMRS. In this paper, we describe a CMRS based on our proposed item-based probabilistic model, where items are classified into groups and predictions are made for users considering the Gaussian distribution of user ratings. In addition, this model has been extended for improved recommendation performance by utilizing audio features that help alleviate three well-known problems associated with data sparseness in collaborative recommender systems: user bias, non-association, and cold start problems in capturing accurate similarities among items. Experimental results based on two real-world data sets lead us to believe that content information is crucial in achieving better personalized recommendation beyond user ratings. We further show how primitive audio features can be combined into aggregate features for the proposed CRMS and analyze their influences on recommendation performance. Although this model was developed originally for music collaborative recommendation based on audio features, our experiment with the movie data set demonstrates that it can be applied to other domains.  相似文献   

4.
基于社会标签的推荐系统研究   总被引:1,自引:0,他引:1  
社会标签是一种新颖的大众索引方法,在Web 2.0时代各种收藏、检索、共享网站中得到广泛的应用,个性化推荐系统是基于用户的偏好为用户提供个性化信息服务的重要技术。本文针对推荐技术如何与社会标签结合的问题,分析了最新的研究现状和应用。详细阐述了3个方面的研究进展:标签推荐系统的研究、基于社会标签的个性化推荐系统的研究、社会标签的推荐应用系统。  相似文献   

5.
[目的/意义]通过融合用户社交与情境信息,构建虚拟知识社区个性化知识推荐模型并开展个性化知识推荐算法的设计,能够在一定程度上完善虚拟知识社区个性化知识推荐方法的理论体系,具有一定的理论价值和应用价值。[方法/过程]首先构建出基于用户社交与情境信息的虚拟知识社区个性化知识推荐模型,然后利用改进的最大团算法设计出虚拟知识社区个性化知识推荐算法,最后通过选取某虚拟知识社区的用户数据进行实例分析实现精准的个性化知识推荐。[结果/结论]在利用融合用户社交与情境信息进行虚拟知识社区个性化知识推荐过程中,通过对某虚拟知识社区的实例分析,表明其个性化知识推荐结果的精准度得到了显著的提升。  相似文献   

6.
Recommender Systems deal with the issue of overloading information by retrieving the most relevant sources in the wide range of web services. They help users by predicting their interests in many domains like e-government, social networks, e-commerce and entertainment. Collaborative Filtering (CF) is the most promising technique used in recommender systems to give suggestions based on liked-mind users’ preferences. Despite the widespread use of CF in providing personalized recommendation, this technique has problems including cold start, data sparsity and gray sheep. Eventually, these problems lead to the deterioration of the efficiency of CF. Most existing recommendation methods have been proposed to overcome the problems of CF. However, they fail to suggest the top-n recommendations based on the sequencing of the users’ priorities. In this research, to overcome the shortcomings of CF and current recommendation methods in ranking preference dataset, we have used a new graph-based structure to model the users’ priorities and capture the association between users and items. Users’ profiles are created based on their past and current interest. This is done because their interest can change with time. Our proposed algorithm keeps the preferred items of active user at the beginning of the recommendation list. This means these items come under top-n recommendations, which results in satisfaction among users. The experimental results demonstrate that our algorithm archives the significant improvement in comparison with CF and other proposed recommendation methods in terms of recall, precision, f-measure and MAP metrics using two benchmark datasets including MovieLens and Superstore.  相似文献   

7.
With the information explosion of news articles, personalized news recommendation has become important for users to quickly find news that they are interested in. Existing methods on news recommendation mainly include collaborative filtering methods which rely on direct user-item interactions and content based methods which characterize the content of user reading history. Although these methods have achieved good performances, they still suffer from data sparse problem, since most of them fail to extensively exploit high-order structure information (similar users tend to read similar news articles) in news recommendation systems. In this paper, we propose to build a heterogeneous graph to explicitly model the interactions among users, news and latent topics. The incorporated topic information would help indicate a user’s interest and alleviate the sparsity of user-item interactions. Then we take advantage of graph neural networks to learn user and news representations that encode high-order structure information by propagating embeddings over the graph. The learned user embeddings with complete historic user clicks capture the users’ long-term interests. We also consider a user’s short-term interest using the recent reading history with an attention based LSTM model. Experimental results on real-world datasets show that our proposed model significantly outperforms state-of-the-art methods on news recommendation.  相似文献   

8.
针对创新社区日益增长的海量信息阻碍了用户对知识进行有效获取和创造的现状,将模糊形式概念分析(FFCA)理论应用于创新社区领先用户的个性化知识推荐研究。首先识别出创新社区领先用户并对其发帖内容进行文本挖掘得到用户——知识模糊形式背景,然后构建带有相似度的模糊概念格对用户偏好进行建模,最后基于模糊概念格和协同过滤的推荐算法为领先用户提供个性化知识推荐有序列表。以手机用户创新社区为例,验证了基于FFCA的领先用户个性化知识推荐方法的可行性,有助于满足用户个性化知识需求,促进用户更好地参与社区知识创新。  相似文献   

9.
基于商品属性与用户聚类的个性化服装推荐研究   总被引:1,自引:0,他引:1  
艾黎 《现代情报》2015,35(9):165-170
淘宝网作为电子商务时代最大的网上零售平台,为用户提供越来越多的商品与服务的同时,也出现了信息过载等一系列问题。鉴于此,本文提出了基于商品属性与用户聚类的个性化服装推荐方法,通过用户个人信息与对商品的评价,计算用户之间的相似度,进行聚类分析。与此同时,将商品化整为零,通过商品属性来计算商品的相似度,得到top-N相似列表。以此,综合商品与用户两者的权重值,实现为用户提供个性化的商品推荐,解决用户面对信息过载的难题,为用户节省精力,提高用户的购物体验。针对某一淘宝网店铺,本文提出了适合的混合推荐算法,并通过搜集实际数据进行了实证研究,对推荐结果进行准确性评价。  相似文献   

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

11.
【目的/意义】基于情境感知的个性化推荐技术引起了广泛关注,成为新的研究热点,本文针对高校移动图 书馆提出一种基于情境感知的知识资源推荐模型。【方法/过程】融入情境因素,通过基于改进受限玻尔兹曼机的协 同过滤算法来实现读者所处移动情境下的知识资源推荐。并通过真实数据集进行实验验证。【结果/结论】提出的 基于情境感知的知识资源推荐模型和算法,具有较高的准确度和效率,能够有效解决移动环境下高校读者个性化 知识资源推荐问题。  相似文献   

12.
Music has a close relationship with people's emotion and mental status. Music recommendation has both economic and social benefits. Unfortunately, most existing music recommendation methods were constructed based on genre features (e.g., style and album), which cannot meet the emotional needs of listeners. Furthermore, the “filter bubble” effect may make the situation even worse, when a user seeks music for emotional support. In this study, we designed a novel emotion-based personalized music recommendation framework to meet users’ emotional needs and help improve their mental status. In our framework, we designed a LSTM-based model to select the most suitable music based on users’ mood in previous period and current emotion stimulus. A care factor was used to adjust the results so that users’ mental status could be improved by the recommendation. The empirical experiments and user study showed that the recommendations of our novel framework are precise and helpful for users.  相似文献   

13.
随着Web2.0的广泛应用和新型社会化网络媒体的盛行,图书馆从资源匮乏状态逐渐转变为数据密集型的行业,并促使图书馆的信息服务方式开始从"以数据为主导"向"以用户为中心"进行过渡。针对图书馆个性化推荐研究在数据资源、技术实现和评价准则方面所存在的问题进行了简单的分析,并针对一些带有挑战性的问题提出了相应的解决方法。  相似文献   

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

15.
16.
Since meta-paths have the innate ability to capture rich structure and semantic information, meta-path-based recommendations have gained tremendous attention in recent years. However, how to composite these multi-dimensional meta-paths? How to characterize their dynamic characteristics? How to automatically learn their priority and importance to capture users' diverse and personalized preferences at the user-level granularity? These issues are pivotal yet challenging for improving both the performance and the interpretability of recommendations. To address these challenges, we propose a personalized recommendation method via Multi-Dimensional Meta-Paths Temporal Graph Probabilistic Spreading (MD-MP-TGPS). Specifically, we first construct temporal multi-dimensional graphs with full consideration of the interest drift of users, obsolescence and popularity of items, and dynamic update of interaction behavior data. Then we propose a dimension-free temporal graph probabilistic spreading framework via multi-dimensional meta-paths. Moreover, to automatically learn the priority and importance of these multi-dimensional meta-paths at the user-level granularity, we propose two boosting strategies for personalized recommendation. Finally, we conduct comprehensive experiments on two real-world datasets and the experimental results show that the proposed MD-MP-TGPS method outperforms the compared state-of-the-art methods in such performance indicators as precision, recall, F1-score, hamming distance, intra-list diversity and popularity in terms of accuracy, diversity, and novelty.  相似文献   

17.
Social applications foster the involvement of end users in Web content creation, as a result of which a new source of vast amounts of data about users and their likes and dislikes has become available. Having access to users’ contributions to social sites and gaining insights into the consumers’ needs is of the utmost importance for marketing decision making in general, and to advertisement recommendation in particular. By analyzing this information, advertisement recommendation systems can attain a better understanding of the users’ interests and preferences, thus allowing these solutions to provide more precise ad suggestions. However, in addition to the already complex challenges that hamper the performance of recommender systems (i.e., data sparsity, cold-start, diversity, accuracy and scalability), new issues that should be considered have also emerged from the need to deal with heterogeneous data gathered from disparate sources. The technologies surrounding Linked Data and the Semantic Web have proved effective for knowledge management and data integration. In this work, an ontology-based advertisement recommendation system that leverages the data produced by users in social networking sites is proposed, and this approach is substantiated by a shared ontology model with which to represent both users’ profiles and the content of advertisements. Both users and advertisement are represented by means of vectors generated using natural language processing techniques, which collect ontological entities from textual content. The ad recommender framework has been extensively validated in a simulated environment, obtaining an aggregated f-measure of 79.2% and a Mean Average Precision at 3 (MAP@3) of 85.6%.  相似文献   

18.
曾子明  李鑫 《情报杂志》2012,31(8):166-170
随着移动互联网的发展,越来越多的用户信息获取过程通过移动终端完成.但当前个性化推荐系统对用户情境的感知能力不足,缺乏为用户提供符合当前情境的个性化信息推荐服务.为此,本文提出了基于贝叶斯方法的情境化用户资源类别偏好学习以及融合该类别偏好的协同过滤个性化信息推荐.运用贝叶斯方法学习用户在不同情境下对各资源类别的偏好,然后将该类别偏好与传统协同过滤推荐算法相结合,生成符合用户当前情境的个性化信息推荐.实验表明本文提出的改进算法可以提高推荐的准确率.  相似文献   

19.
Collaborative Filtering techniques have become very popular in the last years as an effective method to provide personalized recommendations. They generally obtain much better accuracy than other techniques such as content-based filtering, because they are based on the opinions of users with tastes or interests similar to the user they are recommending to. However, this is precisely the reason of one of its main limitations: the cold-start problem. That is, how to recommend new items, not yet rated, or how to offer good recommendations to users they have not information about. For example, because they have recently joined the system. In fact, the new user problem is particularly serious, because an unsatisfied user may stop using the system before it could even collect enough information to generate good recommendations. In this article we tackle this problem with a novel approach called “profile expansion”, based on the query expansion techniques used in Information Retrieval. In particular, we propose and evaluate three kinds of techniques: item-global, item-local and user-local. The experiments we have performed show that both item-global and user-local offer outstanding improvements in precision, up to 100%. Moreover, the improvements are statistically significant and consistent among different movie recommendation datasets and several training conditions.  相似文献   

20.
In recent years, there has been a rapid growth of user-generated data in collaborative tagging (a.k.a. folksonomy-based) systems due to the prevailing of Web 2.0 communities. To effectively assist users to find their desired resources, it is critical to understand user behaviors and preferences. Tag-based profile techniques, which model users and resources by a vector of relevant tags, are widely employed in folksonomy-based systems. This is mainly because that personalized search and recommendations can be facilitated by measuring relevance between user profiles and resource profiles. However, conventional measurements neglect the sentiment aspect of user-generated tags. In fact, tags can be very emotional and subjective, as users usually express their perceptions and feelings about the resources by tags. Therefore, it is necessary to take sentiment relevance into account into measurements. In this paper, we present a novel generic framework SenticRank to incorporate various sentiment information to various sentiment-based information for personalized search by user profiles and resource profiles. In this framework, content-based sentiment ranking and collaborative sentiment ranking methods are proposed to obtain sentiment-based personalized ranking. To the best of our knowledge, this is the first work of integrating sentiment information to address the problem of the personalized tag-based search in collaborative tagging systems. Moreover, we compare the proposed sentiment-based personalized search with baselines in the experiments, the results of which have verified the effectiveness of the proposed framework. In addition, we study the influences by popular sentiment dictionaries, and SenticNet is the most prominent knowledge base to boost the performance of personalized search in folksonomy.  相似文献   

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

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