This paper describes two versions of a novel approach to developing binary classifiers, based on two evolutionary computation paradigms: cellular programming and genetic programming. Such an approach achieves high computation efficiency both during evolution and at runtime. Evolution speed is optimized by allowing multiple solutions to be computed in parallel. Runtime performance is optimized explicitly using parallel computation in the case of cellular programming or implicitly taking advantage of the intrinsic parallelism of bitwise operators on standard sequential architectures in the case of genetic programming. The approach was tested on a digit recognition problem and compared with a reference classifier.
Evolving binary classifiers through parallel computation of multiple fitness cases / Cagnoni, Stefano; Bergenti, Federico; Mordonini, Monica; Adorni, G.. - In: IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS. - ISSN 1083-4419. - 35:3(2005), pp. 548-555. [10.1109/TSMCB.2005.846671]
Evolving binary classifiers through parallel computation of multiple fitness cases
CAGNONI, Stefano;BERGENTI, Federico;MORDONINI, Monica;
2005-01-01
Abstract
This paper describes two versions of a novel approach to developing binary classifiers, based on two evolutionary computation paradigms: cellular programming and genetic programming. Such an approach achieves high computation efficiency both during evolution and at runtime. Evolution speed is optimized by allowing multiple solutions to be computed in parallel. Runtime performance is optimized explicitly using parallel computation in the case of cellular programming or implicitly taking advantage of the intrinsic parallelism of bitwise operators on standard sequential architectures in the case of genetic programming. The approach was tested on a digit recognition problem and compared with a reference classifier.File | Dimensione | Formato | |
---|---|---|---|
01430838.pdf
non disponibili
Tipologia:
Documento in Post-print
Licenza:
Creative commons
Dimensione
312.19 kB
Formato
Adobe PDF
|
312.19 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.