1209 search results - page 28 / 242 » Semi-Supervised Learning with Trees |
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
Tree edit distance is one of the most frequently used distance measures for comparing trees. When using the tree edit distance, we need to determine the cost of each operation, bu...
COLT
2003
Springer
14 years 27 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 ...
SIGKDD
2000
13 years 7 months ago
2000
The MP13 method is best summarized as recognition based on voting decision trees using "pipes" in potential space. Keywords Voting; Decision Tree; Potential Space
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...