Sciweavers

121 search results - page 8 / 25
» The Feature Selection Path in Kernel Methods
Sort
View
IJCNN
2007
IEEE
14 years 1 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot
JMLR
2010
185views more  JMLR 2010»
13 years 2 months ago
Multiple Kernel Learning on the Limit Order Book
Simple features constructed from order book data for the EURUSD currency pair were used to construct a set of kernels. These kernels were used both individually and simultaneously...
Tristan Fletcher, Zakria Hussain, John Shawe-Taylo...
WEBI
2009
Springer
14 years 1 months ago
Rank Aggregation Based Text Feature Selection
Filtering feature selection method (filtering method, for short) is a well-known feature selection strategy in pattern recognition and data mining. Filtering method outperforms ot...
Ou Wu, Haiqiang Zuo, Mingliang Zhu, Weiming Hu, Ju...
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 7 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor
ICML
2007
IEEE
14 years 8 months ago
Multiclass multiple kernel learning
In many applications it is desirable to learn from several kernels. "Multiple kernel learning" (MKL) allows the practitioner to optimize over linear combinations of kern...
Alexander Zien, Cheng Soon Ong