Fast Density Estimation for Density-based Clustering Methods
Difei Cheng, Ruihang Xu, Bo Zhang, Ruinan Jin

TL;DR
This paper introduces FPCAP, a fast principal component analysis pruning method that accelerates density-based clustering by reducing redundant distance calculations, especially in high-dimensional data.
Contribution
The paper presents FPCAP, a novel algorithm that enhances density-based clustering efficiency by integrating PCA-based pruning, effective in high-dimensional scenarios.
Findings
Significant reduction in computation time on benchmark datasets.
Effective in processing high-dimensional data.
Improved clustering efficiency with IDBSCAN.
Abstract
Density-based clustering algorithms are widely used for discovering clusters in pattern recognition and machine learning since they can deal with non-hyperspherical clusters and are robustness to handle outliers. However, the runtime of density-based algorithms are heavily dominated by finding fixed-radius near neighbors and calculating the density, which is time-consuming. Meanwhile, the traditional acceleration methods using indexing technique such as KD tree is not effective in processing high-dimensional data. In this paper, we propose a fast region query algorithm named fast principal component analysis pruning (called FPCAP) with the help of the fast principal component analysis technique in conjunction with geometric information provided by principal attributes of the data, which can process high-dimensional data and be easily applied to density-based methods to prune unnecessary…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Clustering Algorithms Research · Data Management and Algorithms · Bayesian Methods and Mixture Models
MethodsPruning
