Ripple-down rules are an incremental approach to knowledge acquisition and covers a family of techniques. RDR were proposed by Compton and Jansen based on experience maintaining the expert system GARVAN-ES1. The original GARVAN-ES1 employed a knowledge acquisition process where new cases that were poorly classified by the system were added to a data base and then used to incrementally refine the knowledge base. The added cases, whose conclusions conflicted with the advice of the system were termed "cornerstone cases". Consequently, the data base grew iteratively with each refinement to the knowledge. The data base could then be used to test changes to the knowledge. Knowledge acquisition tools, similar to those provided by Teiresias were developed to find and help modify the conflicting rules. The tools would display the rules fired by each case and suggestions to "edit" the knowledge to remove the conflicts. In the RDR framework, the human expert's knowledge is acquired based on the current context and is added incrementally. Compton and Jansen argued that the expert's knowledge is to some extent 'made up' to justify why she was right, not to explain how she reached this right interpretation. The justification is based on features that are identified from the current case. The expert creates a rule for classifying cases corresponding to a particular context. This rule is unlikely to classify all cases belonging to the class. Compton and Jansen asserted that it is not possible to create a single elegant context free rule as the knowledge we communicate is a justification in a context. This implies that there is no absolute knowledge that acts as foundation of other knowledge, since knowledge is only true in a context.
Methodology
Ripple-down rules consist of a data structure and knowledge acquisition scenarios. Human experts' knowledge is stored in the data structure. The knowledge is coded as a set of rules. The process of transferring human experts' knowledge to Knowledge-based systems in RDR is explained in knowledge acquisition scenario.
Data structure
There are various structures of ripple-down rules, for example single-classification ripple-down rules, multiple-classification ripple-down rules, nested ripple-down rules and repeat-inference multiple-classification ripple-down rules. The data structure of RDR described here is SCRDR, which is the simplest structure. The data structure is similar to a decision tree. Each node has a rule, the format of this rule is IF cond1 AND cond2 AND... AND condN THEN conclusion. Cond1 is a condition, for example A=1, isGreater and average. Each node has exactly two successor nodes, these successor nodes are connected to predecessor node by "ELSE" or "EXCEPT". An example of SCRDR tree is shown below: IF THEN PLAY="TENNIS" EXCEPT Child-1 ELSE Child-2 where Child-1 and Child-2 are also SCRDR trees. For example, Child-1 is: IF THEN Play="SQUASH" EXCEPT NoChild ELSE NoChild
Knowledge-acquisition scenario
Human experts provide a case to the system and they add a new rule to correct the classification of a misclassified case. For example, rule Child-1 is added to correct classification of case . This case is misclassified as Play="TENNIS". When a rule is constructed by the human experts, the conditions of this rule should be satisfied by the misclassified case and also they should NOT be satisfied by any previous cases classified correctly by the parent rule.
The Ballarat Incremental Knowledge Engine is a comprehensive open source implementation in C++. Includes plugins for Single Classification and Multiple Classification RDRs.
The Java data mining software WEKA has a version of Induct RDR called Ridor. It learns rules from a data set with the principal aim to predict a class within a test set.
