Home › Entities › academia › Dual-graph regularized non-negative matrix factorization with sparse and orthogonal constraints

Dual-graph regularized non-negative matrix factorization with sparse and orthogonal constraints

Research article (Engineering Applications of Artificial Intelligence, 2017) · cited 89× · AI/ML
academia openalex:W2776766374
Press Enter · cited answer in seconds

Dual-graph regularized non-negative matrix factorization with sparse and orthogonal constraints

Summary

Dual-graph regularized non-negative matrix factorization with sparse and orthogonal constraints is a scholarly article[1].

Key Facts

  • Dual-graph regularized non-negative matrix factorization with sparse and orthogonal constraints's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 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). Dual-graph regularized non-negative matrix factorization with sparse and orthogonal constraints. Retrieved May 24, 2026, from https://4ort.xyz/entity/dual-graph-regularized-non-negative-matrix-factorization-with-sparse-and-orthogonal-constraints
MLA “Dual-graph regularized non-negative matrix factorization with sparse and orthogonal constraints.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/dual-graph-regularized-non-negative-matrix-factorization-with-sparse-and-orthogonal-constraints.
BibTeX @misc{4ortxyz_dual-graph-regularized-non-negative-matrix-factorization-with-sparse-and-orthogonal-constraints_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Dual-graph regularized non-negative matrix factorization with sparse and orthogonal constraints}}, year = {2026}, url = {https://4ort.xyz/entity/dual-graph-regularized-non-negative-matrix-factorization-with-sparse-and-orthogonal-constraints}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Dual-graph regularized non-negative matrix factorization with sparse and orthogonal constraints — https://4ort.xyz/entity/dual-graph-regularized-non-negative-matrix-factorization-with-sparse-and-orthogonal-constraints (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/dual-graph-regularized-non-negative-matrix-factorization-with-sparse-and-orthogonal-constraints · Last refreshed: