.png){kind=icon}
返回
Robust clustering using a kNN mode seeking ensemble
.png){kind=icon}
OA
AI
DOI：10.1016/j.patcog.2017.11.023.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we present a new algorithm for parameter-free clustering by mode seeking. Mode seeking, especially in the form of the mean shift algorithm, is a widely used strategy for clustering data, but at the same time prone to poor performance if the parameters are not chosen correctly. We propose to form a clustering ensemble consisting of repeated and bootstrapped runs of the recent kNN mode seeking algorithm, an algorithm which is faster than ordinary mean shift and more suited for high dimensional data. This creates a robust mode seeking clustering algorithm with respect to the choice of parameters and high dimensional input spaces, while at the same inheriting all other strengths of mode seeking in general. We demonstrate promising results on a number of synthetic and real data sets. (C) 2017 Elsevier Ltd. All rights reserved.
Keyword:
Density based clustering
Consensus clustering
kNN mode seeking
Mean shift
Ensemble clustering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data.png)
MACHINE LEARNINGOAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏Probabilistic consensus clustering using evidence accumulation使用证据积累的概率共识聚类MACHINE LEARNING
MACHINE LEARNINGIF2.9
PREAI
分享收藏
查看更多内容