Matrix Factorization with Dynamic Multi-view Clustering for Recommender System

• URL: http://arxiv.org/abs/2504.14565v1
• Date: Sun, 20 Apr 2025 10:47:21 GMT
• Title: Matrix Factorization with Dynamic Multi-view Clustering for Recommender System
• Authors: Shangde Gao, Ke Liu, Yichao Fu, Hongxia Xu, Jian Wu,
• Abstract summary: Matrix factorization (MF) is a cornerstone of recommender systems.<n>MFDMC is a unified framework that balances efficient end-to-end training with comprehensive utilization of web-scale data.
• Score: 5.807887214293438
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Robust Multi-View Learning via Representation Fusion of Sample-Level Attention and Alignment of Simulated Perturbation [61.64052577026623]
  Real-world multi-view datasets are often heterogeneous and imperfect.<n>We propose a novel robust MVL method (namely RML) with simultaneous representation fusion and alignment.<n>In experiments, we employ it in unsupervised multi-view clustering, noise-label classification, and as a plug-and-play module for cross-modal hashing retrieval.
  arXiv  Detail & Related papers  (2025-03-06T07:01:08Z)
• Balanced Multi-view Clustering [56.17836963920012]
  Multi-view clustering (MvC) aims to integrate information from different views to enhance the capability of the model in capturing the underlying data structures.<n>The widely used joint training paradigm in MvC is potentially not fully leverage the multi-view information.<n>We propose a novel balanced multi-view clustering (BMvC) method, which introduces a view-specific contrastive regularization (VCR) to modulate the optimization of each view.
  arXiv  Detail & Related papers  (2025-01-05T14:42:47Z)
• An Adaptive Framework for Multi-View Clustering Leveraging Conditional Entropy Optimization [0.0]
  Multi-view clustering (MVC) has emerged as a powerful technique for extracting valuable insights from data.<n>Existing MVC methods struggle with effectively quantifying the consistency and complementarity among views.<n>We propose CE-MVC, a novel framework that integrates an adaptive weighting algorithm with a parameter-decoupled deep model.
  arXiv  Detail & Related papers  (2024-12-23T15:21:55Z)
• CADMR: Cross-Attention and Disentangled Learning for Multimodal Recommender Systems [0.6037276428689637]
  We propose CADMR, a novel autoencoder-based multimodal recommender system framework.<n>We evaluate CADMR on three benchmark datasets, demonstrating significant performance improvements over state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-12-03T09:09:52Z)
• Partial Multi-View Clustering via Meta-Learning and Contrastive Feature Alignment [13.511433241138702]
  Partial multi-view clustering (PVC) presents significant challenges practical research problem for data analysis in real-world applications. Existing clustering methods struggle to handle incomplete views effectively, leading to suboptimal clustering performance. We propose a novel dual optimization framework based on contrastive learning, which aims to maximize the consistency of latent features in incomplete multi-view data.
  arXiv  Detail & Related papers  (2024-11-14T19:16:01Z)
• Neural Clustering based Visual Representation Learning [61.72646814537163]
  Clustering is one of the most classic approaches in machine learning and data analysis. We propose feature extraction with clustering (FEC), which views feature extraction as a process of selecting representatives from data. FEC alternates between grouping pixels into individual clusters to abstract representatives and updating the deep features of pixels with current representatives.
  arXiv  Detail & Related papers  (2024-03-26T06:04:50Z)
• Semi-supervised multi-view concept decomposition [30.699496411869834]
  Concept Factorization (CF) has demonstrated superior performance in multi-view clustering tasks. We propose a novel semi-supervised multi-view concept factorization model, named SMVCF. We conduct experiments on four diverse datasets to evaluate the performance of SMVCF.
  arXiv  Detail & Related papers  (2023-07-03T10:50:44Z)
• One-step Multi-view Clustering with Diverse Representation [47.41455937479201]
  We propose a one-step multi-view clustering with diverse representation method, which incorporates multi-view learning and $k$-means into a unified framework. We develop an efficient optimization algorithm with proven convergence to solve the resultant problem.
  arXiv  Detail & Related papers  (2023-06-08T02:52:24Z)
• Discriminatively Constrained Semi-supervised Multi-view Nonnegative Matrix Factorization with Graph Regularization [10.978930376656423]
  We propose a novel Discriminatively Constrained Semi-Supervised Multi-View Nonnegative Matrix Factorization (DCS2MVNMF) Specifically, a discriminative weighting matrix is introduced for the auxiliary matrix of each view, which enhances the inter-class distinction. In addition, we design a new feature scale normalization strategy to align the multiple views and complete the corresponding iterative optimization schemes.
  arXiv  Detail & Related papers  (2020-10-26T02:58:11Z)
• Federated Multi-view Matrix Factorization for Personalized Recommendations [53.74747022749739]
  We introduce the federated multi-view matrix factorization method that extends the federated learning framework to matrix factorization with multiple data sources. Our method is able to learn the multi-view model without transferring the user's personal data to a central server.
  arXiv  Detail & Related papers  (2020-04-08T21:07:50Z)
• ClusterVO: Clustering Moving Instances and Estimating Visual Odometry for Self and Surroundings [54.33327082243022]
  ClusterVO is a stereo Visual Odometry which simultaneously clusters and estimates the motion of both ego and surrounding rigid clusters/objects. Unlike previous solutions relying on batch input or imposing priors on scene structure or dynamic object models, ClusterVO is online, general and thus can be used in various scenarios including indoor scene understanding and autonomous driving.
  arXiv  Detail & Related papers  (2020-03-29T09:06:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.