arrow
返回

Piecemeal Clustering: a Self-Driven Data Clustering Algorithm

delete2022-01-01
delete2
delete
OA
AI
M
Md. Monjur Ul Hasan *
R
Reza Shahidi
D
Dennis Peters
L
Lesley James
G
Gosine, Ray
DOI:10.1109/ACCESS.2022.3228238delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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

期刊

IEEE Access 封面图
IEEE Access
IF:
3.6
论文数:
9.8W
被引数:
29.4W

机构

M
Memorial University Newfoundland
学者数:
8.0K
论文数: 7.8K
被引数: 64
引用论文

引用论文

err分享
err收藏
An approach for hyperspectral image classification by optimizing SVM using self organizing map
err2018-03-01
err55
PREAI
errJain, Deepak Kumar; Dubey, Surendra Bilouhan; Choubey, Rishin Kumar; Sinhal, Amit; Arjaria, Siddharth Kumar; Jain, Amar; Wang, Haoxiang
err分享
err收藏
学者 查看更多内容