.png){kind=icon}
.png){kind=icon}
Return
A User-Based Cross Domain Collaborative Filtering Algorithm Based on a Linear Decomposition Model
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2017.2774442.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Sparsity is a tough problem in a single domain collaborative filtering (CF) recommendation system as it is difficult to compute the similarities among users accurately. Recently, cross domain CF is a new way to alleviate this difficulty. In this paper, we propose a user-based cross domain CF algorithm based on a linear decomposition model. We pour the items together and learn a linear decomposition model to explore the relationship between the total similarity and the local similarities of different domains. We first construct training samples by computing the similarities of any two users in different domains. Then, we solve a linear least square problem to obtain the decomposition coefficients. Finally, we compute the local similarity in the target domain using the decomposition model. Since we compute the similarity in the target domain with the help of rich ratings in other domains, this similarity would be expected to be more accurate than the measured similarity computed by the sparse ratings in the target domain. We conduct extensive experiments to show that the proposed algorithm is effective in addressing the data sparsity problem, as compared with many state-of-the-art CF methods.
Keywords:
Cross domain collaborative filtering
linear least square problem
similarity computing
user-based model
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
No organization information available