2010
DOI: 10.1007/978-3-642-17563-3_73
|View full text |Cite
|
Sign up to set email alerts
|

Effective Document Clustering with Particle Swarm Optimization

Abstract: Abstract. The paper presents a comparative analysis of K-means and PSO based clustering performances for text datasets. The dimensionality reduction techniques like Stop word removal, Brill's tagger algorithm and mean Tf-Idf are used while reducing the size of dimension for clustering. The results reveal that PSO based approaches find better solution compared to K-means due to its ability to evaluate many cluster centroids simultaneously in any given time unlike K-means.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…In a recent study [46], some general directives to choose the good combination are propsed as: Swarm size M in [47,48], with a preference for 20 particles, cognitive parameter 1 in [0,1], with a preference for 0.7, social parameter 2~1 .5 with a preference for 1.43. But nevertheless, different parameter values may generate better or worse outcomes depending on the problem, thus the best way to tuning is to make a sensitivity analysis in the context of the problem description.…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…In a recent study [46], some general directives to choose the good combination are propsed as: Swarm size M in [47,48], with a preference for 20 particles, cognitive parameter 1 in [0,1], with a preference for 0.7, social parameter 2~1 .5 with a preference for 1.43. But nevertheless, different parameter values may generate better or worse outcomes depending on the problem, thus the best way to tuning is to make a sensitivity analysis in the context of the problem description.…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…Dash et al (2010) used the hybrid clustering algorithm to find the centroids of a user specified number of clusters, where each cluster groups similar patterns. Killani et al (2010) present a comparative analysis of Kmeans and PSO based clustering performances for text datasets. The result in the work shows the PSO based approaches find better solution compared to K-means due to its ability to evaluate many cluster centroids simultaneously in any given time unlike K-means.…”
Section: Optimization Algorithm In Clusteringmentioning
confidence: 99%