Ontology-Driven Induction of Decision Trees at Multiple Levels of Abstraction

  • Authors:
  • Jun Zhang;Adrian Silvescu;Vasant G. Honavar

  • Affiliations:
  • -;-;-

  • Venue:
  • Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Most learning algorithms for data-driven induction of pattern classifiers (e.g., the decision tree algorithm), typically represent input patterns at a single level of abstraction - usually in the form of an ordered tuple of attribute values. However, in many applications of inductive learning - e.g., scientific discovery, users often need to explore a data set at multiple levels of abstraction, and from different points of view. Each point of view corresponds to a set of ontological (and representational) commitments regarding the domain of interest. The choice of an ontology induces a set of representatios of the data and a set of transformations of the hypothesis space. This paper formalizes the problem of inductive learning using ontologies and data; describes an ontology-driven decision tree learning algorithm to learn classification rules at multiple levels of abstraction; and presents preliminary results to demonstrate the feasibility of the proposed approach.