Advertisement

Efficient Isomorphic Decision for Mining Sub Graphs with a Cyclic Form

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 215)

Abstract

Graph mining means a series of processes for finding frequent sub-graphs in graph databases with complex structures. To obtain useful sub-graphs, isomorphic decision is needed since one graph data can contain lots of duplicated patterns. Therefore, we need to consider only patterns without duplications. However, these operations can cause enormous overheads due to knotty characteristics of graphs, which is called NP-hard problem. In addition, there also exists a problem that exponentially increases the number of unnecessary operations whenever any pattern size grows. In this paper, we propose a method that enhances efficiency of isomorphic decision in cyclic graphs based on a state-of-the-art algorithm, Gaston, which is called Egaston-CS (Efficient gaston for Cyclic-edge and Spanning-tree). In experiments, we compare our algorithm with previous algorithms, and thereby we demonstrate that Egaston-CS outperforms the others in terms of isomorphic decision.

Keywords

Sub graph mining Cyclic graph Pattern expansion Graph isomorphic decision 

Notes

Acknowledgments

This research was supported by the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (NRF No. 2012-0003740 and 2012-0000478).

References

  1. 1.
    Bifet A, Holmes G, Pfahringer B, Gavalda R (2011) Mining frequent closed graphs on evolving data streams. In: KDD’11 Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining, pp 591–599Google Scholar
  2. 2.
    Bogdanov P, Mongiovi M, Singh AK (2011) Mining heavy subgraphs in time-evolving networks. ICDM, pp 81–90Google Scholar
  3. 3.
    Günnemann S, Seidl T (2010) Subgraph mining on directed and weighted graphs. PAKDD 6119:133–146Google Scholar
  4. 4.
    Han J, Kamber M (2005) Data mining: concepts and techniques. Morgan Kaufmann, Publishers, San FranciscoGoogle Scholar
  5. 5.
    Lahiri M, Berger TY (2010) Periodic subgraph mining in dynamic networks. Knowl Inf Syst 24(3):467–497Google Scholar
  6. 6.
    Lini T, Thomas SR, Valluri KK (2006) MARGIN: Maximal frequent Subgraph mining. ICDM, pp 1097–1101Google Scholar
  7. 7.
    Nijssen S, Kok JN (2005) The Gaston tool for frequent subgraph mining. Electron Notes Theor Comput Sci 127(1):77–87Google Scholar
  8. 8.
    Nijssen S, Kok JN (2004) A quickstart in frequent structure mining can make a difference, In: Proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining, pp 647–652Google Scholar
  9. 9.
    Silva A, Meira W Jr, Zaki MJ (2012) Mining attribute-structure correlated patterns in large attributed graphs. PVLDB 5(5):466–477Google Scholar
  10. 10.
    Yan X, Han J (2002) gSpan: graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE international conference on data mining, pp 721–724Google Scholar
  11. 11.
    Zhiwen Y, Zhiyong Y, Xingshe Z, Christian B, Yuichi N (2012) Tree-based mining for discovering patterns of human interaction in meetings. IEEE Trans Knowl Data Eng 24(4):759–768CrossRefGoogle Scholar
  12. 12.
    Zou Z, Li J, Gao H, Zhang S (2010) Mining frequent subgraph patterns from uncertain graph data. IEEE Trans Knowl Data Eng 22(9):1203–1218Google Scholar
  13. 13.
    Zhu F, Yan X, Han J Yu PS (2007) gPrune: a constraint pushing framework for graph pattern mining. In: Proceeding 2007 Pacific-Asia conference on knowledge discovery and data mining (PAKDD’07), pp 388–400Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  1. 1.Department of Computer ScienceChungbuk National UniversityHeungdeok-guRepublic of Korea

Personalised recommendations