Discovering Both Explicit and Implicit Similarities for Cross-Domain Recommendation
暂无分享,去创建一个
[1] Dennis M. Wilkinson,et al. Large-Scale Parallel Collaborative Filtering for the Netflix Prize , 2008, AAIM.
[2] Hao Luo,et al. Cross-Domain Recommendation via Cluster-Level Latent Factor Model , 2013, ECML/PKDD.
[3] Qiang Yang,et al. Can Movies and Books Collaborate? Cross-Domain Collaborative Filtering for Sparsity Reduction , 2009, IJCAI.
[4] Fei Wang,et al. Ieee Transactions on Knowledge and Data Engineering, Manuscropt Id 1 Social Recommendation with Cross-domain Transferable Knowledge , 2022 .
[5] Chris H. Q. Ding,et al. Orthogonal nonnegative matrix t-factorizations for clustering , 2006, KDD '06.
[6] Geoffrey J. Gordon,et al. Relational learning via collective matrix factorization , 2008, KDD.
[7] Tamara G. Kolda,et al. Tensor Decompositions and Applications , 2009, SIAM Rev..
[8] Wei Chen,et al. Making recommendations from multiple domains , 2013, KDD.
[9] Shou-De Lin,et al. Matching users and items across domains to improve the recommendation quality , 2014, KDD.
[10] Tamara G. Kolda,et al. All-at-once Optimization for Coupled Matrix and Tensor Factorizations , 2011, ArXiv.
[11] Pasquale Lops,et al. Content-based Recommender Systems: State of the Art and Trends , 2011, Recommender Systems Handbook.
[12] Yehuda Koren,et al. Advances in Collaborative Filtering , 2011, Recommender Systems Handbook.
[13] Qiang Yang,et al. Transfer Learning in Collaborative Filtering for Sparsity Reduction , 2010, AAAI.