计算机科学 ›› 2015, Vol. 42 ›› Issue (3): 256-260.doi: 10.11896/j.issn.1002-137X.2015.03.053

• 人工智能 • 上一篇    下一篇

使用二分图网络提高协同推荐的准确性

冷亚军,陆 青,张俊岭   

  1. 上海电力学院经济与管理学院 上海201300,上海电力学院经济与管理学院 上海201300,浙江师范大学经济与管理学院 金华321004
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家自然科学基金项目(71201145),教育部人文社会科学研究基金项目(11YJC630283),上海高校选拔培养优秀青年教师科研专项基金项目(sdl10021),上海市教育委员会科研创新项目(15ZS064)资助

Using Bipartite Network for Enhancement of Collaborative Filtering

LENG Ya-jun, LU Qing and ZHANG Jun-ling   

  • Online:2018-11-14 Published:2018-11-14

摘要: 协同过滤是推荐系统中广泛使用的最成功的推荐技术,但却面临着严峻的稀疏性问题。评分数据稀疏性使得最近邻搜寻不够准确,导致推荐质量较差。使用二分图网络缓解协同过滤推荐系统中的稀疏性问题,即将用户和项目抽象为二分图网络中的节点,重新分配项目资源并计算项目间资源贴近度,据此填充用户未评分项目,将稀疏评分矩阵转化为完全矩阵。采用近邻传播聚类对评分矩阵进行聚类,提高算法的可扩展性。最后提出了两种不同的在线推荐策略:(1)通过加权目标用户所在类的邻居用户评分产生推荐(BNAPC1);(2)通过各个类的总体偏好产生推荐(BNAPC2)。在MovieLens和Netflix数据集上进行了实验,结果表明BNAPC1的预测精度优于BNAPC2,且与其他几种常用的推荐算法相比仍具有一定优势。

关键词: 推荐系统,协同过滤,二分图网络,近邻传播聚类

Abstract: Collaborative filtering is one of the most successful and widely used techniques among recommender systems.However,it suffers from serious problem in sparsity.Sparsity in ratings makes the formation of neighborhood inaccurate,thereby resulting in poor recommendations.In this paper,bipartite network was used to alleviate the sparsity problem in collaborative filtering.Users and items are mapped to nodes in bipartite network,and resources on items are redistributed.Resource approach degree between items is computed,and the original rating matrix is converted to complete matrix based on the resource approach degree.Then affinity propagation clustering was applied to cluster the ra-ting matrix to improve the scalability of our approach.Finally,two different recommendation methods were presented.One is generating recommendations according to neighbors in the cluster which active user belongs to (BNAPC1),and the other is generating recommendations according to clusters’ preferences (BNAPC2).Experiments on MovieLens and Netflix datasets show that BNAPC1 is more accurate than BNAPC2,and is also superior to existing alternatives.

Key words: Recommender systems,Collaborative filtering,Bipartite network,Affinity propagation clustering

[1] 吴湖,王永吉,王哲,等.两阶段联合聚类协同过滤算法[J].软件学报,2010,21(5):1042-1054
[2] Adomavicius G,Tuzhilin A.Toward the next generation of re-commender systems:a survey of the state-of-the-art and possible extensions[J].IEEE Transactions on Knowledge and Data Engineering,2005,17(6):734-749
[3] Barragáns-Martínez A B,Costa-Montenegro E,Burguillo J C,et al.A hybrid content-based and item-based collaborative filtering approach to recommend TV programs enhanced with singular value decomposition[J].Information Sciences,2010,180(22):4290-4311
[4] Jeong B,Lee J,Cho H.An iterative semi-explicit rating methodfor building collaborative recommender systems[J].Expert Systems with Applications,2009,36(3):6181-6186
[5] Leung C W K,Chan S C F,Chung F L.A collaborative filtering framework based on fuzzy association rules and multiple-level similarity[J].Knowledge and Information Systems,2006,10(3):357-381
[6] Kim H N,Ji A T,Ha I,et al.Collaborative filtering based on collaborative tagging for enhancing the quality of recommendation[J].Electronic Commerce Research and Applications,2010,9(1):73-83
[7] Sarwar B,Karypis G,Konstan J,et al.Item-based collaborative filtering recommendation algorithms[C] ∥Proceedings of the 10th International Conference on World Wide Web.2001:285-295
[8] 张译,靳雪翔,张毅,等.基于二分图的城市公交网络拓扑性质研究[J].系统工程理论与实践,2007,7:149-155
[9] Zhou T,Ren J,Medo M,et al.Bipartite network projection and personal recommendation[J].Physical Review E,2007,76(4):046115
[10] MacQueen J.Some methods for classification and analysis ofmultivariate observations[C] ∥Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability.1967:281-297
[11] Park H S,Jun C H.A simple and fast algorithm for K-medoids clustering[J].Expert Systems with Applications,2009,36(2):3336-3341
[12] Frey B J,Dueck D.Clustering by passing messages between data points[J].Science,2007,315(5814):972-976
[13] Ahn H J.A new similarity measure for collaborative filtering to alleviate the new user cold-starting problem[J].Information Sciences,2008,178(1):37-51
[14] Jeong B,Lee J,Cho H.Improving memory-based collaborativefiltering via similarity updating and prediction modulation[J].Information Sciences,2010,180(5):602-612
[15] Bogdanova G,Georgieva T.Using error-correcting dependencies for collaborative filtering[J].Data & Knowledge Engineering,2008,66(3):402-413
[16] Resnick P,Iacovou N,Suchak M,et al.Grouplens:an open architecture for collaborative filtering of netnews[C]∥Procee-dings of the 1994 ACM on Computer Supported Cooperative Work.1994:175-186
[17] Sarwar B,Karypis G,Konstan J,et al.Recommender systems for large-scale e-commerce:scalable neighborhood formation using clustering[C] ∥Proceedings of the 5th International Conference on Computer and Information Technology.2002
[18] Herlocker J,Konstan J A,Borchers A,et al.An algorithmicframework for performing collaborative filtering[C]∥Procee-dings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieve.1999:230-237

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!