1393 search results - page 19 / 279 » Machine Learning by Function Decomposition |
103
click to vote
ICML
2001
IEEE
16 years 17 days ago
2001
IEEE
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
100
click to vote
JMLR
2010
14 years 6 months ago
2010
The GPML toolbox provides a wide range of functionality for Gaussian process (GP) inference and prediction. GPs are specified by mean and covariance functions; we offer a library ...
106
click to vote
ICML
2007
IEEE
16 years 17 days ago
2007
IEEE
The advances in kernel-based learning necessitate the study on solving a large-scale non-sparse positive definite linear system. To provide a deterministic approach, recent resear...
LFCS
1992
Springer
15 years 3 months ago
1992
Springer
A generator program for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of ...
ICML
2005
IEEE
16 years 17 days ago
2005
IEEE
We analyze skewing, an approach that has been empirically observed to enable greedy decision tree learners to learn "difficult" Boolean functions, such as parity, in the...