4.7 Article

A cross-domain collaborative filtering algorithm with expanding user and item features via the latent factor space of auxiliary domains

期刊

PATTERN RECOGNITION
卷 94, 期 -, 页码 96-109

出版社

ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2019.05.030

关键词

Cross-domain collaborative filtering; Feature expansion; Funk-SVD decomposition; Classification; Latent factor space

资金

  1. National Natural Science Foundation of China [61402246, 61273180, 61375067, 61773384, 61602133]
  2. Natural Science Foundation of Shandong Province [ZR2019MF014, ZR2018MF007]
  3. key research and development program of Shandong Province [2018GGX101052]

向作者/读者索取更多资源

Cross-domain collaborative filtering, which transfers rating knowledge across multiple domains, has become a new way to effectively alleviate the sparsity problem in recommender systems. Different auxiliary domains are generally different in the importance to the target domain, which is hard to evaluate using previous approaches. Besides, most recommender systems only take advantage of information from user-or item-side auxiliary domains. To overcome these drawbacks, we propose a cross-domain collaborative filtering algorithm with expanding user and item features via the latent factor space of auxiliary domains in this paper. In the proposed algorithm, the recommendation problem is first formulated as a classification problem in the target domain, which takes user and item location as the feature vector, their rating as the label. Then, Funk-SVD decomposition is employed to extract extra user and item features from user- and item-side auxiliary domains, respectively, with the purpose of expanding the two-dimensional location feature vector. Finally, a classifier is trained using the C4.5 decision tree algorithm for predicting missing ratings. The proposed algorithm can make full use of user- and item-side information. We conduct extensive experiments and compare the proposed algorithm with various state-of-the-art single-and cross-domain collaborative filtering algorithms. The experimental results show that the proposed algorithm has advantages in terms of four different evaluation metrics. (C) 2019 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据