Computer Science ›› 2016, Vol. 43 ›› Issue (12): 158-162.doi: 10.11896/j.issn.1002-137X.2016.12.028

Previous Articles     Next Articles

Item-based Collaborative Filtering Algorithm Integrating User Activity and Item Popularity

WANG Jin-kun, JIANG Yuan-chun, SUN Jian-shan and SUN Chun-hua   

  • Online:2018-12-01 Published:2018-12-01

Abstract: Item correlation computation is the most critical component in item- based collaborative filtering algorithm.The traditional correlation computation scheme can be challenged by the sparse data set and the situation of recommending unpopular products.In this paper,a novel item- based collaborative filtering algorithm that incorporates the activity of users and popularity of items was proposed.The proposed computation scheme decreases the correlation between items using the activity of users and popularity of items in those rating records where only one item is rated.In this way,the unpopular products can be recommended to users in the sparse data.Experimental evaluation shows that the diversity and novelty of the recommendation list can be improved while maintaining the prediction accuracy.

Key words: Personalized recommendation,Correlation computation,Collaborative filtering,Activity of users,Popularity of items

[1] Linden G,Smith B,York recommendations:Item-to-item collaborative filtering [J].IEEE Internet Computing,2003,7(1):76-80
[2] 项亮.推荐系统实践[M].人民邮电出版社,2012
[3] 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.ACM,2001:285-295
[4] Ekstrand M D,Ludwig M,Konstan J A,et al.Rethinking therecommender research ecosystem:reproducibility,openness,and LensKit[C]∥Proceedings of the Fifth ACM Conference on Re-commender Systems.ACM,2011:133-140
[5] Resnick P,Iacovou N,Suchak M,et al.GroupLens:an open architecture for collaborative filtering of netnews[C]∥Procee-dings of the 1994 ACM Conference on Computer Supported Cooperative Work.ACM,1994:175-186
[6] Zhang Yin,Zhang Bin,Gao Ke-ning,et al.Autonomy OrientedPersonalized Tag Recommendation[J].Acta Electronica Sinica,2012,40(12):2353-2359(in Chinese) 张引,张斌,高克宁,等.面向自主意识的标签个性化推荐方法研究[J].电子学报,2012,40(12):2353-2359
[7] Koren Y,Bell R,Volinsky C.Matrix factorization techniques for recommender systems[J].Computer,2009 (8):30-37
[8] Breese J S,Heckerman D,Kadie C.Empirical analysis of predictive algorithms for collaborative filtering[C]∥Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence.Morgan Kaufmann Publishers Inc.,1998:43-52
[9] McLaughlin M R,Herlocker J L.A collaborative filtering algorithm and evaluation metric that accurately model the user experience[C]∥Proceedings of the 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval.ACM,2004:329-336
[10] Ahn H J.A new similarity measure for collaborative filtering to alleviate the new user cold-starting problem[J].Information Scien-ces,2008,178(1):37-51
[11] Marlin B M,Zemel R S.Collaborative prediction and rankingwith non-random missing data[C]∥Proceedings of the third ACM Conference on Recommender Systems.ACM,2009:5-12
[12] Little R J A,Rubin D B.Statistical analysis with missing data[M].John Wiley & Sons,2014
[13] Jrvelin K,Keklinen J.Cumulated gain-based evaluation of IR techniques[J].ACM Transactions on Information Systems (TOIS),2002,20(4):422-446
[14] Zhou T,Kuscsik Z,Liu J G,et al.Solving the apparent diversity-accuracy dilemma of recommender systems[J].Proceedings of the National Academy of Sciences,2010,107(10):4511-4515
[15] Vargas S,Castells P.Rank and relevance in novelty and diversity metrics for recommender systems[C]∥Proceedings of the fifth ACM Conference on Recommender Systems.ACM,2011:109-116

No related articles found!
Full text



[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75, 88 .
[2] XIA Qing-xun and ZHUANG Yi. Remote Attestation Mechanism Based on Locality Principle[J]. Computer Science, 2018, 45(4): 148 -151, 162 .
[3] LI Bai-shen, LI Ling-zhi, SUN Yong and ZHU Yan-qin. Intranet Defense Algorithm Based on Pseudo Boosting Decision Tree[J]. Computer Science, 2018, 45(4): 157 -162 .
[4] WANG Huan, ZHANG Yun-feng and ZHANG Yan. Rapid Decision Method for Repairing Sequence Based on CFDs[J]. Computer Science, 2018, 45(3): 311 -316 .
[5] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[6] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[7] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[8] LIU Qin. Study on Data Quality Based on Constraint in Computer Forensics[J]. Computer Science, 2018, 45(4): 169 -172 .
[9] ZHONG Fei and YANG Bin. License Plate Detection Based on Principal Component Analysis Network[J]. Computer Science, 2018, 45(3): 268 -273 .
[10] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99, 116 .