Learning with feature description logics

Chad M. Cumby, Dan Roth

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present a paradigm for efficient learning and inference with relational data using propositional means. The paradigm utilizes description logics and concepts graphs in the service of learning relational models using efficient propositional learning algorithms.We introduce a Feature Description Logic (FDL) - a relational (frame based) language that supports efficient inference, along with a generation function that uses inference with descriptions in the FDL to produce features suitable for use by learning algorithms. These are used within a learning framework that is shown to learn efficiently and accurately relational representations in terms of the FDL descriptions. The paradigm was designed to support learning in domains that are relational but where the amount of data and size of representation learned are very large; we exemplify it here, for clarity, on the classical ILP tasks of learning family relations and mutagenesis. This paradigm provides a natural solution to the problem of learning and representing relational data; it extends and unifies several lines of works in KRR and Machine Learning in ways that provide hope for a coherent usage of learning and reasoning methods in large scale intelligent inference.

Original languageEnglish (US)
Title of host publicationInductive Logic Programming
EditorsStan Matwin, Claude Sammut
PublisherSpringer-Verlag Berlin Heidelberg
Pages32-47
Number of pages16
ISBN (Electronic)9783540005674
DOIs
StatePublished - Jan 1 2003
Event12th International Conference on Inductive Logic Programming, ILP 2002 - Sydney, Australia
Duration: Jul 9 2002Jul 11 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2583
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Conference on Inductive Logic Programming, ILP 2002
CountryAustralia
CitySydney
Period7/9/027/11/02

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Learning with feature description logics'. Together they form a unique fingerprint.

Cite this