Genetic programming for kernel-based learning with co-evolving subsets selection

  • Authors:
  • Christian Gagné;Marc Schoenauer;Michèle Sebag;Marco Tomassini

  • Affiliations:
  • Information Systems Institute, Université de Lausanne, Dorigny, Switzerland;Équipe TAO – INRIA Futurs / CNRS UMR 8623, LRI, Université Paris Sud, Orsay, France;Équipe TAO – INRIA Futurs / CNRS UMR 8623, LRI, Université Paris Sud, Orsay, France;Information Systems Institute, Université de Lausanne, Dorigny, Switzerland

  • Venue:
  • PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Support Vector Machines (SVMs) are well-established Machine Learning (ML) algorithms. They rely on the fact that i) linear learning can be formalized as a well-posed optimization problem; ii) non-linear learning can be brought into linear learning thanks to the kernel trick and the mapping of the initial search space onto a high dimensional feature space. The kernel is designed by the ML expert and it governs the efficiency of the SVM approach. In this paper, a new approach for the automatic design of kernels by Genetic Programming, called the Evolutionary Kernel Machine (EKM), is presented. EKM combines a well-founded fitness function inspired from the margin criterion, and a co-evolution framework ensuring the computational scalability of the approach. Empirical validation on standard ML benchmark demonstrates that EKM is competitive using state-of-the-art SVMs with tuned hyper-parameters.