1640 search results - page 68 / 328 » Conditional Independence Trees |
120
Voted
AAAI
1996
15 years 3 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
124
click to vote
CADE
2006
Springer
16 years 2 months ago
2006
Springer
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
126
click to vote
ICDIM
2007
IEEE
15 years 9 months ago
2007
IEEE
Learning classifiers has been studied extensively the last two decades. Recently, various approaches based on patterns (e.g., association rules) that hold within labeled data hav...
130
Voted
ALT
2010
Springer
14 years 11 months ago
2010
Springer
We focus on the estimation of a probability distribution over a set of trees. We consider here the class of distributions computed by weighted automata - a strict generalization of...
123
click to vote
NIPS
2004
15 years 4 months ago
2004
In this paper, we explore the use of Random Forests (RFs) in the structured language model (SLM), which uses rich syntactic information in predicting the next word based on words ...