Michigan Particle Swarm Optimization for Prototype Reduction in Classification Problems Articles uri icon

publication date

  • May 2009

start page

  • 239

end page

  • 257

issue

  • 3

volume

  • 27

international standard serial number (ISSN)

  • 0288-3635

electronic international standard serial number (EISSN)

  • 1882-7055

abstract

  • This paper presents a new approach to Particle Swarm Optimization, called Michigan Approach PSO (MPSO), and its application to continuous classification problems as a Nearest Prototype (NP) classifier. In Nearest Prototype classifiers, a collection of prototypes has to be found that accurately represents the input patterns. The classifier then assigns classes based on the nearest prototype in this collection. The MPSO algorithm is used to process training data to find those prototypes. In the MPSO algorithm each particle in a swarm represents a single prototype in the solution and it uses modified movement rules with particle competition and cooperation that ensure particle diversity. The proposed method is tested both with artificial problems and with real benchmark problems and compared with several algorithms of the same family. Results show that the particles are able to recognize clusters, find decision boundaries and reach stable situations that also retain adaptation potential. The MPSO algorithm is able to improve theaccuracy of 1-NN classifiers, obtains results comparable to the best amongother classifiers, and improves the accuracy reported in literature for one ofthe problems.