Index-based Solutions for Efficient Density Peaks Clustering

02/08/2020 ∙ by Zafaryab Rasool, et al. ∙ 0

Density Peaks Clustering (DPC), a novel density-based clustering approach, has received considerable attention of the research community primarily due to its simplicity and less parameter requirement. However, the resultant clusters obtained using DPC are influenced by its sensitive parameter dc which depends upon data distribution and requirements of different users. Besides, the original DPC algorithm requires visiting a large number of objects making it slow. To this end, this paper investigates index-based solutions for DPC. Specifically, we propose two list-based index methods viz. (i) a simple List Index and (ii) an advanced Cumulative Histogram Index. Efficient query algorithms are proposed for these indices which significantly avoids irrelevant comparisons at the cost of space. To remedy this for memory-constrained systems, we further introduce an approximate solution to the above indices which allows substantial reduction in the space cost provided slight inaccuracies are admissible. Furthermore, owing to considerably lower memory requirements of existing tree-based index structures, we also present effective pruning techniques and efficient query algorithms to support DPC using the popular Quadtree Index and R-tree Index. Finally, we practically evaluate all the above indices and present the findings and results, obtained from a set of extensive experiments on six synthetic and real datasets. The experimental insights obtained help to guide in selecting the befitting index.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 2

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.