2190 search results - page 69 / 438 » Learning with the Set Covering Machine |
ICML
2005
IEEE
14 years 9 months 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...
MLG
2007
Springer
14 years 3 months ago
2007
Springer
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
ICML
2004
IEEE
14 years 9 months ago
2004
IEEE
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
COLT
2008
Springer
13 years 10 months ago
2008
Springer
We consider the question of why modern machine learning methods like support vector machines outperform earlier nonparametric techniques like kNN. Our approach investigates the lo...
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
We state and analyze the first active learning algorithm which works in the presence of arbitrary forms of noise. The algorithm, A2 (for Agnostic Active), relies only upon the ass...