4930 search results - page 298 / 986 » Learning minimal abstractions |
182
Voted
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
200
Voted
ICALT
2006
IEEE
16 years 23 days ago
2006
IEEE
All books entitled “Learn … with 1000 exercises” have in common the same basic principle. They aim to supply enough material to students so that they may better understand t...
167
Voted
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
The goal of Reinforcement learning (RL) is to maximize reward (minimize cost) in a Markov decision process (MDP) without knowing the underlying model a priori. RL algorithms tend ...
211
click to vote
ICMLA
2003
15 years 8 months ago
2003
– Discretization is a process of converting a continuous attribute into an attribute that contains small number of distinct values. One of the major reasons for discretizing an a...
200
click to vote
TMI
2008
15 years 6 months ago
2008
In this paper, a hybrid discriminative/generative model for brain anatomical structure segmentation is proposed. The learning aspect of the approach is emphasized. In the discrimin...