A fast and recursive algorithm for clustering large datasets with \(k\)-medians (Q434902): Difference between revisions
From MaRDI portal
Latest revision as of 11:02, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast and recursive algorithm for clustering large datasets with \(k\)-medians |
scientific article |
Statements
A fast and recursive algorithm for clustering large datasets with \(k\)-medians (English)
0 references
16 July 2012
0 references
averaging
0 references
high dimensional data
0 references
\(k\)-medoids
0 references
online clustering
0 references
partitioning around medoids
0 references
recursive estimators
0 references
Robbins-Monro
0 references
stochastic approximation
0 references
stochastic gradient
0 references
