Personal tools
You are here: Home Publications Bounds on the Generalization Performance of Kernel Machines Ensembles
Document Actions

T. Evgeniou, L. Perez-Breva, M. Pontil, and T. Poggio (2000)

Bounds on the Generalization Performance of Kernel Machines Ensembles

In: International Conference on Machine Learning.

We study the problem of learning using combinations of machines. In particular we present new theoretical bounds on the generalization performance of voting ensembles of kernel machines. Special cases considered are bagging and Support Vector Machines. We present experimental results supporting the theoretical bounds, and describe characteristics of kernel machines ensembles suggested from the experimental findings. We also show how such ensembles can be used for fast training with very large datasets.

by admin last modified 2007-01-31 11:08

Powered by Plone CMS, the Open Source Content Management System