DOE OSTI · 938764
Dimensionality Reduction Particle Swarm Algorithm for High Dimensional Clustering
Abstract
The Particle Swarm Optimization (PSO) clustering algorithm can generate more compact clustering results than the traditional K-means clustering algorithm. However, when clustering high dimensional datasets, the PSO clustering algorithm is notoriously slow because its computation cost increases exponentially with the size of the dataset dimension. Dimensionality reduction techniques offer solutions that both significantly improve the computation time, and yield reasonably accurate clustering results in high dimensional data analysis. In this paper, we introduce research that combines different dimensionality reduction techniques with the PSO clustering algorithm in order to reduce the complexity of high dimensional datasets and speed up the PSO clustering process. We report significant improvements in total runtime. Moreover, the clustering accuracy of the dimensionality reduction PSO clustering algorithm is comparable to the one that uses full dimension space.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Cui, Xiaohui, ST Charles, Jesse Lee, Potok, Thomas E, Beaver, Justin M. 2008-01-01. Dimensionality Reduction Particle Swarm Algorithm for High Dimensional Clustering. https://searchnasa.com/record/osti%3A938764/dimensionality-reduction-particle-swarm-algorithm-for-high-dimensional-clustering
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.