Collaborative rating allocation

2Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper studies the collaborative rating allocation problem, in which each user has limited ratings on all items. These users are termed "energy limited". Different from existing methods which treat each rating independently, we investigate the geometric properties of a user's rating vector, and design a matrix completion method on the simplex. In this method, a user's rating vector is estimated by the combination of user profiles as basis points on the simplex. Instead of using Euclidean metric, a non-linear pull-back distance measurement from the sphere is adopted since it can depict the geometric constraints on each user's rating vector. The resulting objective function is then efficiently optimized by a Riemannian conjugate gradient method on the simplex. Experiments on real-world data sets demonstrate our model's competitiveness versus other collaborative rating prediction methods.

Cite

CITATION STYLE

APA

Du, Y., Xu, C., & Tao, D. (2017). Collaborative rating allocation. In IJCAI International Joint Conference on Artificial Intelligence (Vol. 0, pp. 1617–1623). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2017/224

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free