Sciweavers

245 search results - page 4 / 49
» Tree pattern mining with tree automata constraints
Sort
View
ICALP
1998
Springer
13 years 11 months ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
ICWE
2004
Springer
14 years 26 days ago
Behaviour Recovery and Complicated Pattern Definition in Web Usage Mining
Data mining includes four steps: data preparation, pattern mining, and pattern analysis and pattern application. But in web environment, the user activities become much more comple...
Long Wang 0002, Christoph Meinel
DLT
2008
13 years 9 months ago
Tree Automata with Global Constraints
A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be...
Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
FSTTCS
1998
Springer
13 years 11 months ago
Optimal Regular Tree Pattern Matching Using Pushdown Automata
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
Maya Madhavan, Priti Shankar
AUSDM
2008
Springer
235views Data Mining» more  AUSDM 2008»
13 years 9 months ago
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer,...