Semi-supervised Collaborative Filtering by Text-enhanced Domain Adaptation
Not on the map. Why?
Abstract (arXiv)
Data sparsity is an inherent challenge in the recommender systems, where most of the data is collected from the implicit feedbacks of users. This causes two difficulties in designing effective algorithms: first, the majority of users only have a few interactions with the system and there is no enough data for learning; second, there are no negative samples in the implicit feedbacks and it is a common practice to perform negative sampling to generate negative samples. However, this leads to a consequence that many potential positive samples are mislabeled as negative ones and data sparsity would exacerbate the mislabeling problem. To solve these difficulties, we regard the problem of recommendation on sparse implicit feedbacks as a semi-supervised learning task, and explore domain adaption to solve it. We transfer the knowledge learned from dense data to sparse data and we focus on the most challenging case -- there is no user or item overlap. In this extreme case, aligning embeddings of two datasets directly is rather sub-optimal since the two latent spaces encode very different information. As such, we adopt domain-invariant textual features as the anchor points to align the latent spaces. To align the embeddings, we extract the textual features for each user and item and feed them into a domain classifier with the embeddings of users and items. The embeddings are trained to puzzle the classifier and textual features are fixed as anchor points. By domain adaptation, the distribution pattern in the source domain is transferred to the target domain. As the target part can be supervised by domain adaptation, we abandon negative sampling in target dataset to avoid label noise. We adopt three pairs of real-world datasets to validate the effectiveness of our transfer strategy. Results show that our models outperform existing models significantly.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Jun 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 1; 2024: 2; 2025: 3.
10 papers.
- 2022Collaborative Filtering with Attribution Alignment for Review-based Non-overlapped Cross Domain Recommendationcited by 14
- 2024ShapeFormer: Shapelet Transformer for Multivariate Time Series Classificationcited by 14
- 2022Diverse Preference Augmentation with Multiple Domains for Cold-start Recommendationscited by 6
- 2024A Privacy-Preserving Framework with Multi-Modal Data for Cross-Domain Recommendationcited by 5
- 2025Exploring Preference-Guided Diffusion Model for Cross-Domain Recommendationcited by 4
- 2022Few-shot News Recommendation via Cross-lingual Transfercited by 3
- 2021Review-Based Domain Disentanglement without Duplicate Users or Contexts for Cross-Domain Recommendationcited by 2
- 2023Data augmentation and refinement for recommender system: A semi-supervised approach using maximum margin matrix factorizationcited by 0
- 2025FedGRec: Dynamic Spatio-Temporal Federated Graph Learning for Secure and Efficient Cross-Border Recommendationscited by 0
- 2025Modeling User Preferences as Distributions for Optimal Transport-Based Cross-Domain Recommendation under Non-Overlapping Settingscited by 0
- 2025Modeling User Preferences as Distributions for Optimal Transport-Based Cross-Domain Recommendation under Non-Overlapping Settings22 Aug 2025
- 2025FedGRec: Dynamic Spatio-Temporal Federated Graph Learning for Secure and Efficient Cross-Border Recommendations15 May 2025
- 2025Exploring Preference-Guided Diffusion Model for Cross-Domain Recommendation20 Jan 2025
- 2024ShapeFormer: Shapelet Transformer for Multivariate Time Series Classification23 May 2024
- 2024A Privacy-Preserving Framework with Multi-Modal Data for Cross-Domain Recommendation6 Mar 2024
- 2023Data augmentation and refinement for recommender system: A semi-supervised approach using maximum margin matrix factorization22 Jun 2023
- 2022Few-shot News Recommendation via Cross-lingual Transfer28 Jul 2022
- 2022Diverse Preference Augmentation with Multiple Domains for Cold-start Recommendations1 Apr 2022
- 2022Collaborative Filtering with Attribution Alignment for Review-based Non-overlapped Cross Domain Recommendation10 Feb 2022
- 2021Review-Based Domain Disentanglement without Duplicate Users or Contexts for Cross-Domain Recommendation25 Oct 2021