The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
The Relationships Among Various Nonnegative Matrix Factorization Methods for Clustering
Abstract
The nonnegative matrix factorization (NMF) has been shown recently to be useful for clustering and various extensions and variations of NMF have been proposed recently. Despite significant research progress in this area, few attempts have been made to establish the connections between various factorization methods while highlighting their differences. In this paper we aim to provide a comprehensive study on matrix factorization for clustering. In particular, we present an overview and summary on various matrix factorization algorithms and theoretically analyze the relationships among them. Experiments are also conducted to empirically evaluate and compare various factorization methods. In addition, our study also answers several previously unaddressed yet important questions for matrix factorizations including the interpretation and normalization of cluster posterior and the benefits and evaluation of simultaneous clustering. We expect our study would provide good insights on matrix factorization research for clustering.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
Learning the parts of objects by non-negative matrix factorization
Lee, D. D., & Seung, H. S. (1999) · Nature · doi:10.1038/44565 · Cited by 13,868
Paatero, P., & Tapper, U. (1994) · Environmetrics · doi:10.1002/env.3170050203 · Cited by 6,023
The Approximation of One Matrix by Another of Lower Rank
Eckart, C., & Young, G. (1936) · Psychometrika · doi:10.1007/bf02288367 · Cited by 3,800
Non-negative matrix factorization with sparseness constraints
Hoyer, P. O. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0408058 · Cited by 2,591
When Is ''Nearest Neighbor'' Meaningful?
Beyer, K., Goldstein, J., Ramakrishnan, R., & Shaft, U. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_15 · Cited by 2,403
Probabilistic Latent Semantic Analysis
Hofmann, T. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.6705 · Cited by 2,047
Document clustering based on non-negative matrix factorization
Xu, W., Liu, X., & Gong, Y. (2003) · Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval · doi:10.1145/860435.860485 · Cited by 1,860
Cited by
Clustering and projected clustering with adaptive neighbors
Nie, F., Wang, X., & Huang, H. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623726 · Cited by 981
Nonnegative Matrix Factorization: A Comprehensive Review
Wang, Y.-X., & Zhang, Y.-J. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2012.51 · Cited by 981
Transfer Learning for Visual Categorization: A Survey
Shao, L., Zhu, F., & Li, X. (2015) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2014.2330900 · Cited by 895
The Constrained Laplacian Rank Algorithm for Graph-Based Clustering
Nie, F., Wang, X., Jordan, M., & Huang, H. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10302 · Cited by 837
Constrained Nonnegative Matrix Factorization for Image Representation
Liu, H., Wu, Z., Cai, D., & Huang, T. S. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.217 · Cited by 520
Efficient agglomerative hierarchical clustering
Bouguettaya, A., Yu, Q., Liu, X., Zhou, X., & Song, A. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.09.054 · Cited by 442
Non-negative Matrix Factorization on Manifold
Cai, D., He, X., Wu, X., & Han, J. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.57 · Cited by 405
Linear and Nonlinear Projective Nonnegative Matrix Factorization
Yang, Z., & Oja, E. (2010) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2010.2041361 · Cited by 270
Metadata
- Authors
- Li, T., & Ding, C.
- Venue
- Sixth International Conference on Data Mining (ICDM'06)
- Publisher
- IEEE
- Published
- 2006-12
- Pages
- 362-371
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2124890708
- Cited by
- 315
- References
- 33
- FWCI
- 8.77
- Type
- conference paper
- 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.