A fast and recursive algorithm for clustering large datasets with \(k\)-medians (Q434902)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast and recursive algorithm for clustering large datasets with k-medians |
scientific article; zbMATH DE number 6056961
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast and recursive algorithm for clustering large datasets with \(k\)-medians |
scientific article; zbMATH DE number 6056961 |
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
0.91069853
0 references
0.8904715
0 references
0.88681024
0 references
0.88464695
0 references
0.8841593
0 references
0.8835062
0 references
