Sciweavers

1275 search results - page 36 / 255
» Chunking with Decision Trees
Sort
View
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 7 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
VLDB
1998
ACM
120views Database» more  VLDB 1998»
13 years 12 months ago
PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning
Classification is an important problem in data mining. Given a database of records, each with a class label, a classifier generates a concise and meaningful description for each c...
Rajeev Rastogi, Kyuseok Shim
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
13 years 11 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»
13 years 7 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
14 years 8 months 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