1209 search results - page 67 / 242 » Semi-Supervised Learning with Trees |
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
AAAI
1990
13 years 9 months 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 ...
ICML
2001
IEEE
14 years 9 months 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
14 years 9 months 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...
ML
2010
ACM
13 years 6 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 ...