.png){kind=icon}
Return
A method for initialising the K-means clustering algorithm using kd-trees
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2007.01.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a method for initialising the K-means clustering algorithm. Our method hinges on the use of a kd-tree to perform a density estimation of the data at various locations. We then use a modification of Katsavounidis' algorithm, which incorporates this density information, to choose K seeds for the K-means algorithm. We test our algorithm on 36 synthetic datasets, and 2 datasets from the UCI Machine Learning Repository, and compare with 15 runs of Forgy's random initialisation method, Katsavounidis' algorithm, and Bradley and Fayyad's method. (c) 2007 Elsevier B.V. All rights reserved.
Keywords:
clustering
K-means algorithm
kd-tree
initialisation
density estimation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
8.0K
Citations:
1.6W
Organization
No organization information available
Cited Papers
ShareSaveMolecular relationships between Pseudomonas INC P-9 degradative plasmids TOL, NAH, and SAL.png)
Plasmid
PlasmidIF0
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSave no more
no more