title: A network centrality method for the rating problem.
abstract: We propose a new method for aggregating the information of multiple users rating multiple items. Our approach is based on the network relations induced between items by the rating activity of the users. Our method correlates better than the simple average with respect to the original rankings of the users, and besides, it is computationally more efficient than other methods proposed in the literature. Moreover, our method is able to discount the information that would be obtained adding to the system additional users with a systematically biased rating activity.
authors.affiliation: School of Business Administration, Northeastern University, Shenyang 110819, P.R.China.
authors.forename: Yongli
authors.initials: Y
authors.lastname: Li
authors.affiliation: Dipartimento di Economia Politica e Statistica, Università degli Studi di Siena, 53100 Siena, Italy.
authors.forename: Paolo
authors.initials: P
authors.lastname: Pin
authors.affiliation: School of Management, Harbin Institute of Technology, Harbin 150001, P.R.China.
authors.forename: Chong
authors.initials: C
authors.lastname: Wu
mesh_terms: D000465:Algorithms; D003258:Consumer Behavior; D008962:Models, Theoretical
references.citation: Phys Rev E Stat Nonlin Soft Matter Phys. 2004 Nov;70(5 Pt 2):056131
references.pmid: 15600716