Skip to main content

An approach to data-driven learning

  • Part II Selected Contributions
  • Conference paper
  • First Online:
Fundamentals of Artificial Intelligence Research (FAIR 1991)

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

Abstract

In the present paper a data-driven approach to learning is described. The approach is discussed in the framework of the Net-Clause Language (NCL), which is also outlined. NCL is aimed at building network models and describes distributed computational schemes. It also exhibits sound semantics as a data-driven deductive system. The proposed learning scheme falls in the class of methods for learning from examples and the learning strategy used is instance-to-class generalization. Two basic examples are discussed giving the underlying ideas of using NCL for inductive concept learning and learning semantic networks.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Genesereth, M.R., N.J. Nilsson, Logical foundations of Artificial Intelligence, Morgan Kaufmann, Los Altos, 1987.

    Google Scholar 

  2. Shapiro, E.Y., Inductive inference of theories form facts, Tech. Rept.192, Department of Computer Science, Yale University, New Haven, CT (1981).

    Google Scholar 

  3. Shapiro, E.Y., Algorithmic Program Debugging (MIT Press, Cambridge, MA, 1983).

    Google Scholar 

  4. De Raedt, L. and M. Bruynooghe, On Negation and Three-valued Logic in Interactive Concept-Learning, in: Proceedings of ECAI-90, Stockholm, Sweden, August 6–10, 1990, pp.207–212.

    Google Scholar 

  5. Markov, Z., A framework for network modeling in Prolog, in: Proceedings of IJCAI-89, Detroit, U.S.A (1989), 78–83, Morgan Kaufmann.

    Google Scholar 

  6. Markov, Z. and C. Dichev and L. Sinapova, The Net-Clause Language — a tool for describing network models, in: Proceedings of the Eighth Canadian Conference on AI, Ottawa, Canada, 23–25 May, 1990, 33–39.

    Google Scholar 

  7. Markov, Z. & Ch. Dichev. The Net-Clause Language — A Tool for Data-Driven Inference, In: Logics in AI, Proceedings of European Workshop JELIA'90, Amsterdam, The Netherlands, September 1990, pp. 366–385 (Lecture Notes in Computer Science, No.478, Springer-Verlag, 1991).

    Google Scholar 

  8. Markov, Z., L. Sinapova and Ch. Dichev. Default reasoning in a network environment, in: Proceedings of ECAI-90, Stockholm, Sweden, August 6–10, 1990, pp.431–436.

    Google Scholar 

  9. Hinton, G.E. Learning distributed representations of concepts. In: Proceedings of the Eight Annual Conference of the Cognitive Science Society, Amherst, MA: Lawrence Erlbaum, 1986.

    Google Scholar 

  10. Quinlan, J.R. Learning logical definitions from relations. Machine Learning, Vol5, No.3, August 1990, pp.239–266. Kluwer Academic Publishers, Boston.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Philippe Jorrand Jozef Kelemen

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Markov, Z. (1991). An approach to data-driven learning. In: Jorrand, P., Kelemen, J. (eds) Fundamentals of Artificial Intelligence Research. FAIR 1991. Lecture Notes in Computer Science, vol 535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54507-7_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-54507-7_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54507-1

  • Online ISBN: 978-3-540-38420-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics