Genetic Programming for Kernel-based Learning with Co-evolving Subsets Selection

Details Genetic Programming for Kernel-based Learning with Co-evolving Subsets Selection Genetic Programming for Kernel-based Learning with Co-evolving Subsets Selection

2006-11-27

arxiv.org/abs/cs/0611135v1

Dans PPSN'06, 4193 (2006) 1008-1017

Computer Science

Artificial Intelligence

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Genetic Programming for Kernel-based Learning with Co-evolving Subsets Selection does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Genetic Programming for Kernel-based Learning with Co-evolving Subsets Selection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Genetic Programming for Kernel-based Learning with Co-evolving Subsets Selection will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-23250