The Community for Technology Leaders
Green Image
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 datasets where the frequent patterns have a high branching factor.
Data mining, Mining methods and algorithms, Mining tree structured data
Alexandre Termier, Takashi Washio, Michèle Sebag, Kouzou Ohara, Hiroshi Motoda, Marie-Christine Rousset, "DryadeParent, An Efficient and Robust Closed Attribute Tree Mining Algorithm", IEEE Transactions on Knowledge & Data Engineering, vol. 20, no. , pp. 300-320, March 2008, doi:10.1109/TKDE.2007.190695
96 ms
(Ver 3.3 (11022016))