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

The DOI matches its Crossref record; 52 of the 52 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

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

52 of 52 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

Show all 52 references

Research works printed but not linked: 12

  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. 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
  4. Chen, Z., Cichocki, A., 2005. Nonnegative matrix factorization with temporal smoothness and/or spatial decorrelation constraints, preprint.
  5. 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.
  6. 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
  7. 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
  8. Nagy, 2000, Enforcing nonnegativity in image reconstruction algorithms, Math. Modeling, Estimation, and Imaging, 4121, 182, 10.1117/12.402439 · doi:10.1117/12.402439
  9. Salakhutdinov, 2003, On the convergence of bound optimization algorithms, Uncertainty in Artificial Intelligence, 19, 509
  10. Wild, S., 2002. Seeding non-negative matrix factorization with the spherical k-means clustering. Master's Thesis, University of Colorado.
  11. 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〉.
  12. 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

Cited by

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)
OpenAlex
W2017288758
Cited by
1,512
References
52
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.