We have developed a framework for jointly conducting collaborative filtering and distance metric learning based on regularized singular value decomposition (RSVD), which discovers the user matrix and item matrix in the low rank space. Our approach is able to solve RSVD and simultaneously learn the parameters of Mahalanobis distance considering the ratings given by similar users and dissimilar users. One characteristic of our approach is that the learned model can be effectively applied to rating prediction and other relevant applications such as trust prediction, resulting in a solution which is coherent and optimal to both tasks. Another characteristic is that social community information and similarity information can be easily considered in our framework. We have conducted extensive experiments on rating prediction using real-world datasets to evaluate our framework. We have also compared our framework with other existing works to illustrate the effectiveness. Experimental results show that our framework achieves a promising prediction performance and outperforms the existing works.
|Title of host publication||Information Retrieval Technology : 12th Asia Information Retrieval Societies Conference, AIRS 2016, Beijing, China, November 30–December 2, 2016, proceedings|
|Editors||Shaoping MA, Ji-Rong WEN, Yiqun LIU, Zhicheng DOU, Min ZHANG, Yi CHANG, Xin ZHAO|
|Publisher||Springer International Publishing AG|
|Number of pages||13|
|Publication status||Published - 2016|
|Event||12th Asia Information Retrieval Societies Conference - Tsinghua University, Beijing, China|
Duration: 30 Nov 2016 → 2 Dec 2016
|Name||Lecture Notes in Computer Science|
|Conference||12th Asia Information Retrieval Societies Conference|
|Abbreviated title||AIRS 2016|
|Period||30/11/16 → 2/12/16|
The work described in this paper is substantially supported by grants from the Education University of Hong Kong (Project Codes: RG 30/2014-2015R and RG 18/2015-2016R).
- Collaborative filtering
- Metric learning
- Mahalanobis distance