1107 search results - page 51 / 222 » Multi-instance tree learning |
AAAI
1990
15 years 13 days ago
1990
In this paper, we address the issue of evaluating decision trees generated from training examples by a learning algorithm. We give a set of performance measures and show how some ...
NAACL
2010
14 years 9 months ago
2010
Previous work on dependency parsing used various kinds of combination models but a systematic analysis and comparison of these approaches is lacking. In this paper we implemented ...
102
click to vote
ICML
2001
IEEE
16 years 2 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...
ICML
2000
IEEE
16 years 2 days ago
2000
IEEE
This paper investigates how the splitting criteria and pruning methods of decision tree learning algorithms are influenced by misclassification costs or changes to the class distr...
103
click to vote
ML
2010
ACM
14 years 9 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...