1248 search results - page 34 / 250 » Decision Tree Grafting |
TCS
2002
14 years 11 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. ...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
115
click to vote
ECML
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Ensemble methods are able to improve the predictive performance of many base classifiers. Up till now, they have been applied to classifiers that predict a single target ...
FLAIRS
2004
15 years 1 months ago
2004
Artificial Neural Networks (ANNs) have proved both a popular and powerful technique for pattern recognition tasks in a number of problem domains. However, the adoption of ANNs in ...
110
click to vote
ICML
2001
IEEE
16 years 19 days ago
2001
IEEE
Accurate, well-calibrated estimates of class membership probabilities are needed in many supervised learning applications, in particular when a cost-sensitive decision must be mad...