The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis
Open accessAbstract
Motivation: Many practical pattern recognition problems require non-negativity constraints. For example, pixels in digital images and chemical concentrations in bioinformatics are non-negative. Sparse non-negative matrix factorizations (NMFs) are useful when the degree of sparseness in the non-negative basis matrix or the non-negative coefficient matrix in an NMF needs to be controlled in approximating high-dimensional data in a lower dimensional space. Results: In this article, we introduce a novel formulation of sparse NMF and show how the new formulation leads to a convergent sparse NMF algorithm via alternating non-negativity-constrained least squares. We apply our sparse NMF algorithm to cancer-class discovery and gene expression data analysis and offer biological analysis of the results obtained. Our experimental results illustrate that the proposed sparse NMF algorithm often achieves better clustering performance with shorter computing time compared to other existing NMF algorithms. Availability: The software is available as supplementary material. Contact: hskim@cc.gatech.edu, hpark@acc.gatech.edu Supplementary information: Supplementary data are available at Bioinformatics online.
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
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
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
Golub, T. R., Slonim, D. K., Tamayo, P., Huard, C., Gaasenbeek, M., Mesirov, J. P., Coller, H., Loh, M. L., Downing, J. R., Caligiuri, M. A., et al. (1999) · Science · doi:10.1126/science.286.5439.531 · Cited by 11,516
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Lee, D. D., & Seung, H. S. (2000) · neural information processing systems · Cited by 9,873
Solving Least Squares Problems
Lawson, C. L., & Hanson, R. J. (1995) · doi:10.1137/1.9781611971217 · Cited by 7,103
Non-negative matrix factorization with sparseness constraints
Hoyer, P. O. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0408058 · Cited by 2,591
Prediction of central nervous system embryonal tumour outcome based on gene expression
Pomeroy, S. L., Tamayo, P., Gaasenbeek, M., Sturla, L. M., Angelo, M., McLaughlin, M. E., Kim, J. Y. H., Goumnerova, L. C., Black, P. M., Lau, C., et al. (2002) · Nature · doi:10.1038/415436a · Cited by 2,371
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
Algorithms and applications for approximate nonnegative matrix factorization
Berry, M. W., Browne, M., Langville, A. N., Pauca, V. P., & Plemmons, R. J. (2007) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2006.11.006 · Cited by 1,512
Solving Least Squares Problems
Bjork, A., Lawson, C. L., & Hanson, R. J. (1976) · Mathematics of Computation · doi:10.2307/2005340 · Cited by 1,146
A fast non-negativity-constrained least squares algorithm
Bro, R., & De Jong, S. (1997) · Journal of Chemometrics · doi:10.1002/(sici)1099-128x(199709/10)11:5<393::aid-cem483>3.0.co;2-l · Cited by 906
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
Matrices, Vector Spaces, and Information Retrieval
Berry, M. W., Drmac, Z., & Jessup, E. R. (1999) · SIAM Review · doi:10.1137/s0036144598347035 · Cited by 692
On the convergence of the block nonlinear Gauss–Seidel method under convex constraints
Grippo, L., & Sciandrone, M. (2000) · Operations Research Letters · doi:10.1016/s0167-6377(99)00074-7 · Cited by 678
Nonnegative matrix factorization for spectral data analysis
Pauca, V. P., Piper, J., & Plemmons, R. J. (2006) · Linear Algebra and its Applications · doi:10.1016/j.laa.2005.06.025 · Cited by 584
Profiling Gene Expression Using Onto-Express
Khatri, P., Draghici, S., Ostermeier, G. C., & Krawetz, S. A. (2002) · Genomics · doi:10.1006/geno.2002.6698 · Cited by 459
Carrasco, D. R., Tonon, G., Huang, Y., Zhang, Y., Sinha, R., Feng, B., Stewart, J. P., Zhan, F., Khatry, D., Protopopova, M., et al. (2006) · Cancer Cell · doi:10.1016/j.ccr.2006.03.019 · Cited by 425
Nonsmooth nonnegative matrix factorization (nsNMF)
Pascual-Montano, A., Carazo, J. M., Kochi, K., Lehmann, D., & Pascual-Marqui, R. D. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.60 · Cited by 419
Draghici, S. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkg624 · Cited by 355
Improving molecular cancer class discovery through sparse non-negative matrix factorization
Gao, Y., & Church, G. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti653 · Cited by 339
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
Subsystem Identification Through Dimensionality Reduction of Large-Scale Gene Expression Data
Kim, P. M., & Tidor, B. (2003) · Genome Research · doi:10.1101/gr.903503 · Cited by 251
Fast algorithm for the solution of large‐scale non‐negativity‐constrained least squares problems
Van Benthem, M. H., & Keenan, M. R. (2004) · Journal of Chemometrics · doi:10.1002/cem.889 · Cited by 241
Dimension Reduction in Text Classification with Support Vector Machines
Kim, H., Howland, P., & Park, H. (2005) · Cited by 212
Self-citationMaher, E. A., Brennan, C., Wen, P. Y., Durso, L., Ligon, K. L., Richardson, A., Khatry, D., Feng, B., Sinha, R., Louis, D. N., et al. (2006) · Cancer Research · doi:10.1158/0008-5472.can-06-2072 · Cited by 210
Biclustering of gene expression data by non-smooth non-negative matrix factorization
Carmona-Saez, P., Pascual-Marqui, R. D., Tirado, F., Carazo, J. M., & Pascual-Montano, A. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-78 · Cited by 205
Adaptive dimension reduction for clustering high dimensional data
Ding, C., He, X., Hongyuan Zha, B., & Simon, H. D. (2003) · Proceedings · doi:10.1109/icdm.2002.1183897 · Cited by 164
Accelerating the Lee-Seung Algorithm for Nonnegative Matrix Factorization
Gonzalez, E. F., & Zhang, Y. (2005) · Rice Research Repository (Rice University) · Cited by 163
Dimension Reduction in Text Classification with Support Vector Machines
KimHyunsoo, HowlandPeg, & ParkHaesun (2005) · Journal of Machine Learning Research · doi:10.5555/1046920.1046922 · Cited by 118
Adaptive dimension reduction for clustering high dimensional data
Ding, C. H. Q., He, X., Hongyuan Zha, B., & Simon, H. D. (2002) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/807420 · Cited by 108
Multi-way clustering of microarray data using probabilistic sparse matrix factorization
Dueck, D., Morris, Q., & Frey, B. J. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1041 · Cited by 98
Discovering semantic features in the literature: a foundation for building functional associations
Chagoyen, M., Carmona‐Sáez, P., Shatkay, H., Carazo, J. M., & Pascual-Montano, A. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-41 · Cited by 94
Theme discovery from gene lists for identification and viewing of multiple functional groups
Pehkonen, P., Wong, G., & Törönen, P. (2005) · BMC Bioinformatics · doi:10.1186/1471-2105-6-162 · Cited by 54
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
Fast and Efficient Estimation of Individual Ancestry Coefficients
Frichot, E., Mathieu, F., Trouillon, T., Bouchard, G., & François, O. (2014) · Genetics · doi:10.1534/genetics.113.160572 · Cited by 931
Proteogenomic Characterization Reveals Therapeutic Vulnerabilities in Lung Adenocarcinoma
Gillette, M. A., Satpathy, S., Cao, S., Dhanasekaran, S. M., Vasaikar, S. V., Krug, K., Petralia, F., Li, Y., Liang, W.-W., Reva, B., et al. (2020) · Cell · doi:10.1016/j.cell.2020.06.013 · Cited by 820
Metadata
- Authors
- Kim, H., & Park, H.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2007-05-05
- Volume
- 23
- Issue
- 12
- Pages
- 1495-1502
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2165685007
- Cited by
- 863
- References
- 33
- FWCI
- 5.63
- Type
- journal article
- Language
- en
- Open access
- bronze
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.