Fast Dimension-based Partitioning and Merging clustering algorithm

• Published in: Applied soft computing Vol. 36; pp. 143 - 151
• Main Authors: Ghanem, Tamer F., Elkilani, Wail S., Abdelkader, Hatem M., Hadhoud, Mohiy M.
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01-11-2015
• Subjects: Clustering; Density-based clustering; Subspace clustering; Subspace clustering; Clustering; Density-based clustering
• ISSN: 1568-4946; 1872-9681
• DOI: 10.1016/j.asoc.2015.05.049

•This research introduces extremely fast and scalable clustering algorithm.•The proposed algorithm detects automatically clusters number.•Furthermore, this algorithm uses three insensitive tuning parameters.
Clustering multi-dense large scale high dimensional numeric datasets is a challenging task duo to high time complexity of most clustering algorithms. Nowadays, data collection tools produce a large amount of data. So, fast algorithms are vital requirement for clustering such data. In this paper, a fast clustering algorithm, called Dimension-based Partitioning and Merging (DPM), is proposed. In DPM, first, data is partitioned into small dense volumes during the successive processing of dataset dimensions. Then, noise is filtered out using dimensional densities of the generated partitions. Finally, merging process is invoked to construct clusters based on partition boundary data samples. DPM algorithm automatically detects the number of data clusters based on three insensitive tuning parameters which decrease the burden of its usage. Performance evaluation of the proposed algorithm using different datasets shows its fastness and accuracy compared to other clustering competitors.