2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC) · 2017 · 15 citations · 18 references
ComputingData ScienceBig Data AnalyticsComputational GeometryData MiningCluster DetectionDensity EstimationBenchmark DatasetsCluster-based Anomaly DetectionClusteringData DistributionHigh-dimensional Data ClusteringHigh-dimensional Outlier Detection
The density peak clustering (DPC) algorithm is designed to quickly identify intricate-shaped clusters with high dimensionality by finding high-density peaks in a non-iterative manner and using only one threshold parameter. However, DPC has certain limitations in processing low-density data points because it only takes the global data density distribution into account. As such, DPC may confine in forming low-density data clusters, or in other words, DPC may fail in detecting anomalies and borderline points. In this paper, we analyze the limitations of DPC and propose a novel density peak clustering algorithm to better handle low-density clustering tasks. Specifically, our algorithm provides a better decision graph comparing to DPC for the determination of cluster centroids. Experimental results show that our algorithm outperforms DPC and other clustering algorithms on the benchmarking datasets.
18
A density-based algorithm for discovering clusters in large spatial Databases with Noise
Martin Ester, Hans‐Peter Kriegel, Jörg Sander et al. · 1996 · 19.1K citations
Clustering by Passing Messages Between Data Points
Brendan J. Frey, Delbert Dueck · Science · 2007 · 6.9K citations
Clustering by fast search and find of density peaks
Álex Rodríguez, Alessandro Laio · Science · 2014 · 5K citations
Computing, Astronomy, Bioinformatics +13
Subspace clustering for high dimensional data
Lance Parsons, Ehtesham Haque, Huan Liu · ACM SIGKDD Explorations Newsletter · 2004 · 1.3K citations