• DocumentCode
    2637469
  • Title

    Improved k-means algorithm in the design of RBF neural networks

  • Author

    Sing, J.K. ; Basu, D.K. ; Nasipuri, M. ; Kundu, M.

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Jadavpur Univ., Calcutta, India
  • Volume
    2
  • fYear
    2003
  • fDate
    15-17 Oct. 2003
  • Firstpage
    841
  • Abstract
    We propose an improved version of the normal k-means clustering algorithm to select the hidden layer neurons of a radial basis function (RBF) neural network. The normal k-means algorithm has been modified to capture more knowledge about the distribution of input patterns and to take care of hyper-ellipsoidal shaped clusters. The RBF neural network with the proposed algorithm has been tested with three different machine-learning data sets. The average recognition rate of an RBF neural network over these data sets has been found to be 93.70% using the proposed improved k-means algorithm, whereas in the method using the normal k-means algorithm, the corresponding value is found to be 88.12%. Clearly, the results show that the performance of the RBF neural network using the proposed modified k-means algorithm has been improved.
  • Keywords
    learning (artificial intelligence); pattern clustering; radial basis function networks; RBF neural network design; hyper-ellipsoidal shaped clusters; input pattern distribution; k-means algorithm; machine-learning data sets; normal k-means clustering algorithm; pattern recognition rate; radial basis function neural network; Algorithm design and analysis; Clustering algorithms; Computer science; Euclidean distance; Function approximation; Intelligent networks; Neural networks; Neurons; Senior members; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    TENCON 2003. Conference on Convergent Technologies for the Asia-Pacific Region
  • Print_ISBN
    0-7803-8162-9
  • Type

    conf

  • DOI
    10.1109/TENCON.2003.1273297
  • Filename
    1273297