1661 search results - page 105 / 333 » Decision Tree Fields |
188
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
We develop the theory of regular cost functions over finite trees: a quantitative extension to the notion of regular languages of trees: Cost functions map each input (tree) to a v...
148
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Solution techniques for Constraint Satisfaction and Optimisation Problems often make use of backtrack search methods, exploiting variable and value ordering heuristics. I...
166
click to vote
JMLR
2010
15 years 1 months ago
2010
After building a classifier with modern tools of machine learning we typically have a black box at hand that is able to predict well for unseen data. Thus, we get an answer to the...
188
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
154
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
This paper proposes a novel decision tree for a data set with time-series attributes. Our time-series tree has a value (i.e. a time sequence) of a time-series attribute in its int...