Dryade: a new approach for discovering closed frequent trees in heterogeneous tree databases

Abstract

In this paper we present a novel algorithm for discovering tree patterns in a tree database. This algorithm uses a relaxed tree inclusion definition, making the problem more complex (checking tree inclusion is NP-complete), but allowing to mine highly heterogeneous databases. To obtain good performances, our DRYADE algorithm, discovers only closed frequent… (More)
DOI: 10.1109/ICDM.2004.10078

Topics

5 Figures and Tables

Statistics

051015'05'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

81 Citations

Semantic Scholar estimates that this publication has 81 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Termier2004DryadeAN, title={Dryade: a new approach for discovering closed frequent trees in heterogeneous tree databases}, author={Alexandre Termier and Marie-Christine Rousset and Mich{\`e}le Sebag}, journal={Fourth IEEE International Conference on Data Mining (ICDM'04)}, year={2004}, pages={543-546} }