Unique Neighborhood Set Parameter Independent Density-Based Clustering With Outlier Detection

Machine learning algorithms such as clustering, classification, and regression typically require a set of parameters to be provided by the user before the algorithms can perform well. In this paper, we present parameter independent density-based clustering algorithms by utilizing two novel concepts for neighborhood functions which we term as unique closest neighbor and unique neighborhood set. We discuss two derivatives of the proposed parameter independent density-based clustering (PIDC) algorithms, termed PIDC-WO and PIDC-O. PIDC-WO has been designed for data sets that do not contain explicit outliers whereas PIDC-O provides very good performance even on data sets with the presence of outliers. PIDC-O uses a two-stage processing where the first stage identifies and removes outliers before passing the records to the second stage to perform the density-based clustering. The PIDC algorithms are extensively evaluated and compared with other well-known clustering algorithms on several data sets using three cluster evaluation criteria (F-measure, entropy, and purity) used in the literature, and are shown to perform effectively both for the clustering and outlier detection objectives.