共查询到20条相似文献,搜索用时 156 毫秒
1.
传统的协同过滤推荐算法直接根据用户对物品的评分进行推荐,忽略了评论文本中隐含的重要信息,当用户对物品的评论较少时,由于数据的稀疏性会造成推荐效果的不准确和单一。本文提出了一种基于LDA主题模型的协同过滤推荐算法LDA-CF(Latent Dirichlet Allocation model-LDA-Collaborative Filtering),在传统的协同过滤算法基础上,通过LDA模型对评论文本中的主题进行分类,从各个主题层面挖掘用户的情感偏好,计算用户之间的相似度,进而向目标用户推荐商品。对京东平台牙膏的评论数据集的实验结果表明,该算法不仅可以缓解由于评分数据较少造成的稀疏性问题,推荐的精确度也有所提高。 相似文献
2.
本文提出一种基于LDA(Latent Dirichlet Allocation)主题模型的协同过滤算法,通过提取并分析商户所接收到的来自不同用户的评论文本,计算商户之间的相似度,再联合传统的基于物品的协同过滤算法,从而进行推荐.实验结果表明,该方法取得了较为理想的结果,能够提高推荐准确度. 相似文献
3.
4.
5.
目前旅游信息数据量庞大却无法满足用户的特定需求,很多不确定因素导致用户评分出现偏差,使推荐结果不准确且实时性差。鉴于此,本文提出构建基于Spark框架的瀑布型融合旅游推荐系统。首先,利用爬虫技术对各大旅游网站景点信息进行爬取和整理,搭建Spark框架读取数据并进行数据清洗和预处理,通过API将景点地理位置转换为经纬度坐标以便后续可视化;其次,设计2个过滤层,第一层采用SimHash算法,该算法能够实现海量数据的快速降维处理,有效节约时间。第二层采用余弦相似度算法并利用TF-IDF计算词频,进而过滤和更新旅游景点推荐数据库,最终形成反馈给用户的推荐数据库;最后,用户从系统推荐的Top-N景点选择自己感兴趣的景点,系统将会对其进行地图可视化,并标注每个省市景点的数量和平均票价,为用户提供智能旅游推荐的完美体验。该系统从用户需求出发,通过分析用户需求文本语义,与旅游数据库进行相似度计算进而获得推荐结果,达到了实时性和准确性的统一,是对旅游推荐系统的补充和完善,具有一定的实用价值。 相似文献
6.
针对传统的基于协同过滤的移动服务推荐方法存在的数据稀疏性和用户冷启动问题,提出一种基于上下文相似度和社会网络的移动服务推荐方法(Context-similarity and Social-network based Mobile Service Recommendation,CSMSR).该方法将基于用户的上下文相似度引入个性化服务推荐过程,并挖掘由移动用户虚拟交互构成的社会关系网络,按照信任度选取信任用户;然后结合基于用户评分相似度计算发现的近邻,分别从相似用户和信任用户中选择相应的邻居用户,对目标用户进行偏好预测和推荐.实验表明,与已有的服务推荐方法TNCF、SRMTC及CF-DNC相比,CSMSR方法有效地缓解数据稀疏性并提高推荐准确率,有利于发现用户感兴趣的服务,提升用户个性化服务体验. 相似文献
7.
8.
传统的协同过滤推荐算法存在推荐准确性不高的问题。在计算相似度时,当得分向量的结果差异性不大时,可能会产生相似的结果向量,从而降低相似度结果的准确性。针对这一问题,提出一种优化的用户相似度协同过滤推荐算法,在传统的余弦相似度计算中加入一个平衡因子,并通过实验验证加入的平衡因子阈值算法的有效性。实验结果表明,优化的用户相似度协同过滤推荐算法能够显著提升用户相似度计算的准确性,从而得到较好的推荐结果。 相似文献
9.
10.
11.
Lin Shi Feiyu Lin Tianchu Yang Jun Qi Wei Ma Shoukun Xu 《Wireless Personal Communications》2014,76(4):731-745
Tourism is an information-intensive business. At present, there are a lot of information and tourism resources available on the internet that lead to low searching efficiency and effectiveness, the user may get too many seeking results but not related to his interest, or few results than his expected. The user can know clearly what he wants, but sometime the user doesn’t know what kind information he needs. User’s demand can be formulated as direct demand and potential preference. At the same time, the study shows that there is strong relationship between the traveler’s potential preference and the characteristics of tourism resources. In order to solve the information overload challenge, recommendation services are increasingly emerging. Currently, recommendation methods focus on dealing with personalized matching based on the user preference. However, these methods skip the user’s direct demand. In this paper, we propose ontology-driven recommendation strategies based on user’s context. The strategies use ontology to describe and integrate tourism resources, achieve the goal of associating user’s direct needs and his potential preference as the context in recommendation. Moreover, theoretical analysis and experiments show that the proposed approach is feasible, the results of the evaluation are discussed. 相似文献
12.
Wireless Networks - Collaborative filtering (CF) is a prevailing technique utilized for recommendation systems and has been comprehensively explored to tackle the problem of information overload... 相似文献
13.
以准确向用户推荐商品,提升电子商务网站销售量为目标,设计基于个性化特征的电子商务智能推荐系统。系统以个性化推荐引擎为核心,采集交易事务、商品特征、用户评价等数据,利用基于个性化特征的协同过滤推荐算法计算商品间相似度,确定新商品的近邻,根据近邻用户对新商品的评价结果选择商品进行推荐。测试结果表明,该系统的电子商务商品推荐误差小,有利于提升电子商务网站交易率,而且电子商务商品推荐性能明显优于其他推荐系统。 相似文献
14.
In view of the problem of trust relationship in traditional trust-based service recommendation algorithm,and the inaccuracy of service recommendation list obtained by sorting the predicted QoS,a trust expansion and listwise learning-to-rank based service recommendation method (TELSR) was proposed.The probabilistic user similarity computation method was proposed after analyzing the importance of service sorting information,in order to further improve the accuracy of similarity computation.The trust expansion model was presented to solve the sparseness of trust relationship,and then the trusted neighbor set construction algorithm was proposed by combining with the user similarity.Based on the trusted neighbor set,the listwise learning-to-rank algorithm was proposed to train an optimal ranking model.Simulation experiments show that TELSR not only has high recommendation accuracy,but also can resist attacks from malicious users. 相似文献
15.
解决设备差异性造成的Wi-Fi信号强度不确定问题是位置指纹室内定位应用与推广的关键.一种基于设备间接收信号强度(Received Signal Strength,RSS)相关性的位置指纹室内定位方法被提出.以智能手机为用户终端,离线阶段,通过智能手机扫描的Wi-Fi信号强度信息,经过数据处理,筛选稳定的接入点(Access Point,AP),构建离线指纹数据库;在线定位阶段,对于实时获取的Wi-Fi信号强度信息,进行筛选处理后,挑选与离线指纹共同拥有的AP,并根据该AP集合,形成新的离线指纹和在线指纹.对离线指纹按RSS的大小降序排序;在线指纹,则以同一次序对RSS排序,然后利用皮尔逊相关系数和杰卡德相似系数,计算指纹相似度并排序,通过K最近邻(K-Nearest Neighbor,KNN)算法实现用户定位.实验表明该方法可有效解决设备差异性问题,并实现精确定位,平均定位误差达到1.7 m. 相似文献
16.
本文采用CTM主题模型对现有的在线医生专家推荐模型进行优化,首先利用患者提出的健康问题,得到问题-主题概率分布,然后根据医生历史回答的所有问题得到医生-主题概率分布,接着对得到的两项分布用杰卡德相似系数计算方法计算相似度,进而将主题相似度高的医生列表推荐给患者.实验阶段先对好大夫在线轻问诊模块的过敏反应科的数据进行采集... 相似文献
17.
异质网络相似度学习,即分析两个不同类型对象间的相关程度.不同类型对象在异质网络中的重要程度不同,它们在相似度学习过程中的发挥的作用也不同.针对异质网络,提出了一种基于节点影响力的相似度度量方法NISim,该模型既考虑了网络中的链接结构,也保留了网络中的语义信息,同时区分不同类型节点对异质网络的作用.在异质信息网络环境下,通过启发式规则区分并量化不同类型节点的影响力权值,并结合网络链接结构和节点间语义关系,解决了提高相似度学习准确性的问题.实验结果表明,该方法能够有效地对异质信息网络不同类型节点进行相似度度量,可以应用在网络搜索、推荐系统以及知识图谱构建等不同领域. 相似文献
18.
19.
With the rapid proliferation of information and communication technology (ICT), the vast amount of available data creates information overload. The Websites and e‐commerce applications employ several information filtering methods such as personalized recommender system to manage the information overload. The recommender system assists the users in obtaining the desired list of products based on their interest. Several existing research works focus on the novelty or unexpectedness in the recommendation list while ensuring the quality to enhance the recommendation mechanism. It is essential to balance the unexpected and useful products or services to generate the satisfactory personalized recommendations with novelty. Thus, this paper proposes a novelty‐driven movie suggestion using integrated matrix factorization and temporal‐aware clustering optimization (NOMINATE). The proposed approach determines the personalized preferences through probabilistic matrix factorization (PMF) and contextually updates the rules and extracts the user preferences based on the inherent features of both the users and movies with temporal information. The NOMINATE approach also suggests the novelty‐driven, and desired top‐N movies to the users through the K‐means, and particle swarm optimization (PSO)‐based clustering algorithm with the help of LOD source. To identify the expert users, the NOMINATE approach applies the K‐means and PSO‐based clustering algorithm to enrich the personalized features of the users. Moreover, it integrates the relevant features with the preferred set of features for each user using the LOD source and decides a set of optimal preferences of the users. Finally, the NOMINATE approach generates the top‐N recommendation list for the corresponding user through ranking method. The experiment results stipulate that the NOMINATE approach personalize the top‐N movie recommendations with high performance regarding accuracy and novelty when compared with the existing recommendation method. 相似文献
20.
《电子学报:英文版》2016,(5):943-949
User preferences elicitation is a key issue of location recommendation.This paper proposes an adaptive user preferences elicitation scheme based on Collaborative filtering (CF) algorithm for location recommendation.In this scheme,user preferences are divided into user static preferences and user dynamic preferences.The former is estimated based on location category information and historical ratings.Meanwhile,the latter is evaluated based on geographical information and two-dimensional cloud model.The advantage of this method is that it not only considers the diversity of user preferences,but also can alleviate the data sparsity problem.In order to predict user preferences of new locations more precisely,the scheme integrates the similarity of user static preferences,user dynamic preferences and social ties into CF algorithm.Furthermore,the scheme is paraltelized on the Hadoop platform for significant improvement in efficiency.Experimental results on Yelp dataset demonstrate the performance gains of the scheme. 相似文献