Hybridization of magnetic charge system search and particle swarm optimization for efficient data clustering using neighborhood search strategy
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605469156 | ||
| 003 | CHVBK | ||
| 005 | 20210128100320.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20151201xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00500-015-1719-0 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00500-015-1719-0 | ||
| 245 | 0 | 0 | |a Hybridization of magnetic charge system search and particle swarm optimization for efficient data clustering using neighborhood search strategy |h [Elektronische Daten] |c [Y. Kumar, G. Sahoo] |
| 520 | 3 | |a Clustering is a popular data analysis technique, which is applied for partitioning of datasets. The aim of clustering is to arrange the data items into clusters based on the values of their attributes. Magnetic charge system search (MCSS) algorithm is a new meta-heuristic optimization algorithm inspired by the electromagnetic theory. It has been proved better than other meta-heuristics. This paper presents a new hybrid meta-heuristic algorithm by combining both MCSS and particle swarm optimization (PSO) algorithms, which is called MCSS-PSO, for partitional clustering problem. Moreover, a neighborhood search strategy is also incorporated in this algorithm to generate more promising solutions. The performance of the proposed MCSS-PSO algorithm is tested on several benchmark datasets and its performance is compared with already existing clustering algorithms such as K-means, PSO, genetic algorithm, ant colony optimization, charge system search, chaotic charge system search algorithm, and some PSO variants. From the experimental results, it can be seen that performance of the proposed algorithm is better than the other algorithms being compared and it can be effectively used for partitional clustering problem. | |
| 540 | |a Springer-Verlag Berlin Heidelberg, 2015 | ||
| 690 | 7 | |a Charged particles |2 nationallicence | |
| 690 | 7 | |a Clustering |2 nationallicence | |
| 690 | 7 | |a Particle swarm optimization |2 nationallicence | |
| 690 | 7 | |a Neighborhood search strategy |2 nationallicence | |
| 700 | 1 | |a Kumar |D Y. |u Department of Computer Science and Engineering, Birla Institute of Technology, Mesra, Ranchi, Jharkhand, India |4 aut | |
| 700 | 1 | |a Sahoo |D G. |u Department of Computer Science and Engineering, Birla Institute of Technology, Mesra, Ranchi, Jharkhand, India |4 aut | |
| 773 | 0 | |t Soft Computing |d Springer Berlin Heidelberg |g 19/12(2015-12-01), 3621-3645 |x 1432-7643 |q 19:12<3621 |1 2015 |2 19 |o 500 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00500-015-1719-0 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s00500-015-1719-0 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Kumar |D Y. |u Department of Computer Science and Engineering, Birla Institute of Technology, Mesra, Ranchi, Jharkhand, India |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Sahoo |D G. |u Department of Computer Science and Engineering, Birla Institute of Technology, Mesra, Ranchi, Jharkhand, India |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Soft Computing |d Springer Berlin Heidelberg |g 19/12(2015-12-01), 3621-3645 |x 1432-7643 |q 19:12<3621 |1 2015 |2 19 |o 500 | ||