The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Robust nonnegative matrix factorization using L21-norm
Abstract
Nonnegative matrix factorization (NMF) is widely used in data mining and machine learning fields. However, many data contain noises and outliers. Thus a robust version of NMF is needed. In this paper, we propose a robust formulation of NMF using L21 norm loss function. We also derive a computational algorithm with rigorous convergence analysis. Our robust NMF approach, (1) can handle noises and outliers; (2) provides very efficient and elegant updating rules; (3) incurs almost the same computational cost as standard NMF, thus potentially to be used in more real world application tasks. Experiments on 10 datasets show that the robust NMF provides more faithful basis factors and consistently better clustering results as compared to standard NMF.
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
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Lee, D. D., & Seung, H. S. (2000) · neural information processing systems · Cited by 9,878
Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
Paatero, P., & Tapper, U. (1994) · Environmetrics · doi:10.1002/env.3170050203 · Cited by 6,023
From few to many: illumination cone models for face recognition under variable lighting and pose
Georghiades, A. S., Belhumeur, P. N., & Kriegman, D. J. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.927464 · Cited by 4,912
Metagenes and molecular pattern discovery using matrix factorization
Brunet, J.-P., Tamayo, P., Golub, T. R., & Mesirov, J. P. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0308531101 · Cited by 2,183
Advances in Neural Information Processing Systems 18
Murray, I., Mackay, D., Zoubin Ghahramani, A., & Skilling, J. (2006) · Cited by 1,927
Efficient and Robust Feature Selection via Joint ℓ2,1-Norms Minimization
Nie, F., Huang, H., Cai, X., & Ding, C. H. Q. (2010) · Cited by 1,522
Self-citationConvex and Semi-Nonnegative Matrix Factorizations
Ding, C. H. Q., Li, T., & Jordan, M. I. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.277 · Cited by 1,317
Self-citationOrthogonal nonnegative matrix t-factorizations for clustering
Ding, C., Li, T., Peng, W., & Park, H. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150420 · Cited by 1,245
Self-citationOn the Equivalence of Nonnegative Matrix Factorization and Spectral Clustering
Ding, C., He, X., & Simon, H. D. (2005) · Proceedings of the 2005 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972757.70 · Cited by 985
Self-citationMaximum-Margin Matrix Factorization
Srebro, N., Rennie, J. D. M., & Jaakkola, T. (2004) · Cited by 962
Learning spatially localized, parts-based representation
Li, S. Z., Hou, X. W., Zhang, H. J., & Cheng, Q. S. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990477 · Cited by 776
R1-PCA: rotational invariant L1-norm principal component analysis for robust subspace factorization
Ding, C., Zhou, D., He, X., & Zha, H. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143880 · Cited by 633
Self-citationGeneralized Nonnegative Matrix Approximations with Bregman Divergences
Sra, S., & Dhillon, I. S. (2005) · MPG.PuRe (Max Planck Society) · Cited by 523
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
Text Mining using Non-Negative Matrix Factorizations
Pauca, V. P., Shahnaz, F., Berry, M. W., & Plemmons, R. J. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.45 · Cited by 302
Gu, Q., & Zhou, J. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557063 · Cited by 235
Multiplicative Updates for Nonnegative Quadratic Programming in Support Vector Machines
Sha, F., Saul, L. K., & Lee, D. D. (2002) · ScholarlyCommons (University of Pennsylvania) · Cited by 147
Ding, C. H. Q., Li, T., & Peng, W. (2006) · National Conference on Artificial Intelligence · Cited by 138
Self-citationGeneralized Nonnegative Matrix Approximations with Bregman Divergences
Dhillon, I. S., & Sra, S. (2005) · Cited by 123
Nonnegative matrix factorization and its applications in pattern recognition
Liu, W., Zheng, N., & You, Q. (2006) · Chinese Science Bulletin · doi:10.1007/s11434-005-1109-6 · Cited by 108
Summarizing video using non-negative similarity matrix factorization
Cooper, M. L., & Foote, J. T. (2004) · IEEE Workshop on Multimedia Signal Processing (MMSP) · doi:10.1109/mmsp.2002.1203239 · Cited by 99
Cited by
A review of unsupervised feature selection methods
Solorio-Fernández, S., Carrasco-Ochoa, J. A., & Martínez-Trinidad, J. F. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-019-09682-y · Cited by 648
Unsupervised Feature Selection Using Nonnegative Spectral Analysis
Li, Z., Yang, Y., Liu, J., Zhou, X., & Lu, H. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8289 · Cited by 508
Shao, W., He, L., & Yu, P. S. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-23528-8_20 · Cited by 281
Social contextual recommendation
Jiang, M., Cui, P., Liu, R., Yang, Q., Wang, F., Zhu, W., & Yang, S. (2012) · Proceedings of the 21st ACM international conference on Information and knowledge management · doi:10.1145/2396761.2396771 · Cited by 260
Robust Structured Nonnegative Matrix Factorization for Image Representation
Li, Z., Tang, J., & He, X. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2691725 · Cited by 257
Metadata
- Authors
- Kong, D., Ding, C., & Huang, H.
- Venue
- Proceedings of the 20th ACM international conference on Information and knowledge management
- Publisher
- ACM
- Published
- 2011-10-24
- Pages
- 673-682
- OpenAlex
- W2002469984
- Cited by
- 333
- References
- 23
- FWCI
- 8.61
- 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.