Clustering the rules in a knowledge-based system (KBS) on the basis of their static distance (lexical information) reduces the burden of understanding in the mind of the maintainer. This paper explores a clustering algorithm based on the Hopfield neural net algorithm that clusters automatically using lexical similarity. Using that algorithm, this paper presents a tool that can aid the maintainer in maintaining a KBS. The tool is the Rule Base Clusterizer (RBC) which structures the KBS rule base to make it appear easy to understand for the maintainer. This paper shows by using entropy and Miller’s number that the RBC finds the best clustering that produces both an adequate amount of information and acceptable sized clusters. The paper also presents three examples of running the RBC on real-world rule bases. 1998 John Wiley & Sons, Ltd.
[1]
Jay F. Nunamaker,et al.
Automatic concept classification of text from electronic meetings
,
1994,
CACM.
[2]
David Sharon.
Meeting the Challenge of Software Maintenance
,
1996,
IEEE Softw..
[3]
Elliot Soloway,et al.
Assessing the Maintainability of XCON-in-RIME: Coping with the Problems of a VERY Large Rule-Base
,
1987,
AAAI.
[4]
Anneliese Amschler Andrews,et al.
Program Comprehension During Software Maintenance and Evolution
,
1995,
Computer.
[5]
G. A. Miller.
THE PSYCHOLOGICAL REVIEW THE MAGICAL NUMBER SEVEN, PLUS OR MINUS TWO: SOME LIMITS ON OUR CAPACITY FOR PROCESSING INFORMATION 1
,
1956
.
[6]
Laurene V. Fausett,et al.
Fundamentals Of Neural Networks
,
1994
.