Fast and Effective Classification using Parallel and Multi-start PSO
PSO being a swarm based algorithm, can efficiently lend itself to operate on huge data. This article presents a technique that performs classification using PSO. An initial discussion is carried out describing PSO as a classifier. Three variants of PSO are proposed here; the first variant hybridizes PSO using Simulated Annealing and the next two variants parallelizes PSO. The two parallel variants of PSO are; Parallel PSO and Multistart PSO. Parallel PSO operates by parallelizing the operation of each of the particles and Multistart PSO runs several normal versions of PSO embedded with Simulated Annealing in parallel. The multi-start version is implemented to eliminate the problem of local optima. Experiments were conducted to identify the scalability and efficiency of PSO and its variants on huge and imbalanced data.
Year of publication: |
2018
|
---|---|
Authors: | Balasaraswathi M ; Kalpana B |
Published in: |
Journal of Information Technology Research (JITR). - IGI Global, ISSN 1938-7865, ZDB-ID 2403406-X. - Vol. 11.2018, 2 (01.04.), p. 13-30
|
Publisher: |
IGI Global |
Subject: | Classification | Data Imbalance | Parallelization | PSO | Simulated Annealing |
Saved in:
Saved in favorites
Similar items by subject
-
Data imbalance in autism pre-diagnosis classification systems : an experimental study
Abdelhamid, Neda, (2020)
-
Multi-class random forest model to classify wastewater treatment imbalanced data
Distefano, Veronica, (2024)
-
A hybrid PSO-SA algorithm for the travelling tournament problem
Tajbakhsh, Alireza, (2012)
- More ...