Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering (Q2670543)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7487812
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering |
scientific article; zbMATH DE number 7487812 |
Statements
Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering (English)
0 references
11 March 2022
0 references
machine learning
0 references
graph-based clustering
0 references
doubly stochastic affinity matrix
0 references
idempotent matrix
0 references
ADMM
0 references
0 references
0.7201249599456787
0 references
0.6849207878112793
0 references
0.6543343663215637
0 references
0.6425517797470093
0 references
0.6408892273902893
0 references
