.png){kind=icon}
返回
A parameter-free affinity based clustering
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-020-01812-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Several methods have been proposed to estimate the number of clusters in a dataset; the basic idea behind all of them has been to study an index that measures inter-cluster separation and intra-cluster cohesion over a range of cluster numbers and report the number which gives an optimum value of the index. In this paper, we propose a simple parameter-free approach that is more like human cognition of clusters, where closely lying points are easily identified to form a cluster and the total number of clusters is revealed. To identify closely lying points, the affinity of two points is defined as a function of distance and a threshold affinity is identified, above which two points in a dataset are likely to be in the same cluster. Well separated clusters are identified even in the presence of outliers, whereas for a not well-separated dataset, the final number of clusters is estimated from the detected clusters. And they are merged to produce the final clusters. Experiments performed with several large dimensional synthetic and real datasets show good results with robustness to noise and density variation within a dataset.
Keyword:
Clustering
Parameter-free methods
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
An extensive comparative study of cluster validity indices聚类有效性指标的广泛比较研究.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏Psychological characteristics and biofeedback mitigation in preadolescents with eating disorders
PREAI
分享收藏分享收藏
查看更多内容