Skip to main content
Springer Nature Link
Log in

Mining Common Patterns on Graphs

  • Conference paper
Computational Intelligence and Security (CIS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3801))

Included in the following conference series:

  • 1335 Accesses

Abstract

Finding common patterns is an important problem for several computer science subfields such as Machine Learning (ML) and Data Mining (DM). When we use graph-based representations, we need the Subgraph Isomorphism (SI) operation for finding common patterns. In this research we present a new approach to find a SI using a list code based representation without candidate generation. We implement a step by step expansion model with a width-depth search. The proposed approach is suitable to work with labeled and unlabeled graphs, with directed and undirected edges. Our experiments show a promising method to be used with scalable graph matching.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Cook, D.J., Holder, L.B.: Substructure discovery using minimum description length and background knowledge. Journal of Artificial Intelligence Research 1, 231–255 (1994)

    Google Scholar 

  2. Inokuchi, A., Washio, T., Motoda, H.: Complete Mining of Frequent Patterns from Graphs: Mining Graph Data. Machine Learning, 321–354 (2003)

    Google Scholar 

  3. Xifeng, Y., Jiawei, H.: gSpan: Graph – Based Substructure Pattern Mining. Technical Report. University of Illinois (2002)

    Google Scholar 

  4. Shayan, G., Sudarshan, S.C.: SEuS: Structure Extraction using Summaries. Technical Report. C. S. Department, University of Maryland (2002)

    Google Scholar 

  5. Kuramochi, M., Karypis, G.: An Efficient Algorithm for discovering Frequent Subgraphs. Tech. Report. Dept. of Computing Science, University of Minnesota (June 2002)

    Google Scholar 

  6. Michael, G.R., David, J.S.: Computers and Intractability, A Guide to the theory of NP-Completeness. W. H. Freeman and Company, New York (2003)

    Google Scholar 

  7. Zaki, M.J.: Efficiently Mining Trees in a Forest. Tech. Report 01-7, Computer Science Department, Rensselaer Polytechnic Institute (2001)

    Google Scholar 

  8. Diestel, R.: Graph Theory, 2nd edn. Springer, Heidelberg (2000)

    Google Scholar 

  9. Thulasiraman, K., Swamy, M.N.S.: Graphs: Theory and Algorithms, p. 460. Wiley – Interscience, Chichester (1992)

    MATH  Google Scholar 

  10. Liu, C.L.: Elements of Discrete Mathematics, 2nd edn. McGraw Hill, New York (1985)

    MATH  Google Scholar 

  11. Olmos, I., Gonzalez, J.A., Osorio, M.: Subgraph Isomorphism Detection using a Code Based Representation. In: Proceedings of the 18th FLAIRS Conference (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto Nacional de Astrofísica, Óptica y Electrónica, Luis Enrique Erro #1, Sta. Maria Tonantzintla, Puebla, México

    Ivan Olmos & Jesus A. Gonzalez

  2. Universidad de las Américas Puebla, Sta. Catarina Mártir, Puebla, México

    Mauricio Osorio

Authors
  1. Ivan Olmos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jesus A. Gonzalez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mauricio Osorio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microelectronic Instiute, Xidian University, 710071, Xi’an, China

    Yue Hao

  2. Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong

    Jiming Liu

  3. School of Computer Science and Technology, Xidian University, Xi’an, China

    Yuping Wang

  4. Department of Computer Science, Hong Kong Baptist University, Hong Kong,  

    Yiu-ming Cheung

  5. School of Electrical and Electronic Engineering, University of Manchester, UK

    Hujun Yin

  6. Life Science Research Center, School of Electronic Engineering, Xidian University, 710071, Xi’an, Shaanxi, China

    Licheng Jiao

  7. Key Laboratory of Computer Networks and Information Security (Ministry of Education), Xidian University, 710071, Xi’an, China

    Jianfeng Ma

  8. National Laboratory of Antennas and Microwave Technology, Xidian University, 710071, Xi’an, Shanxi, P.R. China

    Yong-Chang Jiao

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Olmos, I., Gonzalez, J.A., Osorio, M. (2005). Mining Common Patterns on Graphs. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_6

Download citation

  • DOI: https://doi.org/10.1007/11596448_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30818-8

  • Online ISBN: 978-3-540-31599-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation