.png){kind=icon}
返回
A projection-based split-and-merge clustering algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2018.09.018.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A novel split-and-merge clustering algorithm is proposed by using projection technology and K-means method. There are two key technologies in the proposed method: shape recognition based on projection and split-and-merge process based on K-means. By projecting the data onto the connection of any two cluster centers, no matter how large the dimension of data is, we can always obtain an one-dimension density curve of the projection to guarantee an acceptable amount of calculation. Further embedded the kernel density estimate, we can determine the distribution of clusters by the shape of the one-dimensional density curve. In the split-and-merge process, this algorithm not only addresses the sensitivity in selecting initial cluster centers, but also automatically give a reasonable number of clusters. We also discuss the possibility to extend the projection split-and-merge method from K-means to density based methods (as EM algorithm and Cross-entropy clustering). Both simulation and real data experimental results show that our method performance well especially under strict data conditions. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Split-and-merge
Projection
K-means
Density curve
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
分享收藏Can primary care research be conducted more efficiently using routinely reported practice-level data: a cluster randomised controlled trial conducted in England?.png)
BMJ Open
OAAI
BMJ OpenIF0
OAAI分享收藏Robust clustering by deterministic agglomeration EM of mixtures of multivariate t-distributionsPATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
查看更多内容