TY - JOUR
T1 - A relaxed ranking-based factor model for recommender system from implicit feedback
AU - Li, Huayu
AU - Hong, Richang
AU - Lian, Defu
AU - Wu, Zhiang
AU - Wang, Meng
AU - Ge, Yong
N1 - Funding Information:
This work is partially supported by the National 973 Program of China under grant 2014CB347600, NIH (1R21AA023975- 01), NSFC (71571093, 71372188, 61572032), National Center for International Joint Research on E-Business Information Processing (2013B01035), and National Key Technologies RandD Program of China (2013BAH16F03)
PY - 2016
Y1 - 2016
N2 - Implicit feedback based recommendation has recently been an important task with the accumulated user-item interaction data. However, it is very challenging to produce recommendations from implicit feedback due to the sparseness of data and the lack of negative feedback/rating. Although various factor models have been proposed to tackle this problem, they either focus on rating prediction that may lead to inaccurate top-k recommendations or are dependent on the sampling of negative feedback that often results in bias. To this end, we propose a Relaxed Ranking-based Factor Model, RRFM, to relax pairwise ranking into a SVM-like task, where positive and negative feedbacks are separated by the soft boundaries, and their non-separate property is employed to capture the characteristic of unobserved data. A smooth and scalable algorithm is developed to solve group- and instance- level's optimization and parameter estimation. Extensive experiments based on real-world datasets demonstrate the effectiveness and advantage of our approach.
AB - Implicit feedback based recommendation has recently been an important task with the accumulated user-item interaction data. However, it is very challenging to produce recommendations from implicit feedback due to the sparseness of data and the lack of negative feedback/rating. Although various factor models have been proposed to tackle this problem, they either focus on rating prediction that may lead to inaccurate top-k recommendations or are dependent on the sampling of negative feedback that often results in bias. To this end, we propose a Relaxed Ranking-based Factor Model, RRFM, to relax pairwise ranking into a SVM-like task, where positive and negative feedbacks are separated by the soft boundaries, and their non-separate property is employed to capture the characteristic of unobserved data. A smooth and scalable algorithm is developed to solve group- and instance- level's optimization and parameter estimation. Extensive experiments based on real-world datasets demonstrate the effectiveness and advantage of our approach.
UR - http://www.scopus.com/inward/record.url?scp=85006120534&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85006120534&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:85006120534
SN - 1045-0823
VL - 2016-January
SP - 1683
EP - 1689
JO - IJCAI International Joint Conference on Artificial Intelligence
JF - IJCAI International Joint Conference on Artificial Intelligence
T2 - 25th International Joint Conference on Artificial Intelligence, IJCAI 2016
Y2 - 9 July 2016 through 15 July 2016
ER -