Sciweavers

334 search results - page 10 / 67
» The Alternating Decision Tree Learning Algorithm
Sort
View
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
15 years 5 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
ICML
1996
IEEE
16 years 2 months ago
Learning Relational Concepts with Decision Trees
In this paper, we describe two di erent learning tasks for relational structures. When learning a classi er for structures, the relational structures in the training sets are clas...
Peter Geibel, Fritz Wysotzki
DIS
2004
Springer
15 years 5 months ago
Generating AVTs Using GA for Learning Decision Tree Classifiers with Missing Data
Abstract. Attribute value taxonomies (AVTs) have been used to perform AVT-guided decision tree learning on partially or totally missing data. In many cases, user-supplied AVTs are ...
Jinu Joo, Jun Zhang 0002, Jihoon Yang, Vasant Hona...
PR
2008
79views more  PR 2008»
15 years 1 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
2007
IEEE
16 years 2 months ago
Sample compression bounds for decision trees
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
Mohak Shah