1283 search results - page 15 / 257 » Learning Voting Trees |
COLT
2003
Springer
14 years 23 days ago
2003
Springer
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...
ICGI
2000
Springer
13 years 11 months ago
2000
Springer
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
IJCAI
1989
13 years 8 months ago
1989
A new decision tree learning algorithm called IDX is described. More general than existing algorithms, IDX addresses issues of decision tree quality largely overlooked in the arti...
ECML
2007
Springer
14 years 1 months ago
2007
Springer
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
ICIP
2001
IEEE
14 years 9 months ago
2001
IEEE
The paper proposes the application of majority voting on the output of several support vector machines in order to select the most suitable learning machine for frontal face detec...