Sciweavers

39 search results - page 2 / 8
» Compiling pattern matching to good decision trees
Sort
View
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
15 years 9 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
DBPL
2007
Springer
158views Database» more  DBPL 2007»
15 years 7 months ago
Efficient Algorithms for the Tree Homeomorphism Problem
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
Michaela Götz, Christoph Koch, Wim Martens
EVOW
2010
Springer
15 years 10 months ago
Grammatical Evolution Decision Trees for Detecting Gene-Gene Interactions
DEODHAR, SUSHAMNA DEODHAR. Using Grammatical Evolution Decision Trees for Detecting Gene-Gene Interactions in Genetic Epidemiology. (Under the direction of Dr. Alison Motsinger-Re...
Sushamna Deodhar, Alison A. Motsinger-Reif
DBPL
2005
Springer
135views Database» more  DBPL 2005»
15 years 8 months ago
Type-Based Optimization for Regular Patterns
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...
Michael Y. Levin, Benjamin C. Pierce
MTPP
2010
15 years 1 months ago
A Fast General Parser for Automatic Code Generation
Abstract. The code generator in a compiler attempts to match a subject tree against a collection of tree-shaped patterns for generating instructions. Tree-pattern matching may be c...
Wuu Yang