首页> 外文学位 >The application of information theory to problems in decision tree design and rule-based expert systems
【24h】

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

机译:信息论在决策树设计和基于规则的专家系统中的应用

获取原文
获取原文并翻译 | 示例

摘要

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 of 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-likelihood 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.
机译:本文从信息论的角度探讨了决策树和专家系统的设计问题。分析了一种使用互信息进行树设计的贪婪算法。开发了树木设计的基本模型,从而导致了一系列与树木性能参数相关的界限。与前缀编码和速率失真理论的类比导致有趣的解释和结果。在较早导出的理论模型的背景下讨论了为此类贪婪算法找到终止规则的问题,并以此方式解释了一些实验观察到的现象。在涉及字母数字LED和局部边缘检测的两个分类实验中,与其他技术相比,分层方法被认为具有明显的优势。本论文的第二部分从分析基于规则的专家系统的设计难度开始。无法有效地对不确定性进行建模是现有方法的主要局限性。因此,开发了用于规则和基于规则的系统的信息理论模型。从规则信息内容的简单定义,就可以定量地实现专门化和泛化(类似于认知过程)的能力。提出了通用规则归纳的问题,并描述了从数据中得出最佳规则集的ITRULE算法。讨论了推理网络中概率更新的问题,并基于有界概率提出了一种新的最大似然规则。效用函数和统计决策理论概念用于开发基于规则的推理的隐式控制模型。通过从专家提供的数据中得出规则并基于决策理论标准执行前后链接来证明该理论。本文的结论是概述了该领域仍需解决的许多问题,并简要讨论了基于规则的推理网络与神经网络之间的类比。

著录项

  • 作者

    Smyth, Padhraic.;

  • 作者单位

    California Institute of Technology.;

  • 授予单位 California Institute of Technology.;
  • 学科 Electrical engineering.;Computer science.
  • 学位 Ph.D.
  • 年度 1988
  • 页码 223 p.
  • 总页数 223
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号