Sciweavers

301 search results - page 5 / 61
» On the Optimality of Probability Estimation by Random Decisi...
Sort
View
ECML
2004
Springer
14 years 1 months ago
Conditional Independence Trees
It has been observed that traditional decision trees produce poor probability estimates. In many applications, however, a probability estimation tree (PET) with accurate probabilit...
Harry Zhang, Jiang Su
ISITA
2010
13 years 5 months ago
Approximating discrete probability distributions with causal dependence trees
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 8 months ago
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
Rahul Jain, Hartmut Klauck, Miklos Santha
ICML
2003
IEEE
14 years 1 months ago
Decision Tree with Better Ranking
AUC(Area Under the Curve) of ROC(Receiver Operating Characteristics) has been recently used as a measure for ranking performanceof learning algorithms. In this paper, wepresent a ...
Charles X. Ling, Robert J. Yan
PAMI
1998
127views more  PAMI 1998»
13 years 7 months ago
The Random Subspace Method for Constructing Decision Forests
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
Tin Kam Ho