Journal Article10.1145/2601434
Robust Manifold Nonnegative Matrix Factorization
244
TL;DR: This article proposes a Robust Manifold Nonnegative Matrix Factorization (RMNMF) method using ℓ2,1-norm and integrating NMF and spectral clustering under the same clustering framework and reveals the connection of the method with robust K-means and spectral clusterering, and demonstrates its theoretical significance.
read more
Abstract: Nonnegative Matrix Factorization (NMF) has been one of the most widely used clustering techniques for exploratory data analysis. However, since each data point enters the objective function with squared residue error, a few outliers with large errors easily dominate the objective function. In this article, we propose a Robust Manifold Nonnegative Matrix Factorization (RMNMF) method using e2,1-norm and integrating NMF and spectral clustering under the same clustering framework. We also point out the solution uniqueness issue for the existing NMF methods and propose an additional orthonormal constraint to address this problem. With the new constraint, the conventional auxiliary function approach no longer works. We tackle this difficult optimization problem via a novel Augmented Lagrangian Method (ALM)--based algorithm and convert the original constrained optimization problem on one variable into a multivariate constrained problem. The new objective function then can be decomposed into several subproblems that each has a closed-form solution. More importantly, we reveal the connection of our method with robust K-means and spectral clustering, and we demonstrate its theoretical significance. Extensive experiments have been conducted on nine benchmark datasets, and all empirical results show the effectiveness of our method.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Parameter-less Auto-weighted multiple graph regularized Nonnegative Matrix Factorization for data representation
TL;DR: In GNMF, an affinity graph is constructed to encode the geometrical information and a matrix factorization is sought, which respects the graph structure, and the empirical study shows encouraging results of the proposed algorithm in comparison to the state-of-the-art algorithms on real-world problems.
1.1K
A review on machine learning principles for multi-view biological data integration.
TL;DR: It is shown that Bayesian models are able to use prior information and model measurements with various distributions, and a range of deep neural networks can be integrated in multi-modal learning for capturing the complex mechanism of biological systems.
449
Multi-omic and multi-view clustering algorithms: review and cancer benchmark
Nimrod Rappoport,Ron Shamir +1 more
TL;DR: This review covers methods developed specifically for omic data as well as generic multi-view methods developed in the machine learning community for joint clustering of multiple data types, providing the first systematic comparison of leading multi-omics and multi-View clustering algorithms.
407
•Proceedings Article
Embedded unsupervised feature selection
Suhang Wang,Jiliang Tang,Huan Liu +2 more
- 25 Jan 2015
TL;DR: A novel unsupervised feature selection algorithm EUFS is proposed, which directly embeds feature selection into a clustering algorithm via sparse learning without the transformation, and the Alternating Direction Method of Multipliers is used to address the optimization problem of EUFS.
Hyperspectral image unsupervised classification by robust manifold matrix factorization
TL;DR: This work proposes a hyperspectral image unsupervised classification framework based on robust manifold matrix factorization and its out-of-sample extension and designs a novel Augmented Lagrangian Method (ALM) based procedure to seek the local optimal solution of the proposed optimization.
253
References
Nonlinear dimensionality reduction by locally linear embedding.
Sam T. Roweis,Lawrence K. Saul +1 more
TL;DR: Locally linear embedding (LLE) is introduced, an unsupervised learning algorithm that computes low-dimensional, neighborhood-preserving embeddings of high-dimensional inputs that learns the global structure of nonlinear manifolds.
Normalized cuts and image segmentation
Jianbo Shi,Jitendra Malik +1 more
TL;DR: This work treats image segmentation as a graph partitioning problem and proposes a novel global criterion, the normalized cut, for segmenting the graph, which measures both the total dissimilarity between the different groups as well as the total similarity within the groups.
Normalized cuts and image segmentation
Jianbo Shi,Jitendra Malik +1 more
- 17 Jun 1997
TL;DR: This work treats image segmentation as a graph partitioning problem and proposes a novel global criterion, the normalized cut, for segmenting the graph, which measures both the total dissimilarity between the different groups as well as the total similarity within the groups.
A tutorial on spectral clustering
TL;DR: In this article, the authors present the most common spectral clustering algorithms, and derive those algorithms from scratch by several different approaches, and discuss the advantages and disadvantages of these algorithms.