Mean-tracking clustering algorithm for radial basis function centre selection

Full text not archived in this repository.

Please see our End User Agreement.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Sutanto, E. L., Mason, J. D. and Warwick, K. (1997) Mean-tracking clustering algorithm for radial basis function centre selection. International Journal of Control, 67 (6). pp. 961-977. ISSN 0020-7179 doi: 10.1080/002071797223884

Abstract/Summary

Radial basis functions can be combined into a network structure that has several advantages over conventional neural network solutions. However, to operate effectively the number and positions of the basis function centres must be carefully selected. Although no rigorous algorithm exists for this purpose, several heuristic methods have been suggested. In this paper a new method is proposed in which radial basis function centres are selected by the mean-tracking clustering algorithm. The mean-tracking algorithm is compared with k means clustering and it is shown that it achieves significantly better results in terms of radial basis function performance. As well as being computationally simpler, the mean-tracking algorithm in general selects better centre positions, thus providing the radial basis functions with better modelling accuracy

Altmetric Badge

Item Type Article
URI https://reading-clone.eprints-hosting.org/id/eprint/17832
Identification Number/DOI 10.1080/002071797223884
Refereed Yes
Divisions Science
Publisher Taylor & Francis
Download/View statistics View download statistics for this item

University Staff: Request a correction | Centaur Editors: Update this record

Search Google Scholar