4930 search results - page 160 / 986 » Learning minimal abstractions |
109
Voted
ECML
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Existing relational learning approaches usually work on complete relational data, but real-world data are often incomplete. This paper proposes the MGDA approach to learn...
ECML
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. While direct, model-free reinforcement learning often performs better than model-based approaches in practice, only the latter have yet supported theoretical guarantees f...
96
Voted
ICANN
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Many applications of machine learning involve sparse highdimensional data, where the number of input features is (much) larger than the number of data samples, d n. Predi...
86
Voted
MLDM
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. This paper proposes a general local learning framework to effectively alleviate the complexities of classifier design by means of “divide and conquer” principle and ...
108
click to vote
COLT
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We develop a new error bound for transductive learning algorithms. The slack term in the new bound is a function of a relaxed notion of transductive stability, which meas...