DryadeParent, An Efficient and Robust Closed Attribute Tree Mining Algorithm

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 algorithms, even if often overlooked in previous work. We show that DRYADEPARENT outperforms the current fastest algorithm, CMTreeMiner, by orders of magnitude on data sets where the frequent tree patterns have a high branching factor.

• Type: Journal
• Year: 2008
• Where: TKDE
• Authors: Alexandre Termier, Marie-Christine Rousset, Michèle Sebag, Kouzou Ohara, Takashi Washio, Hiroshi Motoda
• Keywords: Branching Factor, TKDE 2008, Tree Mining, Tree Mining Algorithm