Comparing Methods for Refining Certainty-Factor Rule-Bases

This paper compares two methods for refining uncertain knowledge bases using propositional certainty-factor rules. The first method, implemented in the RAPTURE system, employs neural-network training to refine the certainties of existing rules but uses a symbolic technique to add new rules. The second method, based on the one used in the KBANN system, initially adds a complete set of potential new rules with very low certainty and allows neural-network training to filter and adjust these rules. Experimental results indicate that the former method results in significantly faster training and produces much simpler refined rule bases with slightly greater accuracy.

[1]  R. C. Lacher,et al.  Node Error Assignment in Expert Networks † , 1992 .

[2]  Marcus Frean,et al.  The Upstart Algorithm: A Method for Constructing and Training Feedforward Neural Networks , 1990, Neural Computation.

[3]  Ronen Feldman,et al.  Bias-Driven Revision of Logical Domain Theories , 1993, J. Artif. Intell. Res..

[4]  Michael P. Wellman A Market-Oriented Programming Environment and its Application to Distributed Multicommodity Flow Problems , 1993, J. Artif. Intell. Res..

[5]  Raymond J. Mooney,et al.  Changing the Rules: A Comprehensive Approach to Theory Refinement , 1990, AAAI.

[6]  David W. Opitz,et al.  Heuristically Expanding Knowledge-Based Neural Networks , 1993, IJCAI.

[7]  Fu,et al.  Integration of neural heuristics into knowledge-based inference , 1989 .

[8]  David Heckerman,et al.  Probabilistic Interpretation for MYCIN's Certainty Factors , 1990, UAI.

[9]  Gregory F. Cooper,et al.  A Bayesian Method for the Induction of Probabilistic Networks from Data , 1992 .

[10]  Ronen Feldman Probabilistic Revision of Logical Doman Theories , 1993 .

[11]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[12]  J. Nadal,et al.  Learning in feedforward layered networks: the tiling algorithm , 1989 .

[13]  J. Shavlik,et al.  Extracting Reened Rules from Knowledge-based Neural Networks Keywords: Theory Reenement Integrated Learning Representational Shift Rule Extraction from Neural Networks , 1992 .

[14]  Geoffrey E. Hinton,et al.  Learning internal representations by error propagation , 1986 .

[15]  Hamid R. Berenji,et al.  Refinement of Approximate Reasoning-based Controllers by Reinforcement Learning , 1991, ML.

[16]  Jude W. Shavlik,et al.  Training Knowledge-Based Neural Networks to Recognize Genes , 1990, NIPS.

[17]  David C. Wilkins,et al.  Improving the Performance of Inconsistent Knowledge Bases via Combined Optimization Method , 1991, ML.

[18]  J. Shavlik,et al.  The Extraction of Reened Rules from Knowledge-based Neural Networks , 1993 .

[19]  Eddie Schwalb,et al.  Compiling Bayesian Networks into Neural Networks , 1993, ICML.

[20]  M. O'Neill,et al.  Escherichia coli promoters. II. A spacing class-dependent promoter search protocol. , 1989, The Journal of biological chemistry.

[21]  Michael J. Pazzani,et al.  A Methodology for Evaluating Theory Revision Systems: Results with Audrey II , 1993, IJCAI.

[22]  Bruce G. Buchanan,et al.  The MYCIN Experiments of the Stanford Heuristic Programming Project , 1985 .

[23]  Christian Lebiere,et al.  The Cascade-Correlation Learning Architecture , 1989, NIPS.

[24]  Jude Shavlik,et al.  Refinement ofApproximate Domain Theories by Knowledge-Based Neural Networks , 1990, AAAI.

[25]  Geoffrey G. Towell,et al.  Symbolic knowledge and neural networks: insertion, refinement and extraction , 1992 .

[26]  Glenn Shafer,et al.  Readings in Uncertain Reasoning , 1990 .

[27]  Sholom M. Weiss,et al.  Automatic Knowledge Base Refinement for Classification Systems , 1988, Artif. Intell..

[28]  Geoffrey E. Hinton,et al.  Learning and relearning in Boltzmann machines , 1986 .

[29]  Raymond J. Mooney,et al.  Combining Connectionist and Symbolic Learning to Refine Certainty Factor Rule Bases , 1993 .

[30]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.