Sciweavers

127 search results - page 8 / 26
» Learning Monotone Decision Trees in Polynomial Time
Sort
View
ITA
2007
101views Communications» more  ITA 2007»
13 years 8 months ago
Learning tree languages from text
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
Henning Fernau
ICGI
2004
Springer
14 years 1 months ago
Learning Node Selecting Tree Transducer from Completely Annotated Examples
Abstract. A base problem in Web information extraction is to find appropriate queries for informative nodes in trees. We propose to learn queries for nodes in trees automatically ...
Julien Carme, Aurélien Lemay, Joachim Niehr...
ICDM
2007
IEEE
187views Data Mining» more  ICDM 2007»
14 years 2 months ago
Statistical Learning Algorithm for Tree Similarity
Tree edit distance is one of the most frequently used distance measures for comparing trees. When using the tree edit distance, we need to determine the cost of each operation, bu...
Atsuhiro Takasu, Daiji Fukagawa, Tatsuya Akutsu
CORR
2010
Springer
74views Education» more  CORR 2010»
13 years 8 months ago
Significance of Classification Techniques in Prediction of Learning Disabilities
The aim of this study is to show the importance of two classification techniques, viz. decision tree and clustering, in prediction of learning disabilities (LD) of school-age chil...
Julie M. David, Kannan Balakrishnan
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 9 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen