Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering (Q2670543)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering |
scientific article |
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
