We study the problem of learning a kernel which minimizes a regularization error functional such as that used in regularization networks or support vector machines. We consider thi...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...
Abstract. Mainstream surrogate approaches for multi-objective problems build one approximation for each objective. Mono-surrogate approaches instead aim at characterizing the Paret...
Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like t...
Abstract. In this paper we show a novel application of string kernels: that is to the problem of recognising famous pianists from their style of playing. The characterstics of perf...
Craig Saunders, David R. Hardoon, John Shawe-Taylo...