Skip to Main content Skip to Navigation
Journal articles

DryadeParent, An Efficient and Robust Closed Attribute Tree Mining Algorithm

Abstract : In this paper we present a new tree mining algorithm, DryadeParent, based on the hooking principle first introduced in Dryade. In the experiments, we demonstrate that the branching factor and depth of the frequent patterns to find are key factors of complexity for tree mining algorithm, even if often overlooked in previous work. We show that DryadeParent outperforms the current fastest algorithm, CMTreeMiner, by orders of magnitude on datasets where the frequent tree patterns have a high branching factor.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00292914
Contributor : Michele Sebag <>
Submitted on : Thursday, July 3, 2008 - 12:57:37 AM
Last modification on : Tuesday, April 21, 2020 - 1:10:55 AM

Identifiers

  • HAL Id : inria-00292914, version 1

Collections

Citation

Alexandre Termier, Marie-Christine Rousset, Michèle Sebag, Kouzou Ohara, Takashi Washio, et al.. DryadeParent, An Efficient and Robust Closed Attribute Tree Mining Algorithm. IEEE Transactions on Software Engineering, Institute of Electrical and Electronics Engineers, 2008. ⟨inria-00292914⟩

Share

Metrics

Record views

159