Integrating rules and cases for the classification task
Lecture notes in computer sciencePublished 1 January 1995
Jerzy Surma, Koen Vanhoof
Citations52
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A very rudimentary kind of integration for the classification task, based on simple heuristics, is sketched: “To solve a problem, first try to use the conventional rule-based approach, if it does not work, try to remember a similar problem you have solved in the past and adapt the old solution to the new situation”.
Abstract
The recent progress in Case- Based Reasoning has shown that one of the most important challenges in developing future AI methods will be to combine and synergistically utilize general and case-based knowledge. In this paper a very rudimentary kind of integration for the classification task, based on simple heuristics, is sketched: "To solve a problem, first try to use the conventional rule-based approach. If it does not work, try to remember a similar problem you have solved in the past and adapt the old solution to the new situation". This heuristic approach is based on the knowledge base that consists of rule base and exception case base. The method of generating this kind of knowledge base from a set of examples is described. The proposed approach is tested, and compared with alternative approaches. The experimental results show that the presented integration method can lead to an improvement in accuracy and comprehensibility.
Keywords
Computer Science
C4.5: Programs for Machine Learning
23,665 Citations1992J. R. Quinlan
A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting.
Psychology Press eBooksInside Case-Based Reasoning
1,409 Citations2013Christopher K. Riesbeck, Roger C. Schank
CBR tends to be a good approach for rich, complex domains in which there are myriad ways to generalize a case, and is similar to the rule-induction algorithms of machine learning.
Machine LearningIncremental Induction of Decision Trees
790 Citations1989Paul E. Utgoff
An incremental algorithm for inducing decision trees equivalent to those formed by Quinlan's nonincremental ID3 algorithm, given the same training instances is presented, named ID5R.
Machine LearningA Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features
663 Citations1993Scott Cost, Steven L. Salzberg
A nearest neighbor algorithm for learning in domains with symbolic features, which produces excellent classification accuracy on three problems that have been studied by machine learning researchers: predicting protein secondary structure, identifying DNA promoter sequences, and pronouncing English text.
International Journal of Man-Machine StudiesTolerating noisy, irrelevant and novel attributes in instance-based learning algorithms
406 Citations1992David W. Aha
This paper presents a comprehensive sequence of three incremental, edited nearest neighbor algorithms that tolerate attribute noise, determine relative attribute relevances, and accept instances described by novel attributes.
Machine LearningA weighted nearest neighbor algorithm for learning with symbolic features
371 Citations1993Scott Cost, Steven L. Salzberg
A nearest neighbor algorithm for learning in domains with symbolic features, which produces excellent classification accuracy on three problems that have been studied by machine learning researchers: predicting protein secondary structure, identifying DNA promoter sequences, and pronouncing English text.
Elsevier eBooksUsing Decision Trees to Improve Case-Based Learning
252 Citations1993Claire Cardie
Results clearly indicate that decision trees can be used to improve the performance of CBL systems and do so without reliance on potentially expensive expert knowledge.
Elsevier eBooksSelecting Typical Instances in Instance-Based Learning
242 Citations1992Jianping Zhang
This paper presents an instance-based learning approach in which typical instances are selected to store as concept descriptions, and empirically shows that some concepts in standard datasets do have graded structures.
International Journal of Man-Machine StudiesCABARET: rule interpretation in a hybrid architecture
229 Citations1991Edwina L. Rissland, David B. Skalak
A system CABARET (CAse-BAsed REasoning Tool) is described that provides a domain-independent shell that integrates reasoning with rules and reasoning with previous cases in order to apply rules containing ill-defined terms.
National Conference on Artificial IntelligenceReasoning about evidence in causal explanations
229 Citations1988Phyllis Koton
A system that solves a new problem by recalling a previous, similar problem and modifying its solution to fit the current problem with an average of two orders of magnitude less effort is described.
MLC++: a machine learning library in C++
197 Citations2002Ron Kohavi, George H. John +3 more
The problems M LC++ aims to solve, the design of MLC++, and the current functionality are discussed, including the attempt to extract commonalities of algorithms and decompose them for a unified view that is simple, coherent, and extensible.
A knowledge-intensive, integrated approach to problem solving and sustained learning
129 Citations1992Agnar Aamodt
A unified framework is developed through an analysis of various types, aspects and roles of knowledge relevant for the kind of systems described above, which aims to provide an environment for discussion of different approaches to knowledge intensive problem solving and learning.
Knowledge acquisition and learning by experience—the role of case-specific knowledge
33 Citations1995Agnar Aamodt
This chapter presents a framework for integrating KA and ML methods within a total knowledge modeling cycle, favoring an iterative rather than a top down approach to system development.
Lecture notes in computer scienceIntegrating induction and case-based reasoning: Methodological approach and first evaluations
29 Citations1995Eric Auriol, Michel Manago +3 more
A set of practical integrated approaches realised between the Kate-Induction decision tree builder and the Patdex case-based reasoning system are presented, which realise respectively a tight, medium and strong link between both techniques.
Lecture notes in computer scienceIntegrating induction in a case-based reasoner
27 Citations1995Eva Armengol, Enric Plaza
It is shown how a method for the induction of class prototypes can be implemented and integrated with case-based methods in an uniform framework and allows furthermore to integrate other learning methods as needed.
Lecture notes in computer scienceDesign of a case-based reasoning system applied to neuropathy diagnosis
23 Citations1995Maria Malek, Vincent Rialle
The goal of the work is to develop a computer assisted medical diagnosis system in the field of neuropathy (peripheral nervous system diseases) that must integrate the divers reasoning capacities of physicians: logical, deductive, uncertain, and analogical reasoning.
Lecture notes in computer scienceThe role of prototypicality in exemplar-based learning
8 Citations1995Yoram Biberman
The results of the experiments show that prototypicality serves as a good storing filter in storage reduction algorithms; combining it in algorithms that store all the training set does not improve significantly the accuracy of the algorithm.