DryadeParent, An Efficient and Robust Closed Attribute Tree Mining Algorithm - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Software Engineering Year : 2008

DryadeParent, An Efficient and Robust Closed Attribute Tree Mining Algorithm

, (1) , (2) , , ,
1
2
Alexandre Termier
Michèle Sebag
  • Function : Author
  • PersonId : 836537
Kouzou Ohara
  • Function : Author
  • PersonId : 850127
Takashi Washio
  • Function : Author
  • PersonId : 850128
Hiroshi Motoda
  • Function : Author
  • PersonId : 850129

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.
Not file

Dates and versions

inria-00292914 , version 1 (03-07-2008)

Identifiers

  • HAL Id : inria-00292914 , version 1

Cite

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, 2008. ⟨inria-00292914⟩
57 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More