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.
Type de document :
Article dans une revue
IEEE Transactions of Knowledge and Data Engineering, IEEE Computer Society, 2008
Liste complète des métadonnées

https://hal.inria.fr/inria-00292914
Contributeur : Michele Sebag <>
Soumis le : jeudi 3 juillet 2008 - 00:57:37
Dernière modification le : jeudi 5 avril 2018 - 12:30:08

Identifiants

  • HAL Id : inria-00292914, version 1

Collections

Citation

Alexandre Termier, Marie-Christine Rousset, Michele Sebag, Kouzou Ohara, Takashi Washio, et al.. DryadeParent, An Efficient and Robust Closed Attribute Tree Mining Algorithm. IEEE Transactions of Knowledge and Data Engineering, IEEE Computer Society, 2008. 〈inria-00292914〉

Partager

Métriques

Consultations de la notice

79