Document Clustering using Particle Swarm Optimization

by Xiaohui Cui,, Thomas E. Potok, Paul Palathingal


Fast and high-quality document clustering algorithms play an important role in effectively navigating, summarizing, and organizing information. Recent studies have shown that partitional clustering algorithms are more suitable for clustering large datasets. However, the K-means algorithm, the most commonly used partitional clustering algorithm, can only generate a local optimal solution. In this paper, we present a Particle Swarm Optimization (PSO) document clustering algorithm. Contrary to the localized searching of the K-means algorithm, the PSO clustering algorithm performs a globalized search in the entire solution space. In the experiments we conducted, we applied the PSO, K-means and hybrid PSO clustering algorithm on four different text document datasets. The number of documents in the datasets ranges from 204 to over 800, and the number of terms ranges from over 5000 to over 7000. The results illustrate that the hybrid PSO algorithm can generate more compact clustering results than the Kmeans algorithm.

Read more

Download Publication

Access for Swarm Intelligence Symposium, 2005. SIS 2005. Proceedings 2005 IEEE subscribers only.

Publication Citation

Swarm Intelligence Symposium, 2005. SIS 2005. Proceedings 2005 IEEE 2005 pp 185-191
DOI: 10.1109/SIS.2005.1501621