Abstract
For the existence of problems with mining frequent subgraph by the traditional way, a new algorithm of top-down mining maximal frequent subgraph based on tree structure is proposed in this paper. In the mining process, the symmetry of graph is used to identify the symmetry vertex; determining graph isomorphism based on the attributed information of graph, the tree structure is top-down constructed and completed the calculation of support. Which is reduced the unnecessary operation and the redundant storage of graphs, and the efficiency of algorithm is improved. Experiments show that the algorithm is superior to the existing maximal frequent subgraph mining algorithms, without losing any patterns and useful information.
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
Han, J., Kamber, M.: Data Mining: Concepts and Techniques, pp. 79–165. Mechanical Industry Publishing, Beijing (2007), Translate by Fan, M., Men, X.f.
Thomas, L.T., Valluri, S.R., Karlapalem, K.: MARGIN: Maximal Frequent Subgraph Mining. In: Proc of ICMD 2006, Hong Kong, pp. 1097–1101 (2006)
Wang, Y.-l., Yang, B.-r., Song, Z.-f., Chen, Z., Li, L.-n.: New Algorithm for Mining Maximal Frequent Subgraphs. Journal of System Simulation 20(18), 4872–4877 (2008)
Guo, J., Chai, R., Li, J.: Top-Down Algorithm for Mining Maximal Frequent Subgraph. Advanced Materials Research 204 - 210, 1472–1476 (2011)
Chakrabarti, D., Flaoutsos, C.: Graph mining: laws, generators, and algorithms. ACM Computing Surveys 38(1), 1–69 (2006)
Gouda, K., Zaki, M.J.: Efficiently Mining Maximal Frequent Itemsets, pp. 101–108. Springer Press, New York (2002)
Chen, X.: How to Confirm Isomorphic of Graph, http://www.paper.edu.cn
Zou, X., Chen, X., Guo, J., Zhao, L.: An improved algorithm for mining CloseGraph. ICIC Express Letters Journal of Research and Surveys 4(4), 1135–1140 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Chen, X., Zhang, C., Liu, F., Guo, J. (2012). Algorithm Research of Top-Down Mining Maximal Frequent SubGraph Based on Tree Structure. In: Sénac, P., Ott, M., Seneviratne, A. (eds) Wireless Communications and Applications. ICWCA 2011. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 72. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29157-9_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-29157-9_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29156-2
Online ISBN: 978-3-642-29157-9
eBook Packages: Computer ScienceComputer Science (R0)