«上一篇/Previous Article|本期目录/Table of Contents|下一篇/Next Article»

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:

26

期数:

2016年03期

页码:

63-66

栏目:

智能、算法、系统工程

出版日期:

2016-03-10

文章信息/Info

Title:

 An Improved Collaborative Filtering Recommendation Algorithm for Data Sparsity

文章编号:

1673-629X（2016)03-0063-04

作者:

 高倩[1]; 何聚厚[2]

 1.陕西师范大学 计算机科学学院；2.陕西师范大学 现代教学技术教育部重点实验室

Author(s):

 GAO Qian[1]; HE Ju-hou[2]

关键词:

 ; 用户相似性; 属性; 兴趣; 动态; 数据稀疏性

Keywords:

 ; user similarity; attribute; interest; dynamic; data sparsity

分类号:

TP301.6

文献标志码:

A

摘要:

 用户相似性和最近邻集合是协同过滤算法中最重要的两个步骤。传统的协同过滤算法依靠用户评分计算用户相似性并寻找K个邻居作为最近邻的方法为用户产生推荐，但是在数据稀疏的情况下，仅仅依靠用户评分使得推荐效果不准确。针对以上问题，文中提出一种改进的面向数据稀疏的协同过滤推荐算法。该方法引入用户属性相似性和用户兴趣度相似性，并结合传统的用户评分相似性计算用户间的相似度，通过多次实验调整三者的权重，并且采用动态选取邻居集合的方法确定用户的最近邻，从而为用户推荐最合适的项目，增强了方法实用性，以此来缓解用户数据稀疏性问题。实验结果表明，文中方法能够充分利用用户的各类数据信息，提高了预测评分的准确性及推荐质量。

Abstract:

 User similarity and nearest neighbor set is two important steps in acollaborative filtering algorithm. The traditional Collaborative Filtering ( CF) computes user similarity only relying on user rating and finds K neighbors as nearest neighbor to produce recommendation for users,but in the case of sparse data,only relying on user rating calculation makes the recommendation effect inaccurate. To solve the problems,an improved collaborative filtering recommendation algorithm for data sparsity is proposed,which introduces the similarity of user attributes and user interest,combined with traditional user rating similarity to compute similarity between users. The weights of three is adjusted through several experiments,and the dynamic method is used to search the user’ s nearest neighbor to recommend suitable i-tems for users,in order to alleviate user data sparsity problem. Experimental results show that this method can make full use of all kinds of users’ data information,improving the accuracy of predicted ratings and quality of recommendation.

常用功能

更新日期/Last Update: 2016-06-12