摘要
Clustering analysis, as a classical issue in data mining, is widely applied in various research areas. This article proposes a self-adaptive grey DBSCAN (SAG-DBSCAN) clustering algorithm by introducing a grey relational matrix to obtain the grey local density indicator. We then apply this local indicator to have self-adaptive noise identification to gain a dense subset of the clustering data set. An advantage of this algorithm is that it can automatically estimate the parameters utilized to cluster the dense subset. Several frequently-used data sets are further examined to compare the performance and effectiveness of our proposed clustering algorithm with those of other state-of-the-art algorithms. The comparisons indicate that our new method outperforms other common methods.
学科与关键词
- 一种基于高斯分布的自适应DBSCAN算法陈刚; 刘秉权; 吴岩微电子学与计算机, 2013, (03): 27.
- GrDBSCAN: A Granular Density-Based Clustering AlgorithmSuchy, Dawid; Siminski, Krzysztof*International Journal of Applied Mathematics and Computer Science, 2023, 33(2): 297-312.
- Adaptive Density-Based Spatial Clustering for Massive Data AnalysisCai, Zihao; Wang, Jian; He, Kejing*IEEE Access, 2020, 8: 23346-23358.被引 11
