Adaptive Threshold Based Clustering A Deterministic Partitioning Approach

摘要

Partitioning-based clustering methods have various challenges especially user-defined parameters and sensitivity to initial seed selections. K-means is most popular partitioning based method while it is sensitive to outlier, generate non-overlap cluster and non-deterministic in nature due to its sensitivity to initial seed selection. These limitations are regarded as promising research directions. In this study, a deterministic approach which do not requires user defined parameters during clustering; can generate overlapped and non-overlapped clusters and detect outliers has been proposed. Here, a minimum support value has been adopted from association rule mining to improve the clustering results. Further, the improved approach has been analysed on artificial and real datasets. The results demonstrated that datasets are well clustered with this approach too and it achieved success to generate almost same number of clusters as present in real datasets.