Robust Matrix Factorization with Grouping Effect

• URL: http://arxiv.org/abs/2106.13681v1
• Date: Fri, 25 Jun 2021 15:03:52 GMT
• Title: Robust Matrix Factorization with Grouping Effect
• Authors: Haiyan Jiang, Shuyu Li, Luwei Zhang, Haoyi Xiong, Dejing Dou
• Abstract summary: We propose a novel method called Matrix Factorization with Grouping effect (GRMF) The proposed GRMF can learn grouping structure and sparsity in MF without prior knowledge. Experiments have been conducted using real-world data sets with outliers and contaminated noise.
• Score: 28.35582493230616
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Although many techniques have been applied to matrix factorization (MF), they may not fully exploit the feature structure. In this paper, we incorporate the grouping effect into MF and propose a novel method called Robust Matrix Factorization with Grouping effect (GRMF). The grouping effect is a generalization of the sparsity effect, which conducts denoising by clustering similar values around multiple centers instead of just around 0. Compared with existing algorithms, the proposed GRMF can automatically learn the grouping structure and sparsity in MF without prior knowledge, by introducing a naturally adjustable non-convex regularization to achieve simultaneous sparsity and grouping effect. Specifically, GRMF uses an efficient alternating minimization framework to perform MF, in which the original non-convex problem is first converted into a convex problem through Difference-of-Convex (DC) programming, and then solved by Alternating Direction Method of Multipliers (ADMM). In addition, GRMF can be easily extended to the Non-negative Matrix Factorization (NMF) settings. Extensive experiments have been conducted using real-world data sets with outliers and contaminated noise, where the experimental results show that GRMF has promoted performance and robustness, compared to five benchmark algorithms.

Related papers

• Graph Regularized NMF with L20-norm for Unsupervised Feature Learning [6.894518335015327]
  Graph Regularized Non-negative Matrix Factorization (GNMF) is an extension of NMF that incorporates graph regularization constraints. We propose an unsupervised feature learning framework based on GNMF and devise an algorithm based on PALM.
  arXiv  Detail & Related papers  (2024-03-16T12:10:01Z)
• Supervised Class-pairwise NMF for Data Representation and Classification [2.7320863258816512]
  Non-negative Matrix factorization (NMF) based methods add new terms to the cost function to adapt the model to specific tasks. NMF method adopts unsupervised approaches to estimate the factorizing matrices.
  arXiv  Detail & Related papers  (2022-09-28T04:33:03Z)
• Unitary Approximate Message Passing for Matrix Factorization [90.84906091118084]
  We consider matrix factorization (MF) with certain constraints, which finds wide applications in various areas. We develop a Bayesian approach to MF with an efficient message passing implementation, called UAMPMF. We show that UAMPMF significantly outperforms state-of-the-art algorithms in terms of recovery accuracy, robustness and computational complexity.
  arXiv  Detail & Related papers  (2022-07-31T12:09:32Z)
• Adaptive Weighted Nonnegative Matrix Factorization for Robust Feature Representation [9.844796520630522]
  Nonnegative matrix factorization (NMF) has been widely used to dimensionality reduction in machine learning. Traditional NMF does not properly handle outliers, so that it is sensitive to noise. This paper proposes an adaptive weighted NMF, which introduces weights to emphasize the different importance of each data point.
  arXiv  Detail & Related papers  (2022-06-07T05:27:08Z)
• Log-based Sparse Nonnegative Matrix Factorization for Data Representation [55.72494900138061]
  Nonnegative matrix factorization (NMF) has been widely studied in recent years due to its effectiveness in representing nonnegative data with parts-based representations. We propose a new NMF method with log-norm imposed on the factor matrices to enhance the sparseness. A novel column-wisely sparse norm, named $ell_2,log$-(pseudo) norm, is proposed to enhance the robustness of the proposed method.
  arXiv  Detail & Related papers  (2022-04-22T11:38:10Z)
• Entropy Minimizing Matrix Factorization [102.26446204624885]
  Nonnegative Matrix Factorization (NMF) is a widely-used data analysis technique, and has yielded impressive results in many real-world tasks. In this study, an Entropy Minimizing Matrix Factorization framework (EMMF) is developed to tackle the above problem. Considering that the outliers are usually much less than the normal samples, a new entropy loss function is established for matrix factorization.
  arXiv  Detail & Related papers  (2021-03-24T21:08:43Z)
• Self-supervised Symmetric Nonnegative Matrix Factorization [82.59905231819685]
  Symmetric nonnegative factor matrix (SNMF) has demonstrated to be a powerful method for data clustering. Inspired by ensemble clustering that aims to seek better clustering results, we propose self-supervised SNMF (S$3$NMF) We take advantage of the sensitivity to code characteristic of SNMF, without relying on any additional information.
  arXiv  Detail & Related papers  (2021-03-02T12:47:40Z)
• Hyperspectral Unmixing via Nonnegative Matrix Factorization with Handcrafted and Learnt Priors [14.032039261229853]
  We propose an NMF based unmixing framework which jointly uses a handcrafting regularizer and a learnt regularizer from data. We plug learnt priors of abundances where the associated subproblem can be addressed using various image denoisers.
  arXiv  Detail & Related papers  (2020-10-09T14:40:20Z)
• Positive Semidefinite Matrix Factorization: A Connection with Phase Retrieval and Affine Rank Minimization [71.57324258813674]
  We show that PSDMF algorithms can be designed based on phase retrieval (PR) and affine rank minimization (ARM) algorithms. Motivated by this idea, we introduce a new family of PSDMF algorithms based on iterative hard thresholding (IHT)
  arXiv  Detail & Related papers  (2020-07-24T06:10:19Z)
• Augmentation of the Reconstruction Performance of Fuzzy C-Means with an Optimized Fuzzification Factor Vector [99.19847674810079]
  Fuzzy C-Means (FCM) is one of the most frequently used methods to construct information granules. In this paper, we augment the FCM-based degranulation mechanism by introducing a vector of fuzzification factors. Experiments completed for both synthetic and publicly available datasets show that the proposed approach outperforms the generic data reconstruction approach.
  arXiv  Detail & Related papers  (2020-04-13T04:17:30Z)

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.