SCALE-BASED CLUSTERING USING THE RADIAL BASIS FUNCTION NETWORK

Citation
Sv. Chakravarthy et J. Ghosh, SCALE-BASED CLUSTERING USING THE RADIAL BASIS FUNCTION NETWORK, IEEE transactions on neural networks, 7(5), 1996, pp. 1250-1261
Citations number
37
Categorie Soggetti
Computer Application, Chemistry & Engineering","Engineering, Eletrical & Electronic","Computer Science Artificial Intelligence","Computer Science Hardware & Architecture","Computer Science Theory & Methods
ISSN journal
10459227
Volume
7
Issue
5
Year of publication
1996
Pages
1250 - 1261
Database
ISI
SICI code
1045-9227(1996)7:5<1250:SCUTRB>2.0.ZU;2-H
Abstract
This paper shows how scale-based clustering can be done using the radi al basis function (RBF) network (RBFN), with the RBF width as the scal e parameter and a dummy target as the desired output, The technique su ggests the ''right'' scale at which the given data set should be clust ered, thereby providing a solution to the problem of determining the n umber of RBF units and the widths required to get a good network solut ion, The network compares favorably with other standard techniques on benchmark clustering examples, Properties that are required of non-Gau ssian basis functions, if they are to serve in alternative clustering networks, are identified, This work, on the whole, points out an impor tant role played by the width parameter in RBFN, when observed over se veral scales, and provides a fundamental link to the scale space theor y developed in computational vision.