Critical Vector Learning to Construct RBF Classifiers

Daming Shi, G.S. Ng, Junbin Gao, D.S. Yeung

Research output: Book chapter/Published conference paperConference paper

1 Citation (Scopus)
3 Downloads (Pure)

Abstract

Sensitivity is initially investigated for the construction of a network prior to its design. Sensitivity analysis applied to network pruning seems particularly useful and valuable when network training involves a large amount of redundant data. This paper proposes a novel learning algorithm for the construction of radial basis function (RBF) classifiers using sensitive vectors (SenV), to which the output is the most sensitive. In training, the number of hidden neurons and the centers of their radial basis functions are determined by the maximization of the output's sensitivity to the training data. In classification, the minimal number of such hidden neurons with the maximal sensitivity will be the most generalizable to unknown data. Our experimental results suggests that our proposed methodology outperforms classical RBF classifiers constructed by clustering.
Original languageEnglish
Title of host publication17th International Conference on Pattern Recognition (ICPR'04)
Place of PublicationUSA
PublisherIEEE
Pages359-362
Number of pages4
Volume3
ISBN (Electronic)0769521282
Publication statusPublished - 2004
EventInternational Conference on Pattern Recognition - Cambridge UK, United Kingdom
Duration: 23 Aug 200426 Aug 2004

Conference

ConferenceInternational Conference on Pattern Recognition
CountryUnited Kingdom
Period23/08/0426/08/04

Fingerprint Dive into the research topics of 'Critical Vector Learning to Construct RBF Classifiers'. Together they form a unique fingerprint.

  • Cite this

    Shi, D., Ng, G. S., Gao, J., & Yeung, D. S. (2004). Critical Vector Learning to Construct RBF Classifiers. In 17th International Conference on Pattern Recognition (ICPR'04) (Vol. 3, pp. 359-362). IEEE.