A K-medoids Algorithm Based Method to Alleviate the Data Sparsity in Collaborative Filtering | |
Ziqi Lin1,2; Wancheng Ni1; Haidong Zhang1; Meijing Zhao1; Yiping Yang1 | |
2015-07 | |
会议日期 | 2015-7 |
会议地点 | 杭州 |
关键词 | Data Sparsity K-medoids Algorithm User-based Collaborative Filtering Recommendation |
英文摘要 | User-based collaborative filtering is an effective and widely-used method in recommender systems. But the data sparsity (the ratings or actions are very sparse for resources) is an inherent limitation of this method. In order to solve the data sparsity, an approach which uses K-medoids algorithm in collaborative filtering is proposed. And the content features of resources are applied to clustering. This approach mainly includes three parts. Firstly, the resources are clustered by K-medoids algorithm. Secondly, the user-behavior data are condensed based on the clustered resources. Thirdly, the recommended list is generated via user-based collaborative algorithm using the compressed user-behavior data. Finally, experiments on data from an Internet education resources sharing platform indicate that the proposed method brings significant improvement both on Recall and Precision in sparse dataset. |
语种 | 英语 |
内容类型 | 会议论文 |
源URL | [http://ir.ia.ac.cn/handle/173211/26221] |
专题 | 自动化研究所_综合信息系统研究中心 |
通讯作者 | Wancheng Ni |
作者单位 | 1.CASIA-HHT Joint Laboratory of Smart Education 2.Integrated Information Research Center, Institute of Automation Chinese Academy of Science |
推荐引用方式 GB/T 7714 | Ziqi Lin,Wancheng Ni,Haidong Zhang,et al. A K-medoids Algorithm Based Method to Alleviate the Data Sparsity in Collaborative Filtering[C]. 见:. 杭州. 2015-7. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论