RECOME: a New Density-Based Clustering Algorithm Using Relative KNN Kernel Density

2 Nov 2016  ·  Yangli-ao Geng, Qingyong Li, Rong Zheng, Fuzhen Zhuangz, Ruisi He ·

Discovering clusters from a dataset with different shapes, density, and scales is a known challenging problem in data clustering. In this paper, we propose the RElative COre MErge (RECOME) clustering algorithm... The core of RECOME is a novel density measure, i.e., Relative $K$ nearest Neighbor Kernel Density (RNKD). RECOME identifies core objects with unit RNKD, and partitions non-core objects into atom clusters by successively following higher-density neighbor relations toward core objects. Core objects and their corresponding atom clusters are then merged through $\alpha$-reachable paths on a KNN graph. Furthermore, we discover that the number of clusters computed by RECOME is a step function of the $\alpha$ parameter with jump discontinuity on a small collection of values. A jump discontinuity discovery (JDD) method is proposed using a variant of the Dijkstra's algorithm. RECOME is evaluated on three synthetic datasets and six real datasets. Experimental results indicate that RECOME is able to discover clusters with different shapes, density and scales. It achieves better clustering results than established density-based clustering methods on real datasets. Moreover, JDD is shown to be effective to extract the jump discontinuity set of parameter $\alpha$ for all tested dataset, which can ease the task of data exploration and parameter tuning. read more

PDF Abstract
No code implementations yet. Submit your code now




  Add Datasets introduced or used in this paper