Advertisement

Graph Pattern Matching with Expressive Outerplanar Graph Patterns

  • Hitoshi YamasakiEmail author
  • Takashi Yamada
  • Takayoshi Shoudai
Chapter
  • 673 Downloads
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 70)

Abstract

An outerplanar graph is a planar graph that can be embedded in the plane in such a way that all vertices lie on the outer boundary. Outerplanar graphs express many chemical compounds. An externally extensible outerplanar graph pattern (eeo-graph pattern for short) represents a graph pattern common to a finite set of outerplanar graphs, like a dataset of chemical compounds. The eeo-graph pattern can express a substructure common to blocks that appear in outerplanar graph structured data. In this paper, we propose a polynomial time algorithm for deciding whether or not a given eeo-graph pattern matches a given connected outerplanar graph. Moreover, we show the expressiveness of the pattern class by experiments on a chemical compound database.

Keywords

Graph pattern matching Graph mining Outerplanar graphs Chemical graphs 

References

  1. 1.
    Cook, D.J., Holder, L.: Mining Graph Data. Wiley-Interscience, New York (2007) zbMATHGoogle Scholar
  2. 2.
    Developmental Therapeutics Program NCI/NIH: AIDS Antiviral Screen. http://dtp.nci.nih.gov/
  3. 3.
    Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, San Mateo (2001) Google Scholar
  4. 4.
    Horváth, T., Roman, J., Wrobel, S.: Frequent subgraph mining in outerplanar graphs. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 197–206 (2006) Google Scholar
  5. 5.
    Lingas, A.: Subgraph isomorphism for biconnected outerplanar graphs in cubic time. Theoret. Comput. Sci. 63, 295–302 (1989) MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    National Cancer Institute: Chemical dataset. http://cactus.nci.nih.gov/
  7. 7.
    Sasaki, Y., Yamasaki, H., Shoudai, T., Uchida, T.: Mining of frequent block preserving outerplanar graph structured patterns. In: Proceedings of the 17th International Conference on Inductive Logic Programming (ILP2007). Lect. Notes Artif. Intell., vol. 4894, pp. 239–253. Springer, Berlin (2008) CrossRefGoogle Scholar
  8. 8.
    Suzuki, Y., Shoudai, T., Uchida, T., Miyahara, T.: Ordered term tree languages which are polynomial time inductively inferable from positive data. Theoret. Comput. Sci. 350, 63–90 (2006) MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Yamasaki, H., Yamada, T., Shoudai, T.: An expressive outerplanar graph pattern class and its efficient pattern matching algorithm. In: Lecture Notes in Engineering and Computer Science: Proceedings of the International MultiConference of Engineers and Computer Scientists 2010, IMECS 2010, Hong Kong, 17–19 March 2010, pp. 471–477 (2010) Google Scholar
  10. 10.
    Yamasaki, H., Sasaki, Y., Shoudai, T., Uchida, T., Suzuki, Y.: Learning block-preserving graph patterns and its application to data mining. Mach. Learning 76(1), 137–173 (2009) CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  • Hitoshi Yamasaki
    • 1
    Email author
  • Takashi Yamada
    • 2
  • Takayoshi Shoudai
    • 3
  1. 1.Department of InformaticsKyushu UniversityFukuokaJapan
  2. 2.Department of InformaticsKyushu UniversityFukuokaJapan
  3. 3.Department of InformaticsKyushu UniversityFukuokaJapan

Personalised recommendations