检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:徐元萍 陈翔[1] Xu Yuanping;Chen Xiang(School of Management&Economics,Beijing Institute of Technology,Beijing 100081,China)
机构地区:[1]北京理工大学管理与经济学院,北京100081
出 处:《计算机应用研究》2020年第8期2310-2314,共5页Application Research of Computers
基 金:国家自然科学基金资助项目(71572013,71872013)。
摘 要:准确性推荐中存在商品类型单一、流行商品多、缺乏新意的问题,因而新颖性推荐得到重视,但已有研究在设计算法时未考虑项的特征,无法针对不同用户帮其区分和挑选具备较高新颖度的项。为提高推荐系统的性能,对基于随机游走的方法进行改进,提出融合新颖性特征的推荐算法。从兴趣扩展和预测角度分析项的特征,给出完善的新颖度定义,并结合用户需求构建新的转移概率,产生个性化的推荐列表,提高了列表内容的新意。实验结果表明,提出的算法较现有算法对准确率影响较小,同时在新颖性指标上有明显提升,并得出通过融合新颖性特征能够在兼顾准确性的情况下有效改善推荐内容的结论。Focusing on problems of the accuracy recommendation system that the recommended commodity type is relatively single,and commodities are mostly popular goods and lack of freshness,the novelty recommendation is gradually gaining attention.However,current researches don’t combine item features when designing algorithms,which make them unable to distinguish and select items with higher novelty for different users.In order to improve the performance of the recommendation system,this paper improved the method based on random walk and designed a new recommendation algorithm by fusing novelty features.This algorithm further analyzed features of items and gave the formal definition of the novelty from perspectives of user interest expansion and prediction.This paper analyzed user demands,constructed new transition probability,generated personalized recommendation lists and improved the novelty of the lists.The experimental results show that the proposed algorithm has less influence on the accuracy than existing methods and has significant improvement on novelty indexes.It concludes that by fusing novel features,this system can improve the recommendation contents effectively while taking into account the accuracy.
分 类 号:TP181[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.12.162.40