| 基于资源的协作过滤推荐算法研究 |
| |
| 引用本文： | 纪良浩,王国胤.基于资源的协作过滤推荐算法研究[J].计算机工程与应用,2008,44(8):164-168. |
| |
| 作者姓名： | 纪良浩 王国胤 |
| |
| 作者单位： | 重庆邮电大学,计算机科学与技术研究所,重庆,400065 |
| |
| 基金项目： | 国家自然科学基金( the National Natural Science Foundation of China under Grant No.60373111)，重庆市自然科学基金( the NaturalScience Foundation of Chongqing City of China under Grant No.2005BA2003)，新世纪优秀人才支持计划，重庆邮电大学自然科学基金 |
| |
| 摘 要： | 协作过滤是当今应用最为普遍的个性化推荐算法,然而数据的稀疏性和算法的可扩展性一直是协作过滤算法所面临的两大问题。提出了一种新的推荐算法——基于资源的协作过滤算法。该算法在对资源项目依内容划分的基础上,将用户—项目评分矩阵转换为用户—资源类别评分矩阵,然后对用户聚类,在目标用户所在的簇中寻找其最近邻居并产生推荐。实验表明,该算法不仅降低了数据的稀疏性和维度,缩小了目标用户最近邻的查找范围,算法的扩展性得到了有效改善,而且提高了最近邻的准确度,推荐精度较以往传统算法有明显提高。
|
| 关 键 词： | 协作过滤 稀疏 扩展 聚类 推荐 |
| 文章编号： | 1002-8331（2008）08-0164-05 |
| 收稿时间： | 2007-07-20 |
| 修稿时间： | 2007-11-06 |
Collaborative filtering based on item content |
| |
| JI Liang-hao,WANG Guo-yin.Collaborative filtering based on item content[J].Computer Engineering and Applications,2008,44(8):164-168. |
| |
| Authors: | JI Liang-hao WANG Guo-yin |
| |
| Affiliation: | Institute of Computer Science and Technology，Chongqing University of Posts and Telecommunications，Chongqing 400065，China |
| |
| Abstract: | Collaborative filtering is the most prevalent algorithm of personalized service,but there are always two difficult problems for collaborative filtering algorithms,that is,data sparsity and expansibility.In this paper,a collaborative filtering algorithm is proposed based on item category.On the foundation of classifying items,it converts rating matrix of user-item into user-category of item.And then it clusters users,finds the nearest neighbors of active users in the sub-clustering that the active users exist in.Finally,it recommends to active users.Experiments show that the proposed algorithm reduces the data sparsity and dimensionality, its recommendations are good,and the simultaneity and expansibility of the algorithm is improved effectively. |
| |
| Keywords: | collaborative filtering sparsity expansibility clustering recommendation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
