返回
Piecemeal Clustering: a Self-Driven Data Clustering Algorithm
DOI:10.1109/ACCESS.2022.3228238.png)
摘要
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.
Keyword:
Data clustering
agglomerative clustering
density-based clustering
unsupervised learning
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Comparative Analysis Review of Pioneering DBSCAN and Successive Density-Based Clustering Algorithms
IEEE ACCESS
IF3.6
A novel hierarchical clustering algorithm with merging strategy based on shared subordinates
APPLIED INTELLIGENCE
IF3.5
Maritime Traffic Route Detection Framework Based on Statistical Density Analysis From AIS Data Using a Clustering Algorithm
IEEE ACCESS
IF3.6
RNN-DBSCAN: A Density-Based Clustering Algorithm Using Reverse Nearest Neighbor Density EstimatesRnn-dbscan: 使用反向最近邻密度估计的基于密度的聚类算法

