Adaptive resolution min-max classifiers

A high automation degree is one of the most important features of data driven modeling tools and it should be taken into consideration in classification systems design. In this regard, constructive training algorithms are essential to improve the automation degree of a modeling system. Among neuro-fuzzy classifiers, Simpson’s Min-Max networks have the advantage to be trained in a constructive way. The use of the hyperbox, as a frame on which different membership functions can be tailored, makes the Min-Max model a flexible tool. However, the original training algorithm evidences some serious drawbacks, together with a low automation degree. In order to overcome these inconveniences, in this paper two new learning algorithms for fuzzy Min-Max neural classifiers are proposed: the Adaptive Resolution Classifier (ARC) and its pruning version (PARC). ARC/PARC generates a regularized Min-Max network by a succession of hyperbox cuts. The generalization capability of ARC/PARC technique mostly depends on the adopted cutting strategy. By using a recursive cutting procedure (R-ARC and R-PARC) it is possible to obtain better results. ARC, PARC, R-ARC and R-PARC are characterized by a high automation degree and allow to achieve networks with a remarkable generalization capability. Their performances are evaluated through a set of toy problems and real data benchmarks. We also propose a suitable index that can be used for the sensitivity analysis of the classification systems under consideration.