The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Robust Manifold Nonnegative Matrix Factorization
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 ℓ 2,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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A vector space model for automatic indexing
Salton, G., Wong, A., & Yang, C. S. (1975) · Communications of the ACM · doi:10.1145/361219.361220 · Cited by 7,521
Martinez, A. M., & Kak, A. C. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.908974 · Cited by 3,249
Cited by
Multi-omic and multi-view clustering algorithms: review and cancer benchmark
Rappoport, N., & Shamir, R. (2018) · Nucleic Acids Research · doi:10.1093/nar/gky889 · Cited by 553
A review on machine learning principles for multi-view biological data integration
Li, Y., Wu, F.-X., & Ngom, A. (2016) · Briefings in Bioinformatics · doi:10.1093/bib/bbw113 · Cited by 421
Understanding and Predicting Weight Loss with Mobile Social Networking Data
Wang, Z., Derr, T., Yin, D., & Tang, J. (2017) · Proceedings of the 2017 ACM on Conference on Information and Knowledge Management · doi:10.1145/3132847.3133019 · Cited by 9
Metadata
- Authors
- Huang, J., Nie, F., Huang, H., & Ding, C.
- Venue
- ACM Transactions on Knowledge Discovery from Data
- Published
- 2014-06
- Volume
- 8
- Issue
- 3
- Pages
- 1-21
- ISSN
- 1556-4681 (ISSN-L)
- 1556-472X
- OpenAlex
- W2162316550
- Cited by
- 236
- References
- 2
- FWCI
- 16.91
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.