.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
clustering
K-means algorithm
kd-tree
initialisation
density estimation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
暂无机构信息
引用论文
分享收藏Molecular relationships between Pseudomonas INC P-9 degradative plasmids TOL, NAH, and SAL.png)
Plasmid
PlasmidIF0
PREAI
分享收藏
分享收藏 没有更多内容
没有更多内容