ILP 2011: Inductive Logic Programming pp 389-404

# Polynomial Time Inductive Inference of Cograph Pattern Languages from Positive Data

• Yuta Yoshimura
• Takayoshi Shoudai
• Yusuke Suzuki
• Tomoyuki Uchida
• Tetsuhiro Miyahara
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7207)

## Abstract

A cograph (complement reducible graph) is a graph which can be generated by disjoint union and complement operations on graphs, starting with a single vertex graph. Cographs arise in many areas of computer science and are studied extensively.

With the goal of developing an effective data mining method for graph structured data, in this paper we introduce a graph pattern expression, called a cograph pattern, which is a special type of cograph having structured variables. Firstly, we present a polynomial time matching algorithm for cograph patterns. Secondly, we give a polynomial time algorithm for obtaining a minimally generalized cograph pattern which explains given positive data. Finally, we show that the class of cograph pattern languages is polynomial time inductively inferable from positive data.

## Keywords

Polynomial Time Disjoint Union Internal Node Polynomial Time Algorithm Graph Pattern
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## References

1. 1.
Angluin, D.: Inductive Inference of Formal Languages from Positive Data. Information and Control 45, 117–135 (1980)
2. 2.
Babel, L., Kloks, T., Kratochvíl, J., Kratsch, D., Müller, H., Olariu, S.: Efficient algorithms for graphs with few P 4’s. Discrete Mathematics 235(1-3), 29–51 (2001)
3. 3.
Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement Reducible Graph. Discrete Applied Mathematics 3, 163–174 (1981)
4. 4.
Corneil, D.G., Perl, Y., Stewart, L.K.: A Linear Recognition Algorithm for Cographs. SIAM Journal on Computing 14(4), 926–934 (1985)
5. 5.
Golumbic, C., Mintz, A., Rotics, U.: Factoring and Recognition of Read-Once Functions using Cographs and Normality and the Readability of Functions Associated with Partial k-trees. Discrete Applied Mathematics 154(10), 1465–1477 (2006)
6. 6.
Hopcroft, J., Karp, R.: An n 5/2 algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing 2, 225–231 (1973)
7. 7.
Lokshtanov, D., Mancini, F., Papadopoulos, C.: Characterizing and Computing Minimal Cograph Completions. Discrete Applied Mathematics 158(7), 755–764 (2010)
8. 8.
Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation: Foundations, vol. 1. World Scientific (1997)Google Scholar
9. 9.
Shinohara, T.: Polynomial Time Inductive Inference of Extended Regular Pattern Languages. In: Goto, E., Furukawa, K., Nakajima, R., Nakata, I., Yonezawa, A. (eds.) RIMS 1982. LNCS, vol. 147, pp. 115–127. Springer, Heidelberg (1983)
10. 10.
Suzuki, Y., Shoudai, T., Uchida, T., Miyahara, T.: Ordered Term Tree Languages Which Are Polynomial Time Inductively Inferable from Positive Data. Theoretical Computer Science 350(1), 63–90 (2006)
11. 11.
Takami, R., Suzuki, Y., Uchida, T., Shoudai, T.: Polynomial Time Inductive Inference of TTSP Graph Languages from Positive Data. IEICE Transactions on Information and Systems E92-D(2), 181–190 (2009)
12. 12.
Yamasaki, H., Shoudai, T.: A Polynomial Time Algorithm for Finding a Minimally Generalized Linear Interval Graph Pattern. IEICE Transactions on Information and Systems E92-D(2), 120–129 (2009)

## Authors and Affiliations

• Yuta Yoshimura
• 1
• Takayoshi Shoudai
• 1
• Yusuke Suzuki
• 2
• Tomoyuki Uchida
• 2
• Tetsuhiro Miyahara
• 2
1. 1.Department of InformaticsKyushu UniversityJapan
2. 2.Department of Intelligent SystemsHiroshima City UniversityJapan