This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Second IEEE International Conference on Data Mining (ICDM'02)
TreeFinder: a First Step towards XML Data Mining
Maebashi City, Japan
December 09-December 12
ISBN: 0-7695-1754-4
Alexandre Termier, LRI - CNRS UMR
Marie-Christine Rousset, LRI - CNRS UMR
Michèl Sebag, LRI - CNRS UMR
In this paper, we consider the problem of searching fre-quent trees from a collection of tree-structured data model-ing XML data. The TreeF inder 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, TreeF inder is correct but not complete: it finds a subset of the actually frequent trees. The default of completeness is experimentally inves-tigated on artificial medium size datasets; it is shown that TreeFinderreaches completeness or falls short to it for a range of experimental settings.
Citation:
Alexandre Termier, Marie-Christine Rousset, Michèl Sebag, "TreeFinder: a First Step towards XML Data Mining," icdm, pp.450, Second IEEE International Conference on Data Mining (ICDM'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.