Matching in frequent tree discovery

Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004

Volumn , Issue , 2004, Pages 335-338

  Bringmann, Björn ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

TREE INCORPORATION; TREE MATCHING; TREE MINING; WEB MINING;

ALGORITHMS; DATA MINING; DATA STRUCTURES; FORMAL LANGUAGES; PATTERN MATCHING; SET THEORY; THEOREM PROVING;

TREES (MATHEMATICS);

EID: 19544384137     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2004.10064     Document Type: Conference Paper

References (9)

1. T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Sakamoto, and S. Arikawa. Efficient substructure discovery from large semistructured data. In Proc. of SIAM SDM, pages 158-174, 2002.
2. L. De Raedt and S. Kramer. The levelwise version space algorithm and its application to molecular fragement finding. In Proc. of IJCAI-01, pages 853-862, 2001.
3. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Proc. of PKDD, pages 13-23, 2000.
4. R. Kohavi, C. Brodley, B. Frasca, L. Mason, and Z. Zheng. KDD-Cup 2000 organizers' report: Peeling the onion. SIGKDD Explorations, 2(2):85-98, 2000.
5. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proc. of ICDM, 2001.
6. A. Termier, M.-C. Rousset, and M. Sebag. Treefinder: a first step towards xml data mining. In Proc. of ICDM, 2002.
7. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In Proc. of ICDM, 2002.
8. M. Zaki. Efficiently mining frequent trees in a forest. In Proc. of KDD, 2002.
9. M. J. Zaki and C. C. Aggarwal. Xrules: An effective structural classifier for xml data. In Proc. of SIGKDD 03, 2003.