Scalable and interpretable product recommendations via overlapping co-clustering
Not on the map. Why?
Abstract (arXiv)
We consider the problem of generating interpretable recommendations by identifying overlapping co-clusters of clients and products, based only on positive or implicit feedback. Our approach is applicable on very large datasets because it exhibits almost linear complexity in the input examples and the number of co-clusters. We show, both on real industrial data and on publicly available datasets, that the recommendation accuracy of our algorithm is competitive to that of state-of-art matrix factorization techniques. In addition, our technique has the advantage of offering recommendations that are textually and visually interpretable. Finally, we examine how to implement our technique efficiently on Graphical Processing Units (GPUs).
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 7 Apr 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 1.
4 papers.
- 2023Efficient High-Quality Clustering for Large Bipartite Graphscited by 11
- 2024LANE: Logic Alignment of Non-tuning Large Language Models and Online Recommendation Systems for Explainable Reason Generationcited by 6
- 2022Fine-tuning Partition-aware Item Similarities for Efficient and Scalable Recommendationcited by 3
- 2022Counterfactually Evaluating Explanations in Recommender Systemscited by 2
- 2024LANE: Logic Alignment of Non-tuning Large Language Models and Online Recommendation Systems for Explainable Reason Generation3 Jul 2024
- 2023Efficient High-Quality Clustering for Large Bipartite Graphs28 Dec 2023
- 2022Fine-tuning Partition-aware Item Similarities for Efficient and Scalable Recommendation13 Jul 2022
- 2022Counterfactually Evaluating Explanations in Recommender Systems2 Mar 2022