DocumentCode
1367252
Title
Scale-based clustering using the radial basis function network
Author
Chakravarthy, Srinivasa V. ; Ghosh, Joydeep
Author_Institution
Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA
Volume
7
Issue
5
fYear
1996
fDate
9/1/1996 12:00:00 AM
Firstpage
1250
Lastpage
1261
Abstract
This paper shows how scale-based clustering can be done using the radial basis function network (RBFN), with the RBF width as the scale parameter and a dummy target as the desired output. The technique suggests the “right” scale at which the given data set should be clustered, thereby providing a solution to the problem of determining the number of RBF units and the widths required to get a good network solution. The network compares favorably with other standard techniques on benchmark clustering examples. Properties that are required of non-Gaussian basis functions, if they are to serve in alternative clustering networks, are identified. This work, on the whole, points out an important role played by the width parameter in RBFN, when observed over several scales, and provides a fundamental link to the scale space theory developed in computational vision
Keywords
content-addressable storage; feedforward neural nets; function approximation; pattern recognition; computer vision; content addressable memory; function approximation; nonGaussian basis functions; radial basis function network; scale parameter; scale space theory; scale-based clustering; Classification tree analysis; Clustering algorithms; Clustering methods; Computer vision; Cost function; Creep; Partitioning algorithms; Radial basis function networks; Stochastic processes; Tree data structures;
fLanguage
English
Journal_Title
Neural Networks, IEEE Transactions on
Publisher
ieee
ISSN
1045-9227
Type
jour
DOI
10.1109/72.536318
Filename
536318
Link To Document