Skip to main content
SpringerLink
Log in

A New Framework for Discovering Knowledge from Two-Dimensional Structured Data Using Layout Formal Graph System

  • Conference paper
  • First Online:
Algorithmic Learning Theory (ALT 2000)

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

Included in the following conference series:

Abstract

We present a new framework for discovering knowledge from two-dimensional structured data by using Inductive Logic Programming. Two-dimensional graph structured data such as image or map data are widely used for representing relations and distances between various objects. First, we define a layout term graph suited for representing twodimensional graph structured data. A layout term graph is a pattern consisting of variables and two-dimensional graph structures. Moreover, we propose Layout Formal Graph System (LFGS) as a new logic programming system having a layout term graph as a term. LFGS directly deals with graphs having positional relations just like first order terms. Second, we show that LFGS is more powerful than Layout Graph Grammar, which is a generating system consisting of a context-free graph grammar and positional relations. This indicates that LFGS has the richness and advantage of representing knowledge about two-dimensional structured data.

Finally, we design a knowledge discovery system, which uses LFGS as a knowledge representation language and refutably inductive inference as a learning method. In order to give a theoretical foundation of our knowledge discovery system, we give the set of weakly reducing LFGS programs which is a sufficiently large hypothesis space of LFGS programs and show that the hypothesis space is refutably inferable from complete data.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. J. Brandenburg. Designing graph drawings by layout graph grammars. Proc. Graph Drawing’ 94, Lecture Notes in Computer Science, Vol. 894:416–427, 1994. 143, 149, 153

    Google Scholar 

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

    Google Scholar 

  3. P. Finn, S. Muggleton, D. Page, and A. Srinivasan. Pharmacophore discovery using the inductive logic programming system progol. Machine Learning, pages 241–270, 1998. 142

    Google Scholar 

  4. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979. 147

    Google Scholar 

  5. A. Habel and H.-J. Kreowski. May we introduce to you: hyperedge replacement. Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science, LNCS 291, pages 15–26, 1987. 149, 151

    Google Scholar 

  6. D. Janssens and G. Rozenberg. On the structure of node-label-controlled graph languages. Information Sciences, 20:191–216, 1980. 151

    Article  MATH  MathSciNet  Google Scholar 

  7. J. W. Lloyd. Foundations of Logic Programming, Second, Extended Edition. Springer-Verlag, 1987. 149

    Google Scholar 

  8. T. Miyahara, T. Shoudai, T. Uchida, T. Kuboyama, K. Takahashi, and H. Ueda. Discovering new knowledge from graph data using inductive logic programming. Proc. ILP-99, Springer-Verlag, LNAI 1634, pages 222–233, 1999. 142, 153

    Google Scholar 

  9. T. Miyahara, T. Uchida, T. Kuboyama, T. Yamamoto, K. Takahashi, and H. Ueda. KD-FGS: a knowledge discovery system from graph data using formal graph system. Proc. PAKDD-99, Springer-Verlag, LNAI 1574, pages 438–442, 1999. 142, 153

    Google Scholar 

  10. S. Muggleton, A. Srinivasan, R.D. King, and M.J.E Sternberg. Biochemical knowledge discovery using inductive logic programming. Proc. DS-98, Springer-Verlag, LNAI 1532, pages 326–341, 1998. 142

    Google Scholar 

  11. Y. Mukouchi and S. Arikawa. Towards a mathematical theory of machine discovery from facts. Theoretical Computer Science, 137:53–84, 1995. 153, 154

    Article  MATH  MathSciNet  Google Scholar 

  12. L. R. Quinlan. Induction of decision trees. Machine Learning 1, pages 81–106, 1986. 142

    Google Scholar 

  13. J. Rissanen. Modeling by the shortest data description. Automatica 14, pages 465–471, 1978. 143

    Article  MATH  Google Scholar 

  14. T. Shinohara. Rich classes inferable from positive data: length-bounded elementary formal systems. Information and Computation, 108:175–186, 1994. 154

    Article  MATH  MathSciNet  Google Scholar 

  15. T. Uchida, T. Miyahara, and Y. Nakamura. Formal graph systems and node-label controlled graph grammars. Proc. 41st Inst. Syst. Control and Inf. Eng., pages 105–106, 1997. 151, 153

    Google Scholar 

  16. T. Uchida, T. Shoudai, and S. Miyano. Parallel algorithm for refutation tree problem on formal graph systems. IEICE Transactions on Information and Systems, E78-D(2):99–112, 1995. 142, 145, 149

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Information Sciences, Hiroshima City University, 731-3194, Hiroshima, Japan

    Tomoyuki Uchida, Yuko Itokawa, Tetsuhiro Miyahara & Yasuaki Nakamura

  2. Department of Informatics, Kyushu University, 39, Kasuga, 816-8580, Japan

    Takayoshi Shoudai

Authors
  1. Tomoyuki Uchida
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuko Itokawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Takayoshi Shoudai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tetsuhiro Miyahara
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yasuaki Nakamura
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, Kyushu University, Hakozaki 6-10-1, 812-8581, Fukuoka, Japan

    Hiroki Arimura

  2. School of Computing, National University of Singapore, 3 Science Drive 2, 117543, Singapore, Singapore

    Sanjay Jain

  3. School of Computer Science and Engineering, The University of New South Wales, 2052, Sydney, Australia

    Arun Sharma

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Uchida, T., Itokawa, Y., Shoudai, T., Miyahara, T., Nakamura, Y. (2000). A New Framework for Discovering Knowledge from Two-Dimensional Structured Data Using Layout Formal Graph System. In: Arimura, H., Jain, S., Sharma, A. (eds) Algorithmic Learning Theory. ALT 2000. Lecture Notes in Computer Science(), vol 1968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40992-0_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-40992-0_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41237-3

  • Online ISBN: 978-3-540-40992-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation