Skip to main content
SpringerLink
Log in

Learning mutually dependent relations

  • Published:
Journal of Intelligent Information Systems Aims and scope Submit manuscript

Abstract

So far, the task of learning relations has been concerned with the acquisition of intensional descriptions of unrelated concepts. However, in many real domains concepts are strictly related to each other and the instances of one of them cannot possibly be recognized without previous recognition of other objects as instances of related concepts. A typical case is the problem of labeling parts of a scene in order to interprete it. This paper extends in several ways the learning relations paradigm; in particular, a new methodology, allowing a recursive theory to be inferred from a set of examples, is presented. Each example may contain instances of several relations at the same time. The learning algorithm works bottom up, creating first an acyclic graph that classifies all the instances in the training set. Afterward, a recursive theory is synthesized from the graph. A prototype implementation of the algorithm has been realized by extending the program ML-SMART. The results obtained for an artificial labeling problem are described and discussed.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Apt, K. and Bezem, M. (1990). Acyclic programs.Proc. 7th. Conf. Logic Programming, (pp. 617–633). Jerusalem, Israel.

  • Apt, K., Blair, H., and Walker, A. (1986). Towards a theory of declarative knowledge.Proc. Workshop on Foundations of Deductive Databases and Logic Programming. Washington, D.C.

  • Bergadano, F., Giordana, A., and Saitta, L. (1988). Automated Concept Acquisition in Noisy Environments.IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-10, 555–575.

    Google Scholar 

  • Bergadano, F., Giordana, A., and Saitta, L. (1991).Machine Learning: An Integrated Framework and Its Applications. Chichester, UK: Ellis Horwood.

    Google Scholar 

  • Bergadano, F., and Giordana, A. (1988). A knowledge intensive approach to concept induction.Proc. 5th Int. Conf. Machine Learning, (pp. 305–317). Ann Arbor, MI.

  • Botta, M., Giordana, A., and Saitta, L. (1992). Comparison of search strategies in learning relations.Proc. ECAI-92. Vienna, Austria.

  • Console, L., Giordana, A., and Saitta, L. (1991). Investigating the relationships between abduction and inverse resolution in propositional calculus.Proc. ISMIS-91. (pp. 316–325). Charlotte, NC.

  • Console, L., and Saitta, L. (1992). An analysis of non-truth preserving mechanisms in learning.Proc. COMPULOG Workshop. London, UK.

  • Faure, C, Frediani, S., and Saitta, L. (to appear). A semi-automated methodology for knowledge acquisition.IEEE Transactions on Systems, Man and Cybernetics.

  • Michalski, R.S. (1980). Pattern Recognition as Rule-Guided Inductive Inference.IEEE Transactions on Pattern Analysis and Machine Intelligence, 2, 349–361.

    Google Scholar 

  • Mitchell, T., Keller, R., and Kedar-Cabelli, S. (1986). Explanation-based Generalization: A Unifying View.Machine Learning, 1, 47–80.

    Google Scholar 

  • Muggleton, S. (1987). Duce, an Oracle based approach to constructive induction.Proc. IJCAI-87. (pp. 287–292). Milano, Italy.

  • Muggleton, S. and Buntine, W. (1988). Machine invention of first-order predicates by inverting resolution.Proc. Fifth Int. Conf. Machine Learning, (pp. 339–352). Ann Arbor, MI.

  • Quinlan, R. (1990). Learning Logical Definitions from Relations.Machine Learning, 5, 239–266.

    Google Scholar 

  • Quinlan, R. (1991). Determinate literals as an aid in inductive logic programming.Proc. IJCAI-91. (pp. 746–750). Sidney, Australia.

  • Rouveirol, C. and Fuget J.F. (1990). Beyond inversion of resolution.Proc. Seventh Int. Conf. Machine Learning, (pp. 122–131). Austin, TX.

  • Sammut, C. and Banerji, R. (1986). Learning Concepts by asking questions. In R. Michalski, J. Carbonell, and T. Mitchell (Eds.),Machine Learning: An Artificial Intelligence Approach, Vol. II. (pp. 167–191). Los Altos, CA: Morgan Kaufmann.

    Google Scholar 

  • Vernazza, G., Serpico, S., Dellepiane, S. (1987). A Knowledge-Based System for Biomedical Image Processing and Recognition.IEEE Transactions on Circuit and Systems. Special issue on Image Processing and Applications, pp. 11399–11416.

  • Wogulis, J. and Langley, P. (1989). Improving efficiency by learning intermediate concepts.Proc. IJCAI-89. (pp. 657–662). Detroit, MI.

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Universitá di Torino, Corso Svizzera 185, 10149, Torino, Italy

    C. Baroglio, A. Giordana & L. Saitta

Authors
  1. C. Baroglio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Giordana
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. L. Saitta
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baroglio, C., Giordana, A. & Saitta, L. Learning mutually dependent relations. J Intell Inf Syst 1, 159–176 (1992). https://doi.org/10.1007/BF00962281

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00962281

Keywords

Search

Navigation