ACM Home Page
Please provide us with feedback. Feedback
Case-based learning in inductive inference
Full text PdfPdf (538 KB)
Source Annual Workshop on Computational Learning Theory archive
Proceedings of the fifth annual workshop on Computational learning theory table of contents
Pittsburgh, Pennsylvania, United States
Pages: 218 - 223  
Year of Publication: 1992
ISBN:0-89791-497-X
Author
Klaus P. Jantke  Technische Hochschule Leipzig, FB Mathematik & Informatik, O-7030 Leipzig, Germany
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 43,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/130385.130409
What is a DOI?

ABSTRACT

There is proposed a formalization of case-based learning in terms of recursion-theoretic inductive inference. This approach is directly derived from some recently published case-based learning algorithms. The intention of the present paper is to exhibit the relationship between case-based learning and inductive inference and to specify this relation with mathematical precision. In particular, it is the author's intention to invoke inductive inference results for pointing to the crucial questions in case-based learning which allow to improve the power of case-based learning algorithms considerably. There are formalized several approaches to case-based learning. First, they vary in the way of presenting cases to a learning algorithm. Second, they are different with respect to the underlying semantics of case bases together with similarity measures. Third, they are distinguished by the flexibility in using similarity functions. The investigations presented relate the introduced learning types to identification types in recursion-theoretic inductive inference.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
Aha91
David W. Aha Case-Based Learning Algorithms in: Proc. DARPA Workshop on Case-based Reasoning, Morgan Kaufmann Publ., 1991, 147-157
 
AKA91
AS83
 
Jan91
 
JB81
Klaus P. Jantke and Hans-Rainer Beick Combining Postulates of Naturalness in Inductive Inference EIK 17 (1981) 8/9, 465484