DRYADE: A New Approach for Discovering Closed Frequent Trees in Heterogeneous Tree Databases

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Alexandre Termier Articles by Marie-Christine Rousset Articles by Mich?le Sebag

Fourth IEEE International Conference on Data Mining (ICDM'04)

Brighton, United Kingdom

November 01-November 04

ISBN: 0-7695-2142-8

	ASCII Text	x
	Alexandre Termier, Marie-Christine Rousset, Mich?le Sebag, "DRYADE: A New Approach for Discovering Closed Frequent Trees in Heterogeneous Tree Databases," Data Mining, IEEE International Conference on, pp. 543-546, Fourth IEEE International Conference on Data Mining (ICDM'04), 2004.

	BibTex	x
	@article{ 10.1109/ICDM.2004.10078, author = {Alexandre Termier and Marie-Christine Rousset and Mich?le Sebag}, title = {DRYADE: A New Approach for Discovering Closed Frequent Trees in Heterogeneous Tree Databases}, journal ={Data Mining, IEEE International Conference on}, volume = {0}, year = {2004}, isbn = {0-7695-2142-8}, pages = {543-546}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2004.10078}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Data Mining, IEEE International Conference on TI - DRYADE: A New Approach for Discovering Closed Frequent Trees in Heterogeneous Tree Databases SN - 0-7695-2142-8 SP543 EP546 A1 - Alexandre Termier, A1 - Marie-Christine Rousset, A1 - Mich?le Sebag, PY - 2004 KW - null VL - 0 JA - Data Mining, IEEE International Conference on ER -

Alexandre Termier, INRIA (Futurs), France

Marie-Christine Rousset, INRIA (Futurs), France

Mich?le Sebag, INRIA (Futurs), France

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2004.10078

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 tree patterns.

Citation:

Alexandre Termier, Marie-Christine Rousset, Mich?le Sebag, "DRYADE: A New Approach for Discovering Closed Frequent Trees in Heterogeneous Tree Databases," icdm, pp.543-546, Fourth IEEE International Conference on Data Mining (ICDM'04), 2004

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.