Simulated annealing for selecting optimal initial seeds in the \(K\)-means algorithm (Q1331167)
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: Simulated annealing for selecting optimal initial seeds in the \(K\)-means algorithm |
scientific article; zbMATH DE number 618114
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simulated annealing for selecting optimal initial seeds in the \(K\)-means algorithm |
scientific article; zbMATH DE number 618114 |
Statements
Simulated annealing for selecting optimal initial seeds in the \(K\)-means algorithm (English)
0 references
14 August 1994
0 references
clustering methods
0 references
partitional algorithms
0 references
simulated annealing
0 references
probabilistic search method
0 references
selected data sets
0 references
0.8655079
0 references
0.85907376
0 references
0.8534355
0 references
