Mining frequent tree patterns is an important research problems with broad applications in bioinformatics, digital library, ecommerce, and so on. Previous studies highly suggested that patterngrowth methods are efficient in frequent pattern mining. In this paper, we systematically develop the pattern growth methods for mining frequent tree patterns. Two algorithms, Chopper and XSpanner, are devised. An extensive performance study shows that the two newly developed algorithms outperform TreeMinerV [13], one of the fastest methods proposed before, in mining large databases. Furthermore, algorithm XSpanner is substantially faster than Chopper in many cases.
CITATION STYLE
Wang, C., Hong, M., Pei, J., Zhou, H., Wang, W., & Shi, B. (2004). Efficient pattern-growth methods for frequent tree pattern mining. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3056, pp. 441–451). Springer Verlag. https://doi.org/10.1007/978-3-540-24775-3_54
Mendeley helps you to discover research relevant for your work.