245 search results - page 5 / 49 » Tree pattern mining with tree automata constraints |
FCT
2001
Springer
13 years 12 months ago
2001
Springer
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
KDD
2002
ACM
14 years 7 months ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
KDD
2000
ACM
13 years 11 months ago
2000
ACM
RTA
2000
Springer
13 years 11 months ago
2000
Springer
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
ICDE
2004
IEEE
14 years 8 months ago
2004
IEEE
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...