TY - GEN
T1 - Collaborative filtering based on rating psychology
AU - Zhang, Haijun
AU - Liu, Chunyang
AU - Li, Zhoujun
AU - Zhang, Xiaoming
PY - 2013
Y1 - 2013
N2 - Nowadays, products are increasingly abundant and diverse, which makes user more fastidious. In fact, user has demands on a product in many aspects. A user is satisfied with a product usually because he or she likes all aspects of the product. Even only few of his or her demands or interests did not be satisfied, the user will have a bad opinion on the product. Usually, user's rating value for an item can be divided into two parts. One is influenced by his or her rating bias and other user's rating for the item. The other is determined by his or her real opinion on the item. The process of rating an item can be considered as an expression of user's psychological behavior. Based on this rating psychology, a novel collaborative filtering algorithm is proposed. In this algorithm, if one latent demand of the user is not satisfied by the item, the corresponding rating value will be multiplied by a penalty value which is less than 1. The parameters in the model are estimated using stochastic gradient descent method. Experiment results show that this algorithm has better performance than state-of-the-art algorithms.
AB - Nowadays, products are increasingly abundant and diverse, which makes user more fastidious. In fact, user has demands on a product in many aspects. A user is satisfied with a product usually because he or she likes all aspects of the product. Even only few of his or her demands or interests did not be satisfied, the user will have a bad opinion on the product. Usually, user's rating value for an item can be divided into two parts. One is influenced by his or her rating bias and other user's rating for the item. The other is determined by his or her real opinion on the item. The process of rating an item can be considered as an expression of user's psychological behavior. Based on this rating psychology, a novel collaborative filtering algorithm is proposed. In this algorithm, if one latent demand of the user is not satisfied by the item, the corresponding rating value will be multiplied by a penalty value which is less than 1. The parameters in the model are estimated using stochastic gradient descent method. Experiment results show that this algorithm has better performance than state-of-the-art algorithms.
KW - Collaborative Filtering
KW - Latent Demands
KW - Rating Psychology
KW - Stochastic Gradient Descent
UR - https://www.scopus.com/pages/publications/84880020074
U2 - 10.1007/978-3-642-38562-9_67
DO - 10.1007/978-3-642-38562-9_67
M3 - 会议稿件
AN - SCOPUS:84880020074
SN - 9783642385612
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 655
EP - 665
BT - Web-Age Information Management - 14th International Conference, WAIM 2013, Proceedings
PB - Springer Verlag
T2 - 14th International Conference on Web-Age Information Management, WAIM 2013
Y2 - 14 June 2013 through 16 June 2013
ER -