1661 search results - page 32 / 333 » Decision Tree Fields |
112
click to vote
AIPS
2008
15 years 4 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
107
Voted
SAC
2009
ACM
15 years 8 months ago
2009
ACM
Decision trees are widely disseminated as an effective solution for classification tasks. Decision tree induction algorithms have some limitations though, due to the typical strat...
96
Voted
ICAISC
2004
Springer
15 years 7 months ago
2004
Springer
In the paper, a new evolutionary approach to induction of oblique decision trees is described. In each non-terminal node, the specialized evolutionary algorithm is applied to searc...
123
Voted
FLAIRS
2008
15 years 4 months ago
2008
This paper describes the implementation of a system that automatically learns selectional restrictions for individual senses of polysemous verbs from subject-object relationships....
110
Voted
TCS
2002
15 years 1 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...