Efficient Mining of High Branching Factor Attribute Trees Alexandre Termier, Marie-Christine Rousset, Michele Sebag, Kouzou Ohara, Takashi Washio, and Hiroshi Motoda   View Paper (PDF)   Return to Session 11: Data Representation Abstract . In the experiments, we demonstrate that the branching factor and depth of the frequent patterns to find are key factor of complexity for tree mining algorithms. 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. ©2006 Association for Computing Machinery