z-logo
open-access-imgOpen Access
DP-Dip: A skinny method for estimating the number and center of clusters
Author(s) -
Shuaijing Xu,
Rongfang Bie,
Liangchi Li,
Yuqi Yang
Publication year - 2018
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2018.03.035
Subject(s) - merge (version control) , computer science , cluster analysis , cluster (spacecraft) , recursion (computer science) , algorithm , data mining , artificial intelligence , parallel computing , programming language
Multi-scales data containing structures at different scales of shape and density is very common in both synthetic and real world. However, it is a big problem to cluster this kind of data accurately. Choosing an appropriate clustering number is the first step, important and not easy. In this paper, we propose a skinny method, DP-Dip, to estimate the number of clusters. Different from many popular methods, DP-Dip does not make any assumptions about data distribution and only admit one assumption: each cluster is a unimodal distribution. Besides, the method never perform complicated formulas and calculations but employ recursion until the final numbers are determined. Specifically, this algorithm firstly finds the density peaks to input the initial numbers, then splits some clusters according to the modality-testing result, finally merge some clusters if they should be combined.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom