会议专题

A Personalized Recommendation Algorithm Based on Comprehensive Interest

personalized recommender systems have been widely used in E-commerce to help customers find interesting products more conveniently. However, with the development of E-commerce, the magnitudes of users and commodities grow rapidly. Traditional recommendation algorithms face severe challenge of sparse user rating and real-time recommendation. To address these issues, the users behavior sequence and the merchandise category structure are analyzed deeply and a personalized recommendation algorithm based on comprehensive interest is proposed. According to the behaviors information of browsing, purchasing and rating in an actual E-commerce process, the user-item rating matrix has been changed to user-item comprehensive interest matrix. It can not only reflect the real interest of users, but also alleviate the sparse of the rating matrix to large extent. Furthermore, a user has different interest on different category. The searching of nearest neighbors and the predicting of interest for a certain item should be within the same category. Therefore, the searching space can be reduced and the accuracy can be improved. Simulation results on three data sets of a real E-commerce system illustrate the efficiency of this algorithm.

component personalized recommendation collaborative filtering E-commerce comprehensive interest behavior sequence item category

Weibin Deng

Key Lab of Electronic Commerce and Modern Logistics, Chongqing University of Posts and Telecommunications,Chongqing, 400065, China School of Information Science & Technology, Southwest Jiaotong University, Chengdu, 610031, China

国际会议

2011 3rd International Conference on Computer and Automation Engineering(ICCAE 2011)(2011年第三届IEEE计算机与自动化工程国际会议)

重庆

英文

21-25

2011-01-21(万方平台首次上网日期,不代表论文的发表时间)