Particle swarm optimisation of multiple classifier systems

  • Authors:

  • Martin Macaš;Bogdan Gabrys;Dymitr Ruta;Lenka Lhotská

  • Affiliations:

  • Czech Technical University in Prague, Prague, Czech Republic;Bournemouth University, Computational Intelligence Research Group, School of Design, Engineering and Computing, Poole, Dorset, United Kingdom;British Telecom, Ipswich, UK;Czech Technical University in Prague, Prague, Czech Republic

  • Venue:
  • IWANN'07 Proceedings of the 9th international work conference on Artificial neural networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present application of various versions of the particle swarm optimization method (PSO) in the process of generation of multiple-classifier systems (MCS). While some of the investigated optimisation problems naturally lend themselves to the type of optimisation for which PSO is most suitable we present some other applications requiring non-standard representation of the particles as well as handling of constraints in the optimisation process. In the most typical optimisation case the continuous version of PSO has been successfully applied for the optimization of a soft-linear combiner. On the other hand, one of the adapted binary versions of PSO has been shown to work well in the case of multi-stage organization of majority voting (MOMV), where the search dimension is high and the local search techniques can often get stuck in local optima. All three presented PSO based methods have been tested and compared to each other and to forward search and stochastic hillclimber for five real-world non-trivial datasets.