Home › Entities › academia › Deep graph regularized non-negative matrix factorization for multi-view clustering

Deep graph regularized non-negative matrix factorization for multi-view clustering

Research article (Neurocomputing, 2019) · cited 121× · AI/ML
CreativeWork academia

Facts

4 properties
Instance of
scholarly article[2]
Publication date
December 18, 2019as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
Published in
Neurocomputingas of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
Title
Deep graph regularized non-negative matrix factorization for multi-view clusteringas of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
🔖 Identifiers · 2
OpenAlex ID
W2995857167as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
DOI
10.1016/J.NEUCOM.2019.12.054as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
📚 Sources · 1

Report an error or request removal Lineage (PROV-JSON)

📜 Data licence
Source: OpenAlex (openalex.org), snapshot of 2026-09-23. CC0 1.0 Universal. CC0 1.0 Universal · OpenAlex
🔗 Connections
Authored by 5
Guoxu Zhou, Jianqiang Li, Shengli Xie, Yanjiao Wang, Yuning Qiu
← Author of 5
Guoxu Zhou, Jianqiang Li, Shengli Xie, Yanjiao Wang, Yuning Qiu
Press Enter · cited answer in seconds

Summary

Deep graph regularized non-negative matrix factorization for multi-view clustering is a scholarly article[1].

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). Deep graph regularized non-negative matrix factorization for multi-view clustering. Retrieved October 19, 2026, from https://4ort.xyz/entity/deep-graph-regularized-non-negative-matrix-factorization-for-multi-view-clustering
MLA “Deep graph regularized non-negative matrix factorization for multi-view clustering.” 4ort.xyz Knowledge Graph, 4ort.xyz, 19 Oct. 2026, https://4ort.xyz/entity/deep-graph-regularized-non-negative-matrix-factorization-for-multi-view-clustering.
BibTeX @misc{4ortxyz_deep-graph-regularized-non-negative-matrix-factorization-for-multi-view-clustering_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Deep graph regularized non-negative matrix factorization for multi-view clustering}}, year = {2026}, url = {https://4ort.xyz/entity/deep-graph-regularized-non-negative-matrix-factorization-for-multi-view-clustering}, note = {Accessed: 2026-10-19}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Deep graph regularized non-negative matrix factorization for multi-view clustering — https://4ort.xyz/entity/deep-graph-regularized-non-negative-matrix-factorization-for-multi-view-clustering (retrieved 2026-10-19)

Canonical URL: https://4ort.xyz/entity/deep-graph-regularized-non-negative-matrix-factorization-for-multi-view-clustering · Last refreshed: