Sciweavers

995 search results - page 74 / 199
» Learning Useful Horn Approximations
Sort
View
NIPS
2008
13 years 11 months ago
Global Ranking Using Continuous Conditional Random Fields
This paper studies global ranking problem by learning to rank methods. Conventional learning to rank methods are usually designed for `local ranking', in the sense that the r...
Tao Qin, Tie-Yan Liu, Xu-Dong Zhang, De-Sheng Wang...
ICML
2007
IEEE
14 years 10 months ago
Most likely heteroscedastic Gaussian process regression
This paper presents a novel Gaussian process (GP) approach to regression with inputdependent noise rates. We follow Goldberg et al.'s approach and model the noise variance us...
Kristian Kersting, Christian Plagemann, Patrick Pf...
COLT
2003
Springer
14 years 3 months ago
Maximum Margin Algorithms with Boolean Kernels
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...
Roni Khardon, Rocco A. Servedio
JCSS
2008
138views more  JCSS 2008»
13 years 10 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
RSKT
2009
Springer
14 years 4 months ago
Learning Optimal Parameters in Decision-Theoretic Rough Sets
A game-theoretic approach for learning optimal parameter values for probabilistic rough set regions is presented. The parameters can be used to define approximation regions in a p...
Joseph P. Herbert, Jingtao Yao