Abstract

Recently, various cross-domain recommendation (CDR) models are proposed to overcome the sparsity problem, which leverage relatively abundant rating data from the auxiliary domain to improve recommendation performance of target domain. Though matrix factorization-based collaborative filtering algorithms gain dominance in single-domain recommendation systems, they cannot be used directly in cross-domain cases as the obtained latent factors of the target and auxiliary domains may not be aligned, which will lead to inaccurate knowledge transfer from the auxiliary domain to the target one. A CDR model named CDCFLFA is presented in this paper to solve this problem. In CDCFLFA, firstly latent factors between the two domains are aligned based on pattern matching. Then, user preferences of the auxiliary domain are transferred to update the original user latent vectors of target domain. Finally, a linear least square problem is solved to compute the item latent vectors of target domain and thus unknown ratings are obtained according to the updated user and item latent vectors. CDCFLFA does not require the same user or item sets between the two domains. Extensive experiments are conducted, and the results show that CDCFLFA achieves smaller MAE and RMSE values and larger precision and recall than the previous single- and cross-domain recommendation methods. Hence, CDCFLFA can be regarded as an effective cross-domain extension of single-domain matrix factorization algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.