Sciweavers

70 search results - page 6 / 14
» The Problem of Missing Values in Decision Tree Grafting
Sort
View
ECAI
2004
Springer
14 years 1 months ago
Postponing Branching Decisions
Abstract. Solution techniques for Constraint Satisfaction and Optimisation Problems often make use of backtrack search methods, exploiting variable and value ordering heuristics. I...
Willem Jan van Hoeve, Michela Milano
ICML
1999
IEEE
14 years 8 months ago
Lazy Bayesian Rules: A Lazy Semi-Naive Bayesian Learning Technique Competitive to Boosting Decision Trees
Lbr is a lazy semi-naive Bayesian classi er learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classi cation. To classify a test exa...
Zijian Zheng, Geoffrey I. Webb, Kai Ming Ting
VLDB
1998
ACM
95views Database» more  VLDB 1998»
13 years 11 months ago
RainForest - A Framework for Fast Decision Tree Construction of Large Datasets
Classification of large datasets is an important data mining problem. Many classification algorithms have been proposed in the literature, but studies have shown that so far no al...
Johannes Gehrke, Raghu Ramakrishnan, Venkatesh Gan...
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
13 years 11 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
APIN
2008
110views more  APIN 2008»
13 years 7 months ago
Explaining inferences in Bayesian networks
While Bayesian network (BN) can achieve accurate predictions even with erroneous or incomplete evidence, explaining the inferences remains a challenge. Existing approaches fall sh...
Ghim-Eng Yap, Ah-Hwee Tan, HweeHwa Pang