mlsanityData to 7 Oct 2026

Collaborative Filtering with Attribution Alignment for Review-based Non-overlapped Cross Domain Recommendation

arXiv 2202.04920 ↗First posted 10 Feb 2022cs.IR cs.AIcited by 14

Not on the map. Why?

Abstract (arXiv)

Cross-Domain Recommendation (CDR) has been popularly studied to utilize different domain knowledge to solve the data sparsity and cold-start problem in recommender systems. In this paper, we focus on the Review-based Non-overlapped Recommendation (RNCDR) problem. The problem is commonly-existed and challenging due to two main aspects, i.e, there are only positive user-item ratings on the target domain and there is no overlapped user across different domains. Most previous CDR approaches cannot solve the RNCDR problem well, since (1) they cannot effectively combine review with other information (e.g., ID or ratings) to obtain expressive user or item embedding, (2) they cannot reduce the domain discrepancy on users and items. To fill this gap, we propose Collaborative Filtering with Attribution Alignment model (CFAA), a cross-domain recommendation framework for the RNCDR problem. CFAA includes two main modules, i.e., rating prediction module and embedding attribution alignment module. The former aims to jointly mine review, one-hot ID, and multi-hot historical ratings to generate expressive user and item embeddings. The later includes vertical attribution alignment and horizontal attribution alignment, tending to reduce the discrepancy based on multiple perspectives. Our empirical study on Douban and Amazon datasets demonstrates that CFAA significantly outperforms the state-of-the-art models under the RNCDR setting.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 24 of its 54 references that are in the map. First posted on arXiv 10 Feb 2022.

Builds on

24 of 54 references.

References · 24

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  3. 2015Domain-Adversarial Training of Neural Networkscited by 3,023
  4. 2016Deep CORAL: Correlation Alignment for Deep Domain Adaptationcited by 1,194
  5. 2018A Survey on Deep Transfer Learningcited by 417
  6. 2019KGAT: Knowledge Graph Attention Network for Recommendationcited by 342
  7. 2018Characterizing and Avoiding Negative Transfercited by 226
  8. 2018A DIRT-T Approach to Unsupervised Domain Adaptationcited by 215
  9. 2018DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptationcited by 212
  10. 2019Embarrassingly Shallow Autoencoders for Sparse Datacited by 93
  11. 2017Joint Deep Modeling of Users and Items Using Reviews for Recommendationcited by 84
  12. 2018CoNet: Collaborative Cross Networks for Cross-Domain Recommendationcited by 81
12 more
  1. 2021Cross-Domain Recommendation: Challenges, Progress, and Prospectscited by 74
  2. 2019GOT: An Optimal Transport framework for Graph comparisoncited by 64
  3. 2019Leveraging BERT for Extractive Text Summarization on Lecturescited by 63
  4. 2018Joint Domain Alignment and Discriminative Feature Learning for Unsupervised Deep Domain Adaptationcited by 45
  5. 2020CATN: Cross-Domain Recommendation for Cold-Start Users via Aspect Transfer Networkcited by 42
  6. 2019DARec: Deep Domain Adaptation for Cross-Domain Recommendation via Transferring Rating Patternscited by 33
  7. 2020ESAM: Discriminative Domain Adaptation with Non-Displayed Items to Improve Long-Tail Performancecited by 30
  8. 2021A Unified Framework for Cross-Domain and Cross-System Recommendationscited by 19
  9. 2019RecSys-DAN: Discriminative Adversarial Networks for Cross-Domain Recommender Systemscited by 13
  10. 2021Dual Metric Learning for Effective and Efficient Cross-Domain Recommendationscited by 12
  11. 2020Semi-supervised Collaborative Filtering by Text-enhanced Domain Adaptationcited by 10
  12. 2021Multi-Facet Recommender Networks with Spherical Optimizationcited by 3

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 6; 2024: 4; 2025: 2.

14 papers.

Sort:

By area: