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.
This is a revised and extended version of a paper [9] presented at the International MultiConference of Engineers and Computer Scientists, Hong Kong, 2010.
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
References
Cook, D.J., Holder, L.: Mining Graph Data. Wiley-Interscience, New York (2007)
Developmental Therapeutics Program NCI/NIH: AIDS Antiviral Screen. http://dtp.nci.nih.gov/
Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, San Mateo (2001)
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)
Lingas, A.: Subgraph isomorphism for biconnected outerplanar graphs in cubic time. Theoret. Comput. Sci. 63, 295–302 (1989)
National Cancer Institute: Chemical dataset. http://cactus.nci.nih.gov/
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)
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)
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)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media B.V.
About this chapter
Cite this chapter
Yamasaki, H., Yamada, T., Shoudai, T. (2011). Graph Pattern Matching with Expressive Outerplanar Graph Patterns. In: Ao, SI., Castillo, O., Huang, X. (eds) Intelligent Control and Computer Engineering. Lecture Notes in Electrical Engineering, vol 70. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-0286-8_19
Download citation
DOI: https://doi.org/10.1007/978-94-007-0286-8_19
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-0285-1
Online ISBN: 978-94-007-0286-8
eBook Packages: EngineeringEngineering (R0)