Abstract
Graphs and Trees are non-linear data structures used to organise, model and solve many real world problems and becoming more popular both in scientific as well as commercial domains. They have wide number of applications ranging from Telephone networks, Internet, Social Networks, Program flow, Chemical Compounds, BioInformatics, XML data, Terrorist networks etc. Graph Mining is used for finding useful and significant patterns. Frequent subgraph Mining mines for frequent patterns and subgraphs and they form the basis for Graph clustering, Graph classification, Graph Based Anomaly Detection. In this paper, classification of FSM algorithms is done and popular frequent subgraph mining algorithms are discussed. Comparative study of algorithms is done by taking chemical compounds dataset. Further, this paper provides a framework which acts as strong foundation in understanding any frequent subgraph mining algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Han, J., Kamber, M.: Data Mining Concepts and Techniques, 2nd edn. Morgan Kaufmann Publishers (2006)
McKay., B.D., Piperno., A.: Nauty and Traces. Graph Canonical Labeling and Automorphism Group Computation. http://pallini.di.uniroma1.it/Introduction.html
Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Proceedings. 4th European Conference Principles Data Mining Knowledge Discovery, pp. 13–23 (2000)
Tan, P.N., Steinbach, M., Kumar, V.: Introduction to Data Mining, Addison-Wesley (2005)
Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings International Conference Data Mining, pp. 313–320 (2001)
Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: Proceedings International Conference Data Mining, pp. 721–724 (2002)
Nijssenm, S., Kok, J.: A quickstart in frequent structure mining can make a difference. In: Proceedings 10th ACM SIGKDD International Confernce Knowledge Discovery Data Mining, pp. 647–652 (2004)
Cook, D.J., Holder, L.B., Cook, D.J., Djoko, S.: Substructure discovery in the SUBDUE system. In: Proceedings of the AI Workshop on Knowledge Discovery in Databases, pp. 169–180 (1994)
Yan, X., Cheng, H.: CloseGraph: Mining closed frequent graph patterns. In: Proceedings of the ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 286–295 (2003)
Worlein, M., Meinl, T., Fisher, I., Philippsen, M.,: A quantitative comparison of the subgraph miners MoFa, gSpan, FFSM, and Gaston. Knowledge Discovery in Databases: PKDD pp. 392–403, (2005)
Chaoji, V., Hasan, M., Salem, S., Zaki, M.: An integrated generic apprach to pattern mining: data mining template library. Data Min. Knowl. Discov. J. 17(3), 457–495 (2008)
Chakravarthy, S., Beera, R., Balachandran, R.: Db-subdue: database approach to graph mining. In: Proceedings Advances Knowledge Discovery and Data Mining, pp. 341–350 (2004)
Chakravarthy, S., Pradhan, S.: Db-FSG: An SQL-based approach for frequent subgraph mining. In: Proceedings 19th International Conference Database Expert System Applications, pp. 684–692 (2008)
Srichandan, B., Sunderraman, R.: Oo-FSG: An Object-oriented Approach to Mine Frequent Subgraphs. In: Proceedings Australasian Data Mining Conference, pp. 221–228
Parthasarathy, S., Coatney, M.: Efficient Discovery of common substructures in macromolecues. In: Proceefdings IEEE International Confernce Data Mining, pp. 362–369 (2002)
Meinl, T., Worlein, M., Urzova, O., Fischer, I., Philippsen, M.: The parmol package for frequent subgraph mining electronic communications of the EASST vol. 1, pp. 1–12, (2006)
Philippsen, M., Worlein, M., Dreweke, A., Werth. T.: Parmesis: The parallel and sequential mining suite (2011). https://www2.cs.fau.de/EN/research/ParSeMiS/index.html
Cook, D.J., Holder, L.B.: Graph-based data mining. IEEE Intell. Syst. 15(2), 32–41, (2000)
Jiang, X., Xiong, H., Wang, C., Tan, A.H.: Mining globally distributed frequent subgraphs in a single labeled graph. Data Knowl. Eng. 68(10), 1034–1058 (2009)
Kuramochi, M., Karypis, G.: Finding frequent patterns in a large sparse graph. Data Min. Knowl. Discov. 11(3), 795–825 (2005)
Borgelt, C., Berthold, M.R.: Mining molecular fragments: Finding relevant substructures of molecules. In: Proceedings IEEE International Conference on Data Mining (ICDM). In: . pp. 51–58, (2002)
Huan, J., Wang, W., Prins, J.: Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism. In: Third IEEE International Conference on Data Mining (ICDM).In: Proceedings IEEE, pp. 549–552 November (2003)
Hill, S., Srichandan, B., Sunderraman, R.: An iterative mapreduce approach to frequent subgraph mining in biological datasets. In: Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine (2012)
Xiao, X., Lin, W., Ghinita, G.: Large-scale frequent subgraph mining in mapreduce. In: Proceedings International Conference Data Engineering. pp. 844–855 (2014)
Bhuiyan, M.A.: An iterative mapreduce based frequent subgraph mining algorithm. IEEE Tans. Knowl. Data Eng. pp. 608–620 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Velampalli, S., Jonnalagedda, V.R.M. (2018). Frequent SubGraph Mining Algorithms: Framework, Classification, Analysis, Comparisons. In: Satapathy, S., Bhateja, V., Raju, K., Janakiramaiah, B. (eds) Data Engineering and Intelligent Computing. Advances in Intelligent Systems and Computing, vol 542 . Springer, Singapore. https://doi.org/10.1007/978-981-10-3223-3_31
Download citation
DOI: https://doi.org/10.1007/978-981-10-3223-3_31
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-3222-6
Online ISBN: 978-981-10-3223-3
eBook Packages: EngineeringEngineering (R0)