Name
Abstract | ||
|---|---|---|
Clustering has been the most popular method for data exploration. Clustering is partitioning the data set into sub-partitions based on some measures say the distance measure, each partition has its own significant information. There are a number of algorithms explored for this purpose, one such algorithm is the Particle Swarm Optimization(PSO) which is a population based heuristic search technique derived from swarm intelligence. in this paper we present an improved version of the Particle Swarm Optimization where, each feature of the data set is given significance accordingly by adding some random weights, which also minimizes the distortions in the dataset if any. the performance of the above proposed algorithm is evaluated using some benchmark datasets from Machine Learning Repository. the experimental results shows that our proposed methodology performs significantly better than the previously performed experiments. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/ICGEC.2012.94 | Genetic and Evolutionary Computing |
Keywords | DocType | ISSN |
particle swarm optimization,feature weighting,proposed methodology,benchmark datasets,heuristic search technique,distance measure,data exploration,machine learning repository,proposed algorithm,random processes | Conference | 1949-4653 |
ISBN | Citations | PageRank |
978-1-4673-2138-9 | 0 | 0.34 |
References | Authors | |
3 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| K. P. Swetha | 1 | 1 | 1.03 |
| V. Susheela Devi | 2 | 47 | 9.21 |