Incorporating statistical information into expert classification systems to reduce classification costs

Interactive expert systems seek relevant information from a user in order to answer a query or to solve a problem that the user has posed. A fundamental design issue for such a system is therefore itsinformation-seeking strategy, which determines the order in which it asks questions or performs experiments to gain the information that it needs to respond to the user. This paper examines the problem of “optimal” knowledge acquisition through questioning in contexts where it is expensive or time-consuming to obtain the answers to questions. An abstract model of an expert classification system — considered as a set of logical classification rules supplemented by some statistical knowledge about attribute frequencies — is developed and applied to analyze the complexity and to present constructive algorithms for doing probabilistic question-based classification. New heuristics are presented that generalize previous results for optimal identification keys and questionnaires. For an important class of discrete discriminant analysis problems, these heuristics find optimal or near-optimal questioning strategies in a small fraction of the time required by an exact solution algorithm.

[1]  L. A. Cox,et al.  Heuristic least-cost computation of discrete classification functions with uncertain argument values , 1990 .

[2]  D. Angluin,et al.  Learning From Noisy Examples , 1988, Machine Learning.

[3]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[4]  Leo Breiman,et al.  Classification and Regression Trees , 1984 .

[5]  Douglas H. Fisher,et al.  Knowledge Acquisition Via Incremental Conceptual Clustering , 1987, Machine Learning.

[6]  Douglas H. Fisher,et al.  A Case Study of Incremental Concept Induction , 1986, AAAI.

[7]  R. Olshen,et al.  Tree-structured survival analysis. , 1985, Cancer treatment reports.

[8]  George T. Duncan,et al.  Optimal Diagnostic Questionnaires , 1975, Oper. Res..

[9]  Walter J. Freeman,et al.  Classification of EEG Spatial Patterns with a Tree-Structured Methodology: CART , 1986, IEEE Transactions on Biomedical Engineering.

[10]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[11]  N. Littlestone.  Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[12]  Jonathan Halpern.  Technical Note - Fault Testing for a k-out-of-n System , 1974, Oper. Res..

[13]  D. A. Preece,et al.  Identification Keys and Diagnostic Tables: a Review , 1980 .

[14]  M. Segal.  Recursive Partitioning Using Ranks. , 1985 .

[15]  Yosi Ben-Dov.  Optimal Testing Procedures for Special Structures of Coherent Systems , 1981 .

[16]  Louis Anthony CoxJr.  Pragmatic Information-Seeking Strategies for Expert Classification Systems , 1990 .

[17]  Mike James,et al.  Classification Algorithms , 1986, Encyclopedia of Machine Learning and Data Mining.

[18]  J. Ross Quinlan,et al.  Generating Production Rules from Decision Trees , 1987, IJCAI.