Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 1,512

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Algorithms and applications for approximate nonnegative matrix factorization

Berry, Michael W., Browne, Murray, Langville, Amy N., Pauca, V. Paul, Plemmons, Robert J.·2007·Computational Statistics & Data Analysis
DOI 10.1016/j.csda.2006.11.006
Open this paper in CoChat — free account

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.csda.2006.11.006

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 41

  1. Berman, 1969, Lattice approximations to the minima of functions of several variables, J. Assoc. Comput. Mach., 16, 286, 10.1145/321510.321520 · doi:10.1145/321510.321520
  2. Berry, 2005, Email surveillance using nonnegative matrix factorization, Comput. Math. Organization Theory, 11, 249, 10.1007/s10588-005-5380-5 · doi:10.1007/s10588-005-5380-5
  3. Bro, 1997, A fast non-negativity constrained linear least squares algorithm, J. Chemometrics, 11, 393, 10.1002/(SICI)1099-128X(199709/10)11:5<393::AID-CEM483>3.0.CO;2-L · DOI · Paper page
  4. Catral, 2004, On reduced rank non-negative factorization for symmetric non-negative matrices, Linear Algebra Appl., 393, 107, 10.1016/j.laa.2003.11.024 · doi:10.1016/j.laa.2003.11.024
  5. Chang, 2000, An information theoretic-based approach to spectral variability, similarity, and discriminability for hyperspectral image analysis, IEEE Trans. Inform. Theory, 46, 1927, 10.1109/18.857802 · DOI · Paper page
  6. Chen, Z., Cichocki, A., 2005. Nonnegative matrix factorization with temporal smoothness and/or spatial decorrelation constraints, preprint.
  7. Cichocki, A., Zdunek, R., Amari, S., 2006. Csiszar's divergences for non-negative matrix factorization: family of new algorithms. In: Proceedings of the Sixth International Conference on Independent Component Analysis and Blind Signal Separation, Charleston, SC, March 5–8. · DOI · Paper page
  8. de Leeuw, 1976, Additive structure in qualitative data: an alternating least squares method with optimal scaling features, Psychometrika, 41, 471, 10.1007/BF02296971 · DOI
  9. Dhillon, I., Sra, S., 2005. Generalized nonnegative matrix approximations with bregman divergences. In: Proceeding of the Neural Information Processing Systems (NIPS) Conference, Vancouver, BC.
  10. Ding, C., He, X., Simon, H., 2005. On the equivalence of nonnegative matrix factorization and spectral clustering. In: Proceedings of the Fifth SIAM International Conference on Data Mining, Newport Beach, CA. · DOI · Paper page
  11. Donoho, D., Stodden, V., 2003. When does non-negative matrix factorization give a correct decomposition into parts? In: Seventeenth Annual Conference on Neural Information Processing Systems.
  12. Drineas, 2006, Fast Monte Carlo algorithms for matrices iii: computing a compressed approximate matrix decomposition, SIAM J. Comput., 36, 132, 10.1137/S0097539704442684 · DOI · Paper page
  13. Finesso, L., Spreij, P., 2004. Approximate nonnegative matrix factorization via alternating minimization. In: Proceedings of the 16th International Symposium on Mathematical Theory of Networks and Systems, Leuven, Belgium, July 5–9.
  14. Grippo, 2000, On the convergence of the block nonlinear Gauss–Seidel method under convex constraints, Oper. Res. Lett., 26, 127, 10.1016/S0167-6377(99)00074-7 · DOI · Paper page
  15. Guillamet, D., Bressan, M., Vitria, J., 2001. A weighted non-negative matrix factorization for local representations. In: Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 1, Kavai, HI, pp. 942–947. · doi:10.1109/cvpr.2001.990629
  16. Hamza, 2006, Reconstruction of reflectance spectra using robust non-negative matrix factorization, IEEE Transactions on Signal Processing, 54, 3637, 10.1109/TSP.2006.879282 · DOI
  17. Hoyer, P., 2002. Non-negative sparse coding. In: Proceedings of the IEEE Workshop on Neural Networks for Signal Processing. Martigny, Switzerland.
  18. Hoyer, 2004, Non-negative matrix factorization with sparseness constraints, J. Mach. Learning Res., 5, 1457
  19. Karvanen, J., Cichocki, A., 2003. Measuring sparseness of noisy signals. In: Proceedings of the Fourth International Symposium on Independent Component Analysis and Blind Signal Separation (ICA2003), Nara, Japan.
  20. Keshava, 2003, A survey of spectral unmixing algorithms, Lincoln Laboratory J., 14, 55
  21. Langville, A., Meyer, C., Albright, R., Cox, J., Duling, D., 2006. Algorithms, initializations, and convergence for the nonnegative matrix factorization, preprint.
  22. Lee, 1999, Learning the parts of objects by non-negative matrix factorization, Nature, 401, 788, 10.1038/44565 · DOI · Paper page
  23. Lee, 2001, Algorithms for non-negative matrix factorization, Adv. Neural Inform. Process. Systems, 13, 556
  24. Luu, K., Matson, C., Snodgrass, J., Giffin, M., Hamada, K., Lambert, J., 2003. Object characterization from spectral data. In: Proceedings of the 2003 AMOS Technical Conference, Maui, HI, September. · doi:10.1364/fio.2003.tuk2
  25. Nagy, 2000, Enforcing nonnegativity in image reconstruction algorithms, Math. Modeling, Estimation, and Imaging, 4121, 182, 10.1117/12.402439 · doi:10.1117/12.402439
  26. Paatero, 1997, Least squares formulation of robust non-negative factor analysis, Chemometrics and Intell. Laboratory Syst., 37, 23, 10.1016/S0169-7439(96)00044-5 · DOI · Paper page
  27. Paatero, 1994, Positive matrix factorization: a non-negative factor model with optimal utilization of error estimates of data values, Environmetrics, 5, 111, 10.1002/env.3170050203 · DOI · Paper page
  28. Pauca, V., Shahnaz, F., Berry, M., Plemmons, R., 2004. Text mining using non-negative matrix factorizations. In: Proceedings of the Fourth SIAM International Conference on Data Mining, April 22–24. SIAM, Lake Buena Vista, FL. · DOI · Paper page
  29. Pauca, P., Piper, J., Plemmons, R., 2006a. Nonnegative matrix factorization for spectral data analysis. Linear Algebra Appl. 416 (1), 29–47. · DOI · Paper page
  30. Piper, J., Pauca, V., Plemmons, R., Giffin, M., 2004. Object characterization from spectral data using nonnegative factorization and information theory. In: Proceedings of the 2004 AMOS Technical Conference, Maui, HI, September.
  31. Plaza, 2004, A quantitative and comparative analysis of endmember extraction algorithms from hyperspectral data, IEEE Trans. on Geoscience and Remote Sensing, 42, 650, 10.1109/TGRS.2003.820314 · DOI · Paper page
  32. Powell, 1973, On search directions for minimization, Math. Programming, 4, 193, 10.1007/BF01584660 · DOI
  33. Salakhutdinov, 2003, On the convergence of bound optimization algorithms, Uncertainty in Artificial Intelligence, 19, 509
  34. Shahnaz, 2006, Document clustering using nonnegative matrix factorization, Inform. Process. Manage., 42, 373, 10.1016/j.ipm.2004.11.005 · DOI · Paper page
  35. Torczon, 1997, On the convergence of pattern search algorithms, SIAM J. Optim., 7, 1, 10.1137/S1052623493250780 · DOI · Paper page
  36. Wang, Y., Jiar, Y., Hu, C., Turk, M., 2004. Fisher non-negative matrix factorization for learning local features. In: Asian Conference on Computer Vision, Korea, January 27–30.
  37. Wild, S., 2002. Seeding non-negative matrix factorization with the spherical k-means clustering. Master's Thesis, University of Colorado.
  38. Wild, S., Curry, J., Dougherty, A., 2003. Motivating non-negative matrix factorizations. In: Proceedings of the Eighth SIAM Conference on Applied Linear Algebra, July 15–19. SIAM, Williamsburg, VA, 〈http://www.siam.org/meetings/la03/proceedings〉.
  39. Xu, W., Liu, X., Gong, Y., 2003. Document-clustering based on non-negative matrix factorization. In: Proceedings of SIGIR’03, July 28–August 1, Toronto, CA, pp. 267–273. · doi:10.1145/860484.860485
  40. Zangwill, 1967, Minimizing a function without calculating derivatives, Comput. J., 10, 293, 10.1093/comjnl/10.3.293 · doi:10.1093/comjnl/10.3.293
  41. Zdunek, R., Cichocki, A., 2006. Non-negative matrix factorization with quasi-newton optimization. In: Proceedings of the Eighth International Conference on Artificial Intelligence and Soft Computing, ICAISC, Zakopane, Poland, June 25–29. · DOI

Cited by

See all 1,512

Metadata

Authors
Berry, M. W., Browne, M., Langville, A. N., Pauca, V. P., & Plemmons, R. J.
Venue
Computational Statistics & Data Analysis
Publisher
Elsevier BV
Published
2007-09
Volume
52
Issue
1
Pages
155-173
ISSN
0167-9473 (ISSN-L)
DOI
10.1016/j.csda.2006.11.006
OpenAlex
W2017288758
Cited by
1,512
References
2
FWCI
56.46
Type
journal article
Language
en
Open access
closed
Licence
www.elsevier.com/tdm/userlicense/1.0/ (tdm)

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.