用动态多视角聚类提升推荐系统的效率与可解释性
Matrix Factorization with Dynamic Multi-view Clustering for Recommender System
- 将聚类与矩阵分解融合为端到端框架,实现高效训练
- 通过自适应剪枝优化表示空间,提升大规模场景性能
- 适合需要高可解释性和大规模部署的推荐系统
矩阵分解(MF)是推荐系统的核心技术,将用户-物品交互矩阵分解为潜在表示。然而,传统MF采用两阶段、非端到端范式,先推荐后聚类,导致在电商和物联网等超大规模场景(数十亿用户与数万亿物品交互)下计算成本过高。为此,我们提出矩阵分解与动态多视角聚类统一框架(MFDMC),在保证端到端高效训练的同时,充分利用网络规模数据,增强可解释性。MFDMC利用动态多视角聚类学习用户与物品表示,自适应剪枝低质量聚类。每个实体的表示被建模为稳健聚类的加权投影,捕捉其在不同视角下的多样化角色。该设计最大化表示空间利用率,提升可解释性,并确保下游任务的鲁棒性。大量实验表明,MFDMC在推荐系统及其他表示学习领域(如计算机视觉)中均表现优异,展现出卓越的可扩展性与通用性。
原文摘要 · Abstract (English)
Matrix factorization (MF), a cornerstone of recommender systems, decomposes user-item interaction matrices into latent representations. Traditional MF approaches, however, employ a two-stage, non-end-to-end paradigm, sequentially performing recommendation and clustering, resulting in prohibitive computational costs for large-scale applications like e-commerce and IoT, where billions of users interact with trillions of items. To address this, we propose Matrix Factorization with Dynamic Multi-view Clustering (MFDMC), a unified framework that balances efficient end-to-end training with comprehensive utilization of web-scale data and enhances interpretability. MFDMC leverages dynamic multi-view clustering to learn user and item representations, adaptively pruning poorly formed clusters. Each entity's representation is modeled as a weighted projection of robust clusters, capturing its diverse roles across views. This design maximizes representation space utilization, improves interpretability, and ensures resilience for downstream tasks. Extensive experiments demonstrate MFDMC's superior performance in recommender systems and other representation learning domains, such as computer vision, highlighting its scalability and versatility.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。