1683 search results - page 32 / 337 » Learning with Mixtures of Trees |
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
The four-level pachinko allocation model (PAM) (Li & McCallum, 2006) represents correlations among topics using a DAG structure. It does not, however, represent a nested hiera...
ALT
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We describe and analyze an algorithm for predicting a sequence of n-dimensional binary vectors based on a set of experts making vector predictions in [0, 1]n . We measure...
COLT
2003
Springer
14 years 1 months 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...