Abstract
Methods for mining frequent trees are widely used in domains like bioinformatics, web-mining, chemical compound structure mining, and so on. In this paper, we present TG, an efficient pattern growth algorithm for mining frequent embedded suttees in a forest of rooted, labeled, and ordered trees. It uses rightmost path expansion scheme to construct complete pattern growth space, and creates a projected database for every grow point of the pattern ready to grow. Then, the problem is transformed from mining frequent trees to finding frequent nodes in the projected database. We conduct detailed experiments to test its performance and scalability and find that TG outperforms TreeMiner, one of the fastest methods proposed before, by a factor of 4 to 15.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: The 1993 ACM2SIGMOD, Washington (1993)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: The 1994 VLDB, Santiago, Chile (1994)
Wang, K., Liu, H.: Schema discovery for semistructured data. In: KDD 1997, Newport Beach, CA (1997)
Chi, Y., Yang, Y., Muntx, R.R.: Index and mining free trees. In: Proc. of the 2003 IEEE Int. Conf. on Data Mining (2003)
Han, J., et al.: Mining frequent patterns without candidate generation. In: SIGMOD 2000, Dallas, TX (2000)
Zaki, M.J.: Efficiently mining frequent trees in a forest. In: KDD 2002, Edmonton, Alberta, Canada (2002)
Asia, T., et al.: Efficient substructure discovery from large semi-structured data. In: Proc. 2002 SIAM Int. Conf. Data Mining, Arlington, VA (2002)
Pei, J., et al.: H-Mine: Hyper-structure mining of frequent patterns in large databases. In: ICDM 2001, San Jose, CA (2001)
Pei, J., et al.: PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In: ICDE 2001, Heidelberg, Germany (2001)
Ma, H., Zhang, J., Jie-Fan, Y., Fa-Hu, Y.: Mining frequent patterns based on IS+-tree. In: ICMLC 2004, Shang Hai, China (2004)
Dehaspe, L., et al.: Finding frequent substructures in chemical compounds. In: KDD 1998, New York, NY (1998)
Miyahara, T., et al.: Discovery of frequent tree structured patterns in semistructured web documents. In: Cheung, D., Williams, G.J., Li, Q. (eds.) PAKDD 2001. LNCS (LNAI), vol. 2035, p. 47. Springer, Heidelberg (2001)
Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), Maebashi City, Japan, 9-12 December (2002)
Zaki, M.J., Aggarwal, C.C.: XRules: An effective structural classifier for XML data. In: Proc. of the 2003 Int. Conf. Knowledge Discovery and Data Mining (2003)
Yan, X., Yu, S., Han, J.: Graph Index: A Frequent Structure-based Approach. In: SIGMOD 2004, Paris, Fance (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haibing, M., Chen, W., Ronglu, L., Yong, L., Yunfa, H. (2005). Mining Frequent Trees Based on Topology Projection. In: Zhang, Y., Tanaka, K., Yu, J.X., Wang, S., Li, M. (eds) Web Technologies Research and Development - APWeb 2005. APWeb 2005. Lecture Notes in Computer Science, vol 3399. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31849-1_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-31849-1_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25207-8
Online ISBN: 978-3-540-31849-1
eBook Packages: Computer ScienceComputer Science (R0)