TreeFinder: a first step towards XML data mining
Authors:
- 26 June 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 450-457
Abstract
In this paper we consider the problem of searching frequent trees from a collection of tree-structured data modeling XML data. The TreeFinder algorithm aims at finding trees, such that their exact or perturbed copies are frequent in a collection of labelled trees. To cope with complexity issues, TreeFinder is correct but not complete: it finds a subset of actually frequent trees. The default of completeness is experimentally investigated on artificial medium size datasets; it is shown that TreeFinder reaches completeness or falls short for a range of experimental settings.Keywords
This publication has 10 references indexed in Scilit:
- Mining sequential patterns2002
- Efficient Substructure Discovery from Large Semi-structured Data2002
- Discovery of Frequent Tree Structured Patterns in Semistructured Web DocumentsLecture Notes in Computer Science, 2001
- Algorithms for association rule mining — a general survey and comparisonACM SIGKDD Explorations Newsletter, 2000
- DTD inference for views of XML data2000
- An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data2000
- Levelwise Search and Borders of Theories in Knowledge DiscoveryData Mining and Knowledge Discovery, 1997
- Substructure Discovery Using Minimum Description Length and Background KnowledgeJournal of Artificial Intelligence Research, 1994
- Nonlinear pattern matching in treesJournal of the ACM, 1992
- Foundations of Logic Programming1987