Sciweavers

2553 search results - page 40 / 511
» Modeling Trees with Hypertextures
Sort
View
DATAMINE
2010
166views more  DATAMINE 2010»
14 years 9 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont
ICDM
2007
IEEE
187views Data Mining» more  ICDM 2007»
15 years 4 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
COLT
2003
Springer
15 years 3 months ago
Learning Random Log-Depth Decision Trees under the Uniform Distribution
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...
Jeffrey C. Jackson, Rocco A. Servedio
PEPM
2011
ACM
14 years 17 days ago
Calculating tree navigation with symmetric relational zipper
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
Yuta Ikeda, Susumu Nishimura
ML
2007
ACM
130views Machine Learning» more  ML 2007»
14 years 9 months ago
Interactive learning of node selecting tree transducer
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...
Julien Carme, Rémi Gilleron, Aurélie...