A fast and simple method is proposed to build low complexity radial basis function (RBF) classifiers. It is based on the approximation of the decision rule of a support vector machine by an RBF network, and integrates the dynamic decay adjustment algorithm with selective pruning and standard least squares techniques. Experimental results on several benchmark data sets, concerning both binary and multi-class problems, show the effectiveness of the proposed method.
Reduced complexity RBF classifiers with support vector centres and dynamic decay adjustment
PERFETTI, Renzo;RICCI, ELISA
2006
Abstract
A fast and simple method is proposed to build low complexity radial basis function (RBF) classifiers. It is based on the approximation of the decision rule of a support vector machine by an RBF network, and integrates the dynamic decay adjustment algorithm with selective pruning and standard least squares techniques. Experimental results on several benchmark data sets, concerning both binary and multi-class problems, show the effectiveness of the proposed method.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.