CaltechTHESIS
  A Caltech Library Service

The application of information theory to problems in decision tree design and rule-based expert systems

Citation

Smyth, Padhraic (1988) The application of information theory to problems in decision tree design and rule-based expert systems. Dissertation (Ph.D.), California Institute of Technology. http://resolver.caltech.edu/CaltechETD:etd-02022007-103549

Abstract

This thesis examines the problems of designing decision trees and expert systems from an information-theoretic viewpoint. A well-known greedy algorithm using mutual information for tree design is analysed. A basic model for tree design is developed leading to a series of bounds relating tree performance parameters. Analogies with prefix-coding and rate-distortion theory lead to interesting interpretations and results. The problem of finding termination rules for such greedy algorithms is discussed in the context of the theoretical models derived earlier, and several experimentally observed phenomena are explained in this manner. In two classification experiments, involving alphanumeric LEDS and local edge detection, the hierarchical approach is seen to offer significant advantages over alternative techniques.

The second part of the thesis begins by analysing the difficulties in designing rule-based expert systems. The inability to model uncertainty in an effective manner is identified as a key limitation of existing approaches. Accordingly, an information-theoretic model for rules and rule-based systems is developed. From a simple definition of rule information content, the ability to specialise and generalise (akin to cognitive processes) in a quantitative manner is demonstrated. The problem of generalised rule induction is posed and the ITRULE algorithm is described which derives optimal rule sets from data. The problem of probabilistic updating in inference nets is discussed and a new maximum-likelihhod rule is proposed based on bounded probabilities. Utility functions and statistical decision theory concepts are used to develop a model of implicit control for rule-based inference. The theory is demonstrated by deriving rules from expert-supplied data and performing backward and forward chaining based on decision-theoretic criteria. The thesis concludes by outlining the many problems which remain to be solved in this area, and by briefly discussing the analogies between rule-based inference nets and neural networks.

Item Type:Thesis (Dissertation (Ph.D.))
Degree Grantor:California Institute of Technology
Division:Engineering and Applied Science
Major Option:Electrical Engineering
Thesis Availability:Restricted to Caltech community only
Research Advisor(s):
  • Goodman, Rodney M.
Thesis Committee:
  • Goodman, Rodney M. (chair)
  • Posner, Edward C.
  • Hopfield, John J.
  • McEliece, Robert J.
  • Abu-Mostafa, Yaser S.
Defense Date:17 May 1988
Record Number:CaltechETD:etd-02022007-103549
Persistent URL:http://resolver.caltech.edu/CaltechETD:etd-02022007-103549
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:462
Collection:CaltechTHESIS
Deposited By: Imported from ETD-db
Deposited On:15 Feb 2007
Last Modified:26 Dec 2012 02:29

Thesis Files

[img] PDF (Smyth_p_1988.pdf) - Final Version
Restricted to Caltech community only
See Usage Policy.

8Mb

Repository Staff Only: item control page