DIVERSE DEPICTION OF PARTICLE SWARM OPTIMIZATION FOR DOCUMENT CLUSTERING
Abstract
vioft2nntf2t|tblJournal|Abstract_paper|0xf4ffd47604000000ff0e000001000400
Document clustering algorithms play an important task towards the goal of organizing huge amounts of documents into a small number of significant clusters. Traditional clustering algorithms will search only a small sub-set of possible clustering and as a result, there is no guarantee that the solution found will be optimal. This paper presents different representation of particle in Particle Swarm Optimization (PSO) for document clustering. Experiments results are examined with document corpus. It demonstrates that the Discrete PSO algorithm statistically outperforms the Binary PSO and Simple PSO for document Clustering.

Authors
K. Premalatha, A.M. Natarajan
Bannari Amman Institute of Technology, Tamil Nadu, India

Keywords
Particle Swarm Optimization, Document Clustering, Inertia Weight, Constriction Factor, Swarm Intelligence
Yearly Full Views
JanuaryFebruaryMarchAprilMayJuneJulyAugustSeptemberOctoberNovemberDecember
000000000000
Published By :
ICTACT
Published In :
ICTACT Journal on Soft Computing
( Volume: 1 , Issue: 3 , Pages: 125 - 130 )
Date of Publication :
January 2011
Page Views :
125
Full Text Views :

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.