157 search results - page 2 / 32 » icml 2007 |
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
We analyze a simple, Bellman-error-based approach to generating basis functions for valuefunction approximation. We show that it generates orthogonal basis functions that provably...
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
In this paper we present a novel algorithm, CarpeDiem. It significantly improves on the time complexity of Viterbi algorithm, preserving the optimality of the result. This fact ha...
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
We present a comprehensive suite of experimentation on the subject of learning from imbalanced data. When classes are imbalanced, many learning algorithms can suffer from the pers...
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
The paper presents a kernel for learning from ordered hypergraphs, a formalization that captures relational data as used in Inductive Logic Programming (ILP). The kernel generaliz...
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...