Abstract
Frequent subtree mining has wide applications in many fields. However the number of the frequent subtree is often too large because of the extensive redundancy in frequent subtree set, which makes it difficult to be used in practice. In this paper, density of frequent subtree in the lattice induced by frequent subtree set is introduced, then a novel concise representation of frequent subtree called FTCB is proposed, and the corresponding mining algorithm FTCBminer is proposed too. Experimental results show that FTCB keeps more information than MFT and reduces the size of frequent subtree set more efficiently than CFT.
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
References
Wang, S., Hong, Y., Yang, J.: XML document classification using closed frequent subtree. In: Bao, Z., et al. (eds.) WAIM 2012. LNCS, vol. 7419, pp. 350–359. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33050-6_34
Milo, N., Zakov, S., Katzenelson, E., Bachmat, E., Dinitz, Y., Ziv-Ukelson, M.: Unrooted unordered homeomorphic subtree alignment of RNA trees. Algorithms Mol. Biol. 8, 13 (2013)
Nguyen, D.P.T., Matsuo, Y., Ishizuka, M.: Relation extraction from Wikipedia using subtree mining. In: National Conference on Artificial Intelligence, pp. 1414–1420 (2007)
Jimenez, A.D., Berzal, F., Cubero, J.: Frequent tree pattern mining: a survey. J. Intell. Data Anal. 14, 603–622 (2010)
Hao, Z., Huang, C., Cai, R., Wen, W., Huang, Y., Chen, B.: User interest related information diffusion pattern mining in microblog. Pattern Recog. Artif. Intell. 29, 924–935 (2016)
Zaki, M.J.: Efficiently mining frequent trees in a forest: algorithms and applications. IEEE Trans. Knowl. Data Eng. 17, 1021–1035 (2005)
Asai, T., Abe, K., Kawasoe, S., Sakamoto, H., Arimura, H., Arikawa, S.: Efficient substructure discovery from large semi-structured data. IEICE Trans. Inf. Syst. 87, 2754–2763 (2004)
Deepak, A., Fernández-Baca, D., Tirthapura, S., Sanderson, M.J., McMahon, M.M.: EvoMiner: frequent subtree mining in phylogenetic databases. Knowl. Inf. Syst. 41, 559–590 (2014)
Zhang, S., Du, Z., Wang, J.T.: New techniques for mining frequent patterns in unordered trees. IEEE Trans. Cybern. 45, 1113–1125 (2015)
Tian, W.D., Xu, J.W.: Concise representation of frequent itemset based on fuzzy equivalence. Appl. Res. Comput. 33, 1936–1940 (2016)
Xiao, Y., Yao, J.-F.: Efficient data mining for maximal frequent subtrees. In: Third IEEE International Conference on Data Mining, pp. 379–386. IEEE (2003)
Chi, Y., Yang, Y., Xia, Y., Muntz, R.R.: CMTreeMiner: mining both closed and maximal frequent subtrees. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 63–73. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24775-3_9
Yang, P., Tan, Q.: Maximum frequent tree mining and its applications. Comput. Sci. 35, 150–153 (2008)
Termier, A., Rousset, M.-C., Sebag, M.: DRYADE: a new approach for discovering closed frequent trees in heterogeneous tree databases. In: Fourth IEEE International Conference on Data Mining (ICDM 2004), pp. 543–546. IEEE (2004)
Feng, B., Xu, Y., Zhao, N., Xu, H.: A new method of mining frequent closed trees in data streams. In: 2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery, pp. 2245–2249. IEEE (2010)
Wang, T., Lu, Y.S.: Mining condensed frequent subtree base. J. SE Univ. 22, 48–53 (2006)
Yang, S.C.: Research on Question Classification for Chinese Question Answering System. Nanjing University, Nanjing (2013)
Che, W., Li, Z., Liu, T.: LTP: a Chinese language technology platform. In: Proceedings of the 23rd International Conference on Computational Linguistics: Demonstrations, pp. 13–16. Association for Computational Linguistics (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Tian, W., Guo, C., Xie, Y., Zhou, H., Zhao, Z. (2019). A Novel Concise Representation of Frequent Subtrees Based on Density. In: Huang, DS., Huang, ZK., Hussain, A. (eds) Intelligent Computing Methodologies. ICIC 2019. Lecture Notes in Computer Science(), vol 11645. Springer, Cham. https://doi.org/10.1007/978-3-030-26766-7_40
Download citation
DOI: https://doi.org/10.1007/978-3-030-26766-7_40
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26765-0
Online ISBN: 978-3-030-26766-7
eBook Packages: Computer ScienceComputer Science (R0)