Improving the accuracy of m-distance based nearest neighbor recommendation system by using ratings variance

被引：3

作者：

Hasanzadeh N. ^{[1
]}

Forghani Y. ^{[1
]}

机构：

[1] Islamic Azad University, Mashhad Branch, Mashhad

来源：

Ingenierie des Systemes d'Information | 2019年 / 24卷 / 02期

关键词：

Collaborative filtering; M-distance; MBR; Nearestneighbor; Recommendation system;

D O I：

10.18280/isi.240201

中图分类号：

学科分类号：

摘要：

M-distance based recommendation system (MBR) is a nearest neighbor basedrecommendation method which uses the average of ratings given to an item as the attribute ofthat item. This attribute is used to determine similar items. Then, the average of the ratinggiven to the similar items to an item of the active user determines the rating of that item. Inthis paper, to decrease the error of MBR, by combining the following ideas, eight MBR-basedrecommendation systems are proposed: (a) Using the variance of item ratings in addition tothe average of item ratings, as two attributes of an item, for determining similar items in anitem-based nearest neighbor method; (b) Using the variance of user ratings in addition to theaverage of user ratings, as two attributes of a user, for determining similar users in a user-basednearest neighbor method; (c) Using a weighted average method for combining the ratings ofsimilar items or similar users; (d) Using ensemble learning. Experimental results on realdatasets show that our proposed EVMBR and EWVMBR which use ensemble learning havethe least error. The error of the suggested EWVMBR is at-least 20% lower than that of MBR,Slope-One, P-kNN, and C-kNN. © 2019 International Information and Engineering Technology Association. All rights reserved.

引用

页码：131 / 137

页数：6

共 18 条

[1]

Sarwar B., Karypis G., Konstan J., Riedl J., Item-based collaborative filtering recommendation algorithms, Proceedings of the 10th International Conference on World Wide Web, pp. 285-295, (2001)

[2]

Ahn H.J., A new similarity measure for collaborative filtering to alleviate the new user cold-starting problem, Information Sciences, 178, 1, pp. 37-51, (2008)

[3]

Park Y., Park S., Jung W., Lee S.G., Reversed CF: A fast collaborative filtering algorithm using a k-nearest neighbor graph, Expert Systems with Applications, 42, 8, pp. 4022-4028, (2015)

[4]

Zheng M., Min F., Zhang H.R., Chen W.B., Fast recommendations with the m-distance, IEEE Access, 4, 1, pp. 1464-1468, (2016)

[5]

Lemire D., Maclachlan A., Slope one predictors for online rating-based collaborative filtering, Proceedings of the 2005 SIAM International Conference on Data Mining, pp. 471-475, (2005)

[6]

Li J., Sun L., Wang J., A slope one collaborative filtering recommendation algorithm using uncertain neighbors optimizing, International Conference on Web-Age Information Management, pp. 160-166, (2011)

[7]

Wang Q.X., Luo X., Li Y., Shi X.Y., Gu L., Shang M.S., Incremental slope-one recommenders, Neurocomputing, 272, 1, pp. 606-618, (2018)

[8]

Bu J., Shen X., Xu B., Chen C., He X., Cai D., Improving collaborative recommendation via user-item subgroups, IEEE Transactions on Knowledge and Data Engineering, 28, 9, pp. 2363-2375, (2016)

[9]

Salter J., Antonopoulos N., CinemaScreen recommender agent: Combining collaborative and content-based filtering, IEEE Intelligent Systems, 21, 1, pp. 35-41, (2006)

[10]

Van Meteren R., Van Someren M., Using content-based filtering for recommendation. Proceedings of the Machine Learning in the New, Information Age MLnet/ECML2000 Workshop, pp. 47-56, (2000)

← 1 2 →