###
DOI:
计算机系统应用英文版:2015,24(4):196-200
本文二维码信息
码上扫一扫!
基于偏好的二分图网络模型Top-N推荐
(福州大学 数学与计算机科学学院学院, 福州 350108)
Top-N Recommendation Based on Preference Bipartite Network
(College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350108, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 1509次   下载 3305
Received:August 12, 2014    Revised:September 16, 2014
中文摘要: 针对推断网络(NBI)的二分图方法中只是考虑用户是否评价过项目, 却没有利用用户评分高低这一局限性, 提出基于偏好的推断网络(PNBI)推荐方法. 该方法在推断网络的基础上, 考虑单个用户对项目评分高低体现了该用户对项目的喜好程度, 在"用户-项目"的资源分配过程中, 将资源分配给评分值较大的评分项, 该方法能克服NBI算法中无法使用低评分值数据的缺陷. 考虑到数据的稀疏性问题, 采用倒排表的方法来节省相似度的运算次数, 加速算法. 在MovieLens数据集上的实验表明, PNBI二分图推荐算法在准确率、覆盖率和召回率三个方面均优于NBI二分图推荐算法.
中文关键词: 偏好  二分图  推荐算法  倒排表
Abstract:In view of the bipartite graph method of network-based inference (NBI) only considered whether users evaluated the project or not, but not given their scores, the thesis proposed a preferential network-based inference (PNBI) recommended method. Based on inference network, the method takes into account that user's rating values for the program reflects his degree of preference. In the "User-Item" resource allocation process, the method allocates resources to the item that gets a higher score, this method can overcome the NBI algorithm's disadvantage of failing to use low score value. Considering the sparsity of data, the method uses inverted list to discrese the number of calculation to accelerate the algorithm. Experiments on MovieLens dataset show that, PNBI bipartite graph recommended algorithm outperforms NBI bipartite graph recommended algorithm in accuracy, coverage and recall.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金(61300104)
引用文本:
陈添辉,林世平,郭昆,廖寿福.基于偏好的二分图网络模型Top-N推荐.计算机系统应用,2015,24(4):196-200
CHEN Tian-Hui,LIN Shi-Ping,GUO Kun,LIAO Shou-Fu.Top-N Recommendation Based on Preference Bipartite Network.COMPUTER SYSTEMS APPLICATIONS,2015,24(4):196-200