IQRAM: a high dimensional data clustering technique
Dharmveer Singh Rajput, Pramod Kumar Singh, Mahua Bhattacharya
Abstract
Dharmveer Singh Rajput, Pramod Kumar Singh, Mahua Bhattacharya
Abstract
Clustering is a process of partitioning data objects into different groups according to some similarity or dissimilarity measure, e.g., distance criterion. The distance criterion fails to group the objects as all the objects are almost equidistant in high dimensional dataset, hence the distance criterion becomes meaningless. In the literature, numerous clustering algorithms are presented for clustering high dimensional dataset, which select relevant dimensions in high dimensional dataset and perform clustering of the objects on the selected dimensions. As these clustering algorithms produce different clustering results on the same dataset, there is confusion in the selection of clustering algorithm for better clustering of high dimensional dataset. In this paper, we present a comparative study of conventional feature selection based clustering algorithms and propose a new feature selection based clustering method IQRAM (inter quartile range and median based clustering of high dimensional dataset) for clustering high dimensional dataset. We perform our experiments on two real datasets and analyse the clustering results using five well-known clustering quality measures and student’s t-test. The qualitative results show that IQRAM outperform ten competitive clustering algorithms.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Clustering is a process of partitioning data objects into different groups according to some similarity or dissimilarity measure, e.g., distance criterion. The distance criterion fails to group the objects as all the objects are almost equidistant in high dimensional dataset, hence the distance criterion becomes meaningless. In the literature, numerous clustering algorithms are presented for clustering high dimensional dataset, which select relevant dimensions in high dimensional dataset and perform clustering of the objects on the selected dimensions. As these clustering algorithms produce different clustering results on the same dataset, there is confusion in the selection of clustering algorithm for better clustering of high dimensional dataset. In this paper, we present a comparative study of conventional feature selection based clustering algorithms and propose a new feature selection based clustering method IQRAM (inter quartile range and median based clustering of high dimensional dataset) for clustering high dimensional dataset. We perform our experiments on two real datasets and analyse the clustering results using five well-known clustering quality measures and student’s t-test. The qualitative results show that IQRAM outperform ten competitive clustering algorithms.
Key concepts: Cluster analysis, Correlation clustering, CURE data clustering algorithm, Clustering high-dimensional data, Fuzzy clustering, Single-linkage clustering, Data mining, Computer science