Sciweavers

161 search results - page 30 / 33
» Least Squares SVM for Least Squares TD Learning
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
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 months ago
Learning to rank with combinatorial Hodge theory
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye
AI
2002
Springer
13 years 7 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
BMCBI
2007
91views more  BMCBI 2007»
13 years 7 months ago
A machine learning approach for the identification of odorant binding proteins from sequence-derived properties
Background: Odorant binding proteins (OBPs) are believed to shuttle odorants from the environment to the underlying odorant receptors, for which they could potentially serve as od...
Ganesan Pugalenthi, E. Ke Tang, Ponnuthurai N. Sug...
ICML
2010
IEEE
13 years 8 months ago
Projection Penalties: Dimension Reduction without Loss
Dimension reduction is popular for learning predictive models in high-dimensional spaces. It can highlight the relevant part of the feature space and avoid the curse of dimensiona...
Yi Zhang 0010, Jeff Schneider