scispace - formally typeset
Open AccessJournal ArticleDOI

Expert Systems Rule Induction with Statistical Data

John Mingers
- 01 Jan 1987 - 
- Vol. 38, Iss: 1, pp 39-47
Reads0
Chats0
TLDR
Rule induction has been proposed as a way of speeding up the acquisition of knowledge for expert systems but can only deal with determinate data and extensions to deal with statistical data are explored.
Abstract
Rule induction has been proposed as a way of speeding up the acquisition of knowledge for expert systems. Quinlan's ID3 algorithm has been used successfully but can only deal with determinate data. This paper explores extensions to deal with statistical data.

read more

Content maybe subject to copyright    Report

Kent Academic Repository
Full text document (pdf)
Copyright & reuse
Content in the Kent Academic Repository is made available for research purposes. Unless otherwise stated all
content is protected by copyright and in the absence of an open licence (eg Creative Commons), permissions
for further reuse of content should be sought from the publisher, author or other copyright holder.
Versions of research
The version in the Kent Academic Repository may differ from the final published version.
Users are advised to check http://kar.kent.ac.uk for the status of the paper. Users should always cite the
published version of record.
Enquiries
For any further enquiries regarding the licence status of this document, please contact:
researchsupport@kent.ac.uk
If you believe this document infringes copyright then please contact the KAR admin team with the take-down
information provided at http://kar.kent.ac.uk/contact.html
Citation for published version
Mingers, John (1987) Expert Systems - Rule Induction with Statistical Data. Journal of the Operational
Research Society, 38 (1). pp. 39-47. ISSN 0160-5682.
DOI
Link to record in KAR
https://kar.kent.ac.uk/3782/
Document Version
UNSPECIFIED





Citations
More filters
Journal ArticleDOI

The random subspace method for constructing decision forests

TL;DR: A method to construct a decision tree based classifier is proposed that maintains highest accuracy on training data and improves on generalization accuracy as it grows in complexity.
Journal ArticleDOI

Unbiased Recursive Partitioning: A Conditional Inference Framework

TL;DR: A unified framework for recursive partitioning is proposed which embeds tree-structured regression models into a well defined theory of conditional inference procedures and it is shown that the predicted accuracy of trees with early stopping is equivalent to the prediction accuracy of pruned trees with unbiased variable selection.
Journal ArticleDOI

Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey

TL;DR: This paper surveys existing work on decision tree construction, attempting to identify the important issues involved, directions the work has taken and the current state of the art.
Journal ArticleDOI

An Empirical Comparison of Pruning Methods for Decision Tree Induction

TL;DR: This paper compares five methods for pruning decision trees, developed from sets of examples, and shows that three methods—critical value, error complexity and reduced error—perform well, while the other two may cause problems.
Journal ArticleDOI

A comparative analysis of methods for pruning decision trees

TL;DR: A comparative study of six well-known pruning methods with the aim of understanding their theoretical foundations, their computational complexity, and the strengths and weaknesses of their formulation, and an objective evaluation of the tendency to overprune/underprune observed in each method is made.
References
More filters
Journal ArticleDOI

An Exploratory Technique for Investigating Large Quantities of Categorical Data

G. V. Kass
- 01 Jun 1980 - 
TL;DR: The technique set out in the paper, CHAID, is an offshoot of AID (Automatic Interaction Detection) designed for a categorized dependent variable with built-in significance testing, multi-way splits, and a new type of predictor which is especially useful in handling missing information.
Book ChapterDOI

Learning Efficient Classification Procedures and Their Application to Chess End Games

TL;DR: A series of experiments dealing with the discovery of efficient classification procedures from large numbers of examples is described, with a case study from the chess end game king-rook versus king-knight.