1640 search results - page 79 / 328 » Conditional Independence Trees |
156
click to vote
DATAMINE
1999
15 years 2 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
104
Voted
ICML
2005
IEEE
16 years 3 months ago
2005
IEEE
We examine the relationship between the predictions made by different learning algorithms and true posterior probabilities. We show that maximum margin methods such as boosted tre...
103
Voted
ISMIR
2005
Springer
15 years 8 months ago
2005
Springer
Finding multiple occurrences of themes and patterns in music can be hampered due to polyphonic textures. This is caused by the complexity of music that weaves multiple independent...
126
Voted
AI
2002
Springer
15 years 2 months ago
2002
Springer
This paper provides algorithms that use an information-theoretic analysis to learn Bayesian network structures from data. Based on our three-phase learning framework, we develop e...
131
click to vote
PKDD
2009
Springer
15 years 9 months ago
2009
Springer
We consider causally sufficient acyclic causal models in which the relationship among the variables is nonlinear while disturbances have linear effects, and show that three princi...