检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陆航 师智斌[1] 刘忠宝[2] LU Hang;SHI Zhibin;LIU Zhongbao(Research Institute of Big Data and Network Security,School of Big Data,North University of China,Taiyuan 030051,China;School of Software,North University of China,Taiyuan 030051,China)
机构地区:[1]中北大学大数据学院大数据与网络安全研究所,太原030051 [2]中北大学软件学院,太原030051
出 处:《计算机工程与应用》2020年第7期24-29,共6页Computer Engineering and Applications
基 金:山西省高等学校优秀青年学术带头人项目(2016)。
摘 要:针对传统的协同过滤算法中单一评分相似性计算不准确的问题,提出融合用户兴趣和评分差异的协同过滤推荐算法。将TF-IDF思想运用到用户对标签的权重计算中,并使用指数衰减函数和时间窗口捕捉用户兴趣的变化;根据历史评分矩阵,充分考虑用户评分值差异、评判准则差异、影响力差异和项目影响差异等影响因子,定义了一种评分差异相似性度量算法;最后将用户兴趣相似性和评分差异相似性进行加权融合,获取更加准确的用户邻居,从而预测项目评分并进行推荐。在数据集Movielens的实验表明,提出的算法能有效提高推荐精度。Aiming at the inaccuracy of single rating similarity calculation in traditional collaborative filtering algorithm, a collaborative filtering recommendation algorithm based on user interest and the ratings difference is proposed. Firstly, the TF-IDF is integrated into the tag weight calculation. An exponential decay function and a time window are used to capture the change of user interest. Secondly, according to the rating matrix, ratings difference similarity algorithm is defined by considering the difference of ratings, evaluation criteria, user and item influence. Finally, user interest similarity and ratings difference similarity are weighted and fused to obtain the nearest neighbors more accurately, which predicts item rating and makes recommendations. Experiments on the Movielens dataset show that the proposed algorithm can effectively improve the recommendation accuracy.
关 键 词:协同过滤 TF-IDF 指数衰减函数 时间窗口 差异性
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229