.png){kind=icon}
返回
A novel graph-based clustering method using noise cutting
.png){kind=icon}
PRE
AI
DOI：10.1016/j.is.2020.101504.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recently, many methods have appeared in the field of cluster analysis. Most existing clustering algorithms have considerable limitations in dealing with local and nonlinear data patterns. Algorithms based on graphs provide good results for this problem. However, some widely used graph-based clustering methods, such as spectral clustering algorithms, are sensitive to noise and outliers. In this paper, a cut-point clustering algorithm (CutPC) based on a natural neighbor graph is proposed. The CutPC method performs noise cutting when a cut-point value is above the critical value. Normally, the method can automatically identify clusters with arbitrary shapes and detect outliers without any prior knowledge or preparatory parameter settings. The user can also adjust a coefficient to adapt clustering solutions for particular problems better. Experimental results on various synthetic and realworld datasets demonstrate the obvious superiority of CutPC compared with k-means, DBSCAN, DPC, SC, and DCore. (C) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Graph-based clustering
Natural neighbors
Noise cutting
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
2.8K
被引数:
1.8K
机构
引用论文
Fabrication of hydrophobic composite films by sol-gel process between POSS -containing fluorinated polyacrylate latexes and colloidal silica particles溶胶-凝胶法制备含POSS含氟聚丙烯酸酯胶乳与胶体二氧化硅颗粒的疏水复合膜
.png){kind=icon}
PREAI
分享收藏A survey on nature inspired metaheuristic algorithms for partitional clustering基于自然启发的分区聚类元启发式算法综述
PREAI
分享收藏Non-destructive monitoring of corrosion extent in steel rope wires via Barkhausen noise emission
PREAI
分享收藏Study on density peaks clustering based on k-nearest neighbors and principal component analysis基于k近邻和主成分分析的密度峰聚类研究
PREAI
分享收藏分享收藏分享收藏
查看更多内容