An improved \(K\)-means algorithm using a weighted distance based on the maximum between-cluster variation (Q3017221)
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 5927260
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved \(K\)-means algorithm using a weighted distance based on the maximum between-cluster variation |
scientific article; zbMATH DE number 5927260 |
Statements
19 July 2011
0 references
\(K\)-means algorithm
0 references
clustering
0 references
between-cluster variation
0 references
weighted distance
0 references
0.8235310912132263
0 references
0.8067278265953064
0 references
0.8044632077217102
0 references
0.8014454245567322
0 references
0.7956174612045288
0 references
