Sciweavers

245 search results - page 15 / 49
» Tree pattern mining with tree automata constraints
Sort
View
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
14 years 1 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
14 years 26 days ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz
ICDM
2006
IEEE
118views Data Mining» more  ICDM 2006»
14 years 1 months ago
Reducing the Frequent Pattern Set
One of the major problems in frequent pattern mining is the explosion of the number of results, making it difficult to identify the interesting frequent patterns. In a recent pap...
Ronnie Bathoorn, Arne Koopman, Arno Siebes
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
14 years 8 months ago
Mining tree queries in a graph
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
Bart Goethals, Eveline Hoekx, Jan Van den Bussche
PODS
2007
ACM
104views Database» more  PODS 2007»
14 years 7 months ago
XML transformation by tree-walking transducers with invisible pebbles
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samw...