.png){kind=icon}
Return
Piecemeal Clustering: a Self-Driven Data Clustering Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2022.3228238.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Various approaches have been discussed in the literature for the clustering of data, such as partitioning, hierarchical, and machine learning methods. Most of the approaches require some prior knowledge about the clusters, such as their total number. Furthermore, some previous algorithms are not robust enough to process higher-dimensional data or require a large amount of memory for computations. We propose, herein, a data clustering algorithm, Piecemeal Clustering, that successfully clusters data without prior knowledge of the number of clusters. The proposed clustering algorithm uses the similarity and density of the data to identify the number of clusters in the data set and works with both low- and high-dimensional data. We demonstrate the power of the proposed Piecemeal Clustering algorithm with two real-world data sets. It is found that the proposed algorithm outperforms seven other state-of-the-art algorithms on both of these data sets.
Keywords:
Data clustering
agglomerative clustering
density-based clustering
unsupervised learning
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
ShareSaveComparative Analysis Review of Pioneering DBSCAN and Successive Density-Based Clustering Algorithms.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAIShareSaveShareSaveA novel hierarchical clustering algorithm with merging strategy based on shared subordinatesAPPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
ShareSaveMaritime Traffic Route Detection Framework Based on Statistical Density Analysis From AIS Data Using a Clustering AlgorithmIEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAIShareSaveRNN-DBSCAN: A Density-Based Clustering Algorithm Using Reverse Nearest Neighbor Density EstimatesOAAI
OAAIShareSave
View more