The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
SVD based initialization: A head start for nonnegative matrix factorization
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
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
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Paatero, P., & Tapper, U. (1994) · Environmetrics · doi:10.1002/env.3170050203 · Cited by 6,023
Nonnegative Matrices in the Mathematical Sciences
(1979) · Elsevier eBooks · doi:10.1016/c2013-0-10361-3 · Cited by 5,451
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Seung, D., & Lee, L.-W. (2001) · Cited by 4,753
Nonnegative Matrices in the Mathematical Sciences
Berman, A., & Plemmons, R. J. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971262 · Cited by 3,573
Non-negative matrix factorization with sparseness constraints
Hoyer, P. O. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0408058 · Cited by 2,591
(1991) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(91)90038-5 · Cited by 2,437
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
A flexible R package for nonnegative matrix factorization
Gaujoux, R., & Seoighe, C. (2010) · BMC Bioinformatics · doi:10.1186/1471-2105-11-367 · Cited by 1,547
Convex 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
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
A review of topic modeling methods
Vayansky, I., & Kumar, S. A. P. (2020) · Information Systems · doi:10.1016/j.is.2020.101582 · Cited by 716
Anderson Acceleration for Fixed-Point Iterations
Walker, H. F., & Ni, P. (2011) · SIAM Journal on Numerical Analysis · doi:10.1137/10078356x · Cited by 590
On the Complexity of Nonnegative Matrix Factorization
Vavasis, S. A. (2010) · SIAM Journal on Optimization · doi:10.1137/070709967 · Cited by 588
Glia Accumulate Evidence that Actions Are Futile and Suppress Unsuccessful Behavior
Mu, Y., Bennett, D. V., Rubinov, M., Narayan, S., Yang, C.-T., Tanimoto, M., Mensh, B. D., Looger, L. L., & Ahrens, M. B. (2019) · Cell · doi:10.1016/j.cell.2019.05.050 · Cited by 374
An analysis of the coherence of descriptors in topic modeling
O’Callaghan, D., Greene, D., Carthy, J., & Cunningham, P. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2015.02.055 · Cited by 370
A Deep Matrix Factorization Method for Learning Attribute Representations
Trigeorgis, G., Bousmalis, K., Zafeiriou, S., & Schuller, B. W. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2554555 · Cited by 356
Index and biological spectrum of human DNase I hypersensitive sites
Meuleman, W., Muratov, A., Rynes, E., Halow, J., Lee, K., Bates, D., Diegel, M., Dunn, D., Neri, F., Teodosiadis, A., et al. (2020) · Nature · doi:10.1038/s41586-020-2559-3 · Cited by 331
Topic modeling algorithms and applications: A survey
Abdelrazek, A., Eid, Y., Gawish, E., Medhat, W., & Hassan, A. (2023) · Information Systems · doi:10.1016/j.is.2022.102131 · Cited by 304
Unsupervised machine learning for exploratory data analysis in imaging mass spectrometry
Verbeeck, N., Caprioli, R. M., & Van de Plas, R. (2020) · Mass Spectrometry Reviews · doi:10.1002/mas.21602 · Cited by 281
Evolution of brain network dynamics in neurodevelopment
Chai, L. R., Khambhati, A. N., Ciric, R., Moore, T. M., Gur, R. C., Gur, R. E., Satterthwaite, T. D., & Bassett, D. S. (2017) · Network Neuroscience · doi:10.1162/netn_a_00001 · Cited by 100
“We used the deterministic, nonnegative singular value decomposition (Boutsidis & Gallopoulos, 2008) to initialize the subgraph and expression coefficient matrices, W and H ; this decomposition has shown rapid and stable convergence of the NMF algorithm.”
Detecting molecular subtypes from multi-omics datasets using SUMO
Sienkiewicz, K., Chen, J., Chatrath, A., Lawson, J. T., Sheffield, N. C., Zhang, L., & Ratan, A. (2022) · Cell Reports Methods · doi:10.1016/j.crmeth.2021.100152 · Cited by 18
“Both initialization and convergence speeds are important factors to consider when formulating the appropriate factorization algorithms (Boutsidis and Gallopoulos, 2008).”
Moon, S., & Lee, H. (2021) · Journal of Personalized Medicine · doi:10.3390/jpm11080686 · Cited by 19
“We used singular value decomposition (SVD), a popular initialization strategy in NMF tasks [21].”
Method
Metadata
- Authors
- Boutsidis, C., & Gallopoulos, E.
- Venue
- Pattern Recognition
- Publisher
- Elsevier BV
- Published
- 2008-04
- Volume
- 41
- Issue
- 4
- Pages
- 1350-1362
- ISSN
- 0031-3203 (ISSN-L)
- OpenAlex
- W2015583498
- Cited by
- 695
- References
- 35
- FWCI
- 11.78
- 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.