Skip to main content
SpringerLink
Log in
Book cover

Australasian Joint Conference on Artificial Intelligence

AI 2003: AI 2003: Advances in Artificial Intelligence pp 88–99Cite as

Inductive Construction of Ontologies from Formal Concept Analysis

  • Conference paper

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

Abstract

We present an approach to representation and structuring of theories and ontologies based on a formalism of propositional logic programs. Formal concept analysis is adopted to identify structure in theories. This structure, in the form of conjunctive concepts and the relations between them, is used for representation change in theories based on feature construction and iterative program transformation. Ontologies are represented as sets of propositional definite clauses containing named concepts having a superclass–subclass relationship derived from a concept lattice built using formal concept analysis. Logic programming methods are used to incrementally construct and revise such ontologies. An information compression measure is used to guide the operation of structuring theories and ontologies. The clauses defining the ontology are proved to preserve the relationships which hold between formal concepts in the concept lattice. This framework enables inheritance inference not possible from the structured theories alone. Experimental results are presented from an application to a sample of descriptions of computer science academics’ research interests and a reconstruction experiment on randomly generated theories with added noise.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bain, M.: Structured Features from Concept Lattices for Unsupervised Learning and Classification. In: McKay, B., Slaney, J.K. (eds.) Canadian AI 2002. LNCS (LNAI), vol. 2557, pp. 557–568. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Foo, N.: Ontology Revision. In: Ellis, G., Levinson, R., Rich, W., Sowa, J. (eds.) ICCS 1995. LNCS (LNAI), vol. 954, pp. 1–14. Springer, Heidelberg (1995)

    Google Scholar 

  3. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin (1999)

    MATH  Google Scholar 

  4. Hogger, C.J.: Essentials of Logic Programming. Clarendon Press, Oxford (1990)

    MATH  Google Scholar 

  5. Kim, M., Compton, P.: Incremental Development of Domain-Specific Document Retrieval Systems. In: Handschuh, S., Dieng-Kuntz, R., Staab, S. (eds.) Proceedings of the First International Conference on Knowledge Capture, Calgary, University of Calgary, pp. 69–77 (2001)

    Google Scholar 

  6. Kwok, R.: Formalising Aspects of Theoretical Term Usage. PhD thesis, University of Sydney, Sydney, Australia (1998)

    Google Scholar 

  7. Lloyd, J.W.: Logic Programming, 2nd edn. Springer, Berlin (1987)

    MATH  Google Scholar 

  8. Muggleton, S.: Inverse Entailment and Progol. New Generation Computing 13, 245–286 (1995)

    Article  Google Scholar 

  9. Fridman Noy, N., McGuinness, D.L.: Ontology Development 101: A Guide to Creating Your First Ontology. Technical Report KSL-01-05, Knowledge Systems Laboratory, Stanford University, CA (2001)

    Google Scholar 

  10. Richards, T.: Clausal Form Logic: An Introduction to the Logic of Computer Reasoning. Addison-Wesley, Wokingham (1989)

    MATH  Google Scholar 

  11. Roychoudhury, A., Kumar, K.N., Ramakrishnan, C.R., Ramakrishnan, I.V.: Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. International Journal on Foundations of Computer Science 13(3), 387–403 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Schultze-Kremer, S.: Ontologies for Molecular Biology. Pacific Symposium on Biocomputing 3, 693–704 (1998)

    Google Scholar 

  13. Zupan, B.: Machine learning based on function decomposition. PhD thesis, University of Ljubljana, Slovenia (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, University of New South Wales, Sydney, NSW 2052, Australia

    Michael Bain

Authors
  1. Michael Bain
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Australian National University, ACT 0200, Acton, Australia

    Tamás (Tom) Domonkos Gedeon

  2. Murdoch University,  

    Lance Chun Che Fung

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bain, M. (2003). Inductive Construction of Ontologies from Formal Concept Analysis. In: Gedeon, T.(.D., Fung, L.C.C. (eds) AI 2003: Advances in Artificial Intelligence. AI 2003. Lecture Notes in Computer Science(), vol 2903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24581-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24581-0_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20646-0

  • Online ISBN: 978-3-540-24581-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation