ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (1487 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
doi:10.1016/0888-613X(95)00035-F    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 1995 Published by Elsevier Inc.

Refinement of uncertain rule bases via reduction

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Charles X.F. LingE-mail The Corresponding Author and Marco ValtortaCorresponding Author Contact Information, E-mail The Corresponding Author

Department of Computer Science, University of Western Ontario, London, Ontario, Canada N6A 5B7

Department of Computer Science, University of South Carolina, Columbia, South Carolina 29208, USA


Available online 16 December 1999.

Abstract

Refining deep (multilayer) rule bases of an expert system with uncertainty to cover a set of new examples can be very difficult (NP-hard). We analyze refinement via reduction, an approach first proposed by Ginsberg, who claimed that this approach eases the complexity of refining rule bases without uncertainty. We outline a model of rule bases with uncertainty, and give necessary and sufficient conditions on uncertainty combination functions that permit reduction from deep to flat (nonchaining) rule bases. We prove that reduction cannot be performed with most commonly used uncertainty combination functions. However, we show that there is a class of reducible rule bases in which the strength refinement problem is NP-hard in the deep rule base, reduction is polynomial, and the flat rule base can be refined in polynomial time. This result also allows polynomial refinement of practical expert systems in the form of rule deletion. Thus, our results provide some theoretical evidence that refinement via reduction is feasible.

Keywords: Refinement in rule bases with uncertainty; inductive learning from examples; automatic knowledge acquisition; complexity analysis

The work has been supported partially by an NSERC Operating Grant.

The beginning of this research was supported by a University of South Carolina summer grant, which is gratefully acknowledged.


Corresponding Author Contact InformationAddress correspondence to Professor Marco Valtorta, Department of Computer Science, University of South Carolina, Columbia, SC 29208.

 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.