A novel density-based clustering algorithm using nearest neighbor graph. (June 2020)

• Record Type: Journal Article
• Authors: Li, Hao; Liu, Xiaojie; Li, Tao; Gan, Rundong
• Is Part Of: Pattern recognition. Volume 102(2020:Jun.)
• Publication Date: 2020-06
• Subjects: Density-based clustering -- Nearest neighbor graph -- DBSCAN; Pattern perception -- Periodicals; Perception des structures -- Périodiques; Patroonherkenning; 006.4
• DOI: 10.1016/j.patcog.2020.107206
• Languages: English
• ISSNs: 0031-3203

Abstract

Highlights: Nearest neighbor graph can indicate the samples that lying within the local dense regions of dataset without any input parameter. A clustering algorithm named ADBSCAN is developed based on the nearest neighbor graph properties. Experiments on different types of datasets demonstrate the superior performance and the robust to parameters of ADBSCAN. Abstract: Density-based clustering has several desirable properties, such as the abilities to handle and identify noise samples, discover clusters of arbitrary shapes, and automatically discover of the number of clusters. Identifying the core samples within the dense regions of a dataset is a significant step of the density-based clustering algorithm. Unlike many other algorithms that estimate the density of each samples using different kinds of density estimators and then choose core samples based on a threshold, in this paper, we present a novel approach for identifying local high-density samples utilizing the inherent properties of the nearest neighbor graph (NNG). After using the density estimator to filter noise samples, the proposed algorithm ADBSCAN in which "A" stands for "Adaptive" performs a DBSCAN-like clustering process. The experimental results on artificial and real-world datasets have demonstrated the significant performance improvement over existing density-based clustering algorithms.