Clustering by detecting skeletal structure and identifying density fluctuation

Abstract

Clustering is one of the most important techniques for unsupervised learning, it tries to divide points into different clusters without any priori knowledge of data. Therefore, several criterions for clustering algorithm are as follows: 1. Handling clusters with arbitrary shape and various density; 2. Finding cluster centers automatically; 3. Low parameter sensitivity and computational complexity. In this context, a novel algorithm namely clustering by detecting skeletal structure and identifying density fluctuation (CSSDF) was presented. In CSSDF, an efficient strategy based on density and local information of neighborhood is firstly proposed to detect the skeletal structure, which can collect the local information and identify the rough distribution of data. With the identified distribution information, a method takes expanded neighborhood and density fluctuation into consideration is proposed to further collect global information of data, which can assign all skeleton points and find cluster centers. To sum up, CSSDF can not only discover the underlying structure of data regardless of its’ distribution, but also ensure the correct assignment of all skeleton points and thus lead to a satisfying clustering performance. In addition, the computational complexity of the proposed approach is $O\left(\mathrm{nlogn}\right)$, which makes it possible to deal with some large clustering problem.