摘要
Density-based spatial clustering of applications with noise (DBSCAN) is a commonly known and used algorithm for data clustering. It applies a density-based approach and can produce clusters of any shape. However, it has a drawback-its worst-case computational complexity is O(n(2)) with regard to the number of data items n. The paper presents GrDBSCAN: a granular modification of DBSCAN with reduced complexity. The proposed GrDBSCAN first granulates data into fuzzy granules and then runs density-based clustering on the resulting granules. The complexity of GrDBSCAN is linear with regard to the input data size and higher only for the number of granules. That number is, however, a parameter of the GrDBSCAN algorithm and is (significantly) lower than that of input data items. This results in shorter clustering time than in the case of DBSCAN. The paper is accompanied by numerical experiments. The implementation of GrDBSCAN is freely available from a public repository.
学科与关键词
- A Self-Adaptive Grey DBSCAN Clustering MethodLu, Shizhan; Cheng, Longsheng*; Lu, Zudi; Huang, Qifa; Khan, Bilal AhmedJournal of Grey System, 2022, 34(4): 97-109.
- KNN-BLOCK DBSCAN: Fast Clustering for Large-Scale DataChen, Yewang; Zhou, Lida; Pei, Songwen*; Yu, Zhiwen*; Chen, Yi; Liu, Xin; Du, Jixiang; Xiong, NaixueIEEE Transactions on Systems Man Cybernetics-Systems, 2021, 51(6): 3939-3953.被引 90
- 一种基于高斯分布的自适应DBSCAN算法陈刚; 刘秉权; 吴岩微电子学与计算机, 2013, (03): 27.
