Sciweavers

1591 search results - page 14 / 319
» Hybrid decision tree
Sort
View
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
14 years 2 months ago
Optimal Integer Alphabetic Trees in Linear Time
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...
T. C. Hu, Lawrence L. Larmore, J. David Morgenthal...
ECML
2004
Springer
14 years 2 months ago
Sensitivity Analysis of the Result in Binary Decision Trees
This paper 3 proposes a new method to qualify the result given by a decision tree when it is used as a decision aid system. When the data are numerical, we compute the distance of ...
Isabelle Alvarez
ICDM
2005
IEEE
143views Data Mining» more  ICDM 2005»
14 years 2 months ago
Effective Estimation of Posterior Probabilities: Explaining the Accuracy of Randomized Decision Tree Approaches
There has been increasing number of independently proposed randomization methods in different stages of decision tree construction to build multiple trees. Randomized decision tre...
Wei Fan, Ed Greengrass, Joe McCloskey, Philip S. Y...
AAAI
2004
13 years 10 months ago
On the Optimality of Probability Estimation by Random Decision Trees
Random decision tree is an ensemble of decision trees. The feature at any node of a tree in the ensemble is chosen randomly from remaining features. A chosen discrete feature on a...
Wei Fan
IJCAI
1993
13 years 10 months ago
Learning Decision Lists over Tree Patterns and Its Application
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
Satoshi Kobayashi, Koichi Hori, Setsuo Ohsuga