5699 search results - page 3 / 1140 » Alternating model trees |
171
Voted
EGC
2009
Springer
14 years 10 months ago
2009
Springer
We present a new evaluation criterion for the induction of decision trees. We exploit a parameter-free Bayesian approach and propose an analytic formula for the evaluation of the p...
85
Voted
EJC
2010
15 years 23 days ago
2010
We study two enumeration problems for up-down alternating trees, i.e., rooted labelled trees T, where the labels v1, v2, v3, . . . on every path starting at the root of T satisfy v...
91
Voted
SIGCSE
2005
ACM
15 years 6 months ago
2005
ACM
Red-black trees and leftist heaps are classic data structures that are commonly taught in Data Structures (CS2) and/or Algorithms (CS7) courses. This paper describes alternatives ...
122
click to vote
CSDA
2008
15 years 23 days ago
2008
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
111
click to vote
ACL
2000
15 years 2 months ago
2000
We discuss the advantages of lexicalized tree-adjoining grammar as an alternative to lexicalized PCFG for statistical parsing, describingthe induction of a probabilistic LTAG mode...