Access the full text.
Sign up today, get DeepDyve free for 14 days.
L.G. Valiant (1984)
A theory of the learnableCommun. ACM, 27
Yosi Ben-Dov (1981)
Optimal Testing Procedures for Special Structures of Coherent SystemsManagement Science, 27
J. Quinlan (1987)
Generating Production Rules from Decision Trees
L. Breiman, J. Friedman, R. Olshen, C. Stone (1984)
Classification and Regression TreesBiometrics, 40
J. Halpern (1974)
Fault-testing of a k-out-of-n systemOper. Res., 22
J.Q. Quinlan (1987)
IJCAI '87
Alexander Dockhorn (2017)
Classification Algorithms
D. Angluin, P. Laird (1988)
Learning From Noisy ExamplesMachine Learning, 2
L. Cox, Yuping Qiu, Warren Kuehner (1990)
Heuristic least-cost computation of discrete classification functions with uncertain argument valuesAnnals of Operations Research, 21
D. Fisher (1987)
Knowledge Acquisition Via Incremental Conceptual ClusteringMachine Learning, 2
J.R. Quinlan (1986)
Machine Learning: An Artificial Intelligence Approach
R. Payne, D. Preece (1980)
Identification Keys and Diagnostic Tables: a Review, 143
G. Duncan (1975)
Optimal Diagnostic QuestionnairesOper. Res., 23
J. Halpern (1974)
Technical Note - Fault Testing for a k-out-of-n SystemOper. Res., 22
J. Schlimmer, D. Fisher (1986)
A Case Study of Incremental Concept Induction
M. Segal (1985)
Recursive Partitioning Using Ranks.
Louis CoxJr. (1990)
Pragmatic Information-Seeking Strategies for Expert Classification Systems
C. Colbourn (1987)
The Combinatorics of Network Reliability
David Editor
Artificial Intelligence and Language Processing a Theory of the Learnable
K.S. Fu (1968)
Sequential Methods in Pattern Recognition and Machine Learning
K. Grajski, L. Breiman, G. Prisco, W. Freeman (1986)
Classification of EEG Spatial Patterns with a Tree-Structured Methodology: CARTIEEE Transactions on Biomedical Engineering, BME-33
N. Littlestone (1987)
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold AlgorithmMachine Learning, 2
A. Ciampi (1987)
Biostatistics
L. Gordon, R. Olshen (1985)
Tree-structured survival analysis.Cancer treatment reports, 69 10
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.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Apr 5, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.