Compressed Nonnegative Matrix Factorization Is Fast and Accurate
Research article (IEEE Transactions on Signal Processing, 2016) · cited 41× · AI/ML
Press Enter · cited answer in seconds
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Direct Wikidata claims
- [2] ↑ Compressed Nonnegative Matrix Factorization Is Fast and Accurate — instance of (P31): scholarly article. wikidata.org.
Class ancestry
📑 Cite this page
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA
4ort.xyz Knowledge Graph. (2026). Compressed Nonnegative Matrix Factorization Is Fast and Accurate. Retrieved May 24, 2026, from https://4ort.xyz/entity/compressed-nonnegative-matrix-factorization-is-fast-and-accurate
MLA
“Compressed Nonnegative Matrix Factorization Is Fast and Accurate.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/compressed-nonnegative-matrix-factorization-is-fast-and-accurate.
BibTeX
@misc{4ortxyz_compressed-nonnegative-matrix-factorization-is-fast-and-accurate_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Compressed Nonnegative Matrix Factorization Is Fast and Accurate}}, year = {2026}, url = {https://4ort.xyz/entity/compressed-nonnegative-matrix-factorization-is-fast-and-accurate}, note = {Accessed: 2026-05-24}}
LLM prompt
According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Compressed Nonnegative Matrix Factorization Is Fast and Accurate — https://4ort.xyz/entity/compressed-nonnegative-matrix-factorization-is-fast-and-accurate (retrieved 2026-05-24)
Canonical URL: https://4ort.xyz/entity/compressed-nonnegative-matrix-factorization-is-fast-and-accurate · Last refreshed: