Sciweavers

1248 search results - page 40 / 250
» Decision Tree Grafting
Sort
View
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
15 years 3 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
PR
2008
79views more  PR 2008»
14 years 11 months ago
Region-based image retrieval with high-level semantics using decision tree learning
Semantic-based image retrieval has attracted great interest in recent years. This paper proposes a region-based image retrieval system with high-level semantic learning. The key f...
Ying Liu, Dengsheng Zhang, Guojun Lu
ICML
2000
IEEE
16 years 19 days ago
Exploiting the Cost (In)sensitivity of Decision Tree Splitting Criteria
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...
Chris Drummond, Robert C. Holte
CBMS
2007
IEEE
15 years 6 months ago
Increasing Acceptability of Decision Trees with Domain Attributes Partial Orders
There are several domains, such as health-care, in which the decision process usually has a background knowledge that must be considered. We need to maximize the accuracy of the m...
Joan Albert López-Vallverdú, David R...
ICML
1998
IEEE
16 years 19 days ago
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
Michael J. Kearns, Yishay Mansour