Sciweavers

1923 search results - page 16 / 385
» Weighted Decision Trees
Sort
View
IJCAI
1993
13 years 9 months ago
Induction of Oblique Decision Trees
This article describes a new system for induction of oblique decision trees. This system, OC1, combines deterministic hill-climbing with two forms of randomization to nd a good ob...
David G. Heath, Simon Kasif, Steven Salzberg
EGC
2009
Springer
13 years 5 months ago
A Bayes Evaluation Criterion for Decision Trees
We present a new evaluation criterion for the induction of decision trees. We exploit a parameter-free Bayesian approach and propose an analytic formula for the evaluation of the p...
Nicolas Voisine, Marc Boullé, Carine Hue
APPROX
2005
Springer
131views Algorithms» more  APPROX 2005»
14 years 1 months ago
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
Jan Remy, Angelika Steger
COLING
1996
13 years 9 months ago
Decision Tree Learning Algorithm with Structured Attributes: Application to Verbal Case Frame Acquisition
The Decision Tree Learning Algorithms (DTLAs) are getting keen attention from the natural language processing research comlnunity, and there have been a series of attempts to appl...
Hideki Tanaka
AUSAI
2004
Springer
14 years 1 months ago
MML Inference of Oblique Decision Trees
We propose a multivariate decision tree inference scheme by using the minimum message length (MML) principle (Wallace and Boulton, 1968; Wallace and Dowe, 1999). The scheme uses MM...
Peter J. Tan, David L. Dowe