A Knowledge Acquisition method "Ripple Down Rules" can directly acquire and encode knowledge from human experts. It is an incremental acquisition method and each new piece of knowledge is added as an exception to the existing knowledge base. This knowledge base takes the form of a binary tree. There is another type of knowledge acquisition method that learns directly from data. Induction of decision tree is one such representative example. Noting that more data are stored in the database in this digital era, use of both expertise of humans and these stored data becomes even more important. In this paper, we attempt to integrate inductive learning and knowledge acquisition. We show that using the minimum description length principle, the knowledge base of Ripple Down Rules is automatically and incrementally constructed from data and thus, making it possible to switch between manual acquisition by a human expert and automatic induction from data at any point of knowledge acquisition. Experiments are carefully designed and tested to verify that the proposed method indeed works for many data sets having different natures.
[1]
S. Wrobel.
Concept Formation and Knowledge Revision
,
1994,
Springer US.
[2]
Brian R. Gaines.
An Ounce of Knowledge is Worth a Ton of Data: Quantitative studies of the Trade-Off between Expertise and Data Based On Statistically Well-Founded Empirical Induction
,
1989,
ML.
[3]
Ronald L. Rivest,et al.
Inferring Decision Trees Using the Minimum Description Length Principle
,
1989,
Inf. Comput..
[4]
J. Rissanen,et al.
Modeling By Shortest Data Description*
,
1978,
Autom..
[5]
Trevor J. Hall,et al.
Optimal Network Construction by Minimum Description Length
,
1993,
Neural Computation.
[6]
Byunghoon Kang.
Validating Knowledge Acquisition: Multiple Classification Ripple Down Rules PhD Thesis
,
1996
.
[7]
Joe Suzuki,et al.
A Construction of Bayesian Networks from Databases Based on an MDL Principle
,
1993,
UAI.
[8]
Catherine Blake,et al.
UCI Repository of machine learning databases
,
1998
.