Building precise classifiers with automatic rule extraction
K.-P. Huber, Michael R. Berthold · 2002
An algorithm is presented to train a special kind of a local basis function classifier. The so-called "rectangular basis function network" (RecBFN) consists of hidden units, each covering a rectangular area in the input space, using a trapezoidal activation function. The underlying training algorithm allows easy and fast construction of these types of networks and no parameters need to be adjusted, only normalization of the input-data is necessary. Classification performance of the RecBFN is shown to be comparable to the state of the art classifiers on eight datasets from the StatLog archive. In addition the resulting network allows easy extraction of the learned rules in a form of if-then statements. These rules additionally include soft boundaries resulting in membership values for each class (a possibility of membership is provided). Extraction of meaningful rules is demonstrated on several datasets. The resulting rules can be ranked according to the order of importance and allow the net to extract only few relevant rules in the case of a larger rule base. It is shown that the performance of the network degrades smoothly with the number of rules excluded from the final rule set.
Cited by 75 works. doi:10.1109/icnn.1995.487337
Authors
References
- C4.5: Programs for Machine Learning
- THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
- Advances in neural information processing systems 7
- Fast Learning in Networks of Locally-Tuned Processing Units
- Advances in Neural Information Processing Systems 5
- The MONK's problems: A Performance Comparison of Different Learning Algorithms
- A Nearest Hyperrectangle Learning Method
- Soft computing and fuzzy logic
- Boosting the Performance of RBF Networks with Dynamic Decay Adjustment
- Rule Induction through Integrated Symbolic and Subsymbolic Processing