• DocumentCode
    1295301
  • Title

    Granular Neural Networks and Their Development Through Context-Based Clustering and Adjustable Dimensionality of Receptive Fields

  • Author

    Ho-Sung Park ; Pedrycz, W. ; Sung-Kwun Oh

  • Author_Institution
    Ind. Adm. Inst., Univ. of Suwon, Suwon, South Korea
  • Volume
    20
  • Issue
    10
  • fYear
    2009
  • Firstpage
    1604
  • Lastpage
    1616
  • Abstract
    In this study, we present a new architecture of a granular neural network and provide a comprehensive design methodology as well as elaborate on an algorithmic setup supporting its development. The proposed neural network relates to a broad category of radial basis function neural networks (RBFNNs) in the sense that its topology involves a collection of receptive fields. In contrast to the standard architectures encountered in RBFNNs, here we form individual receptive fields in subspaces of the original input space rather than in the entire input space. These subspaces could be different for different receptive fields. The architecture of the network is fully reflective of the structure encountered in the training data which are granulated with the aid of clustering techniques. More specifically, the output space is granulated with use of K-means clustering while the information granules in the multidimensional input space are formed by using the so-called context-based fuzzy C-means, which takes into account the structure being already formed in the output space. The innovative development facet of the network involves a dynamic reduction of dimensionality of the input space in which the information granules are formed in the subspace of the overall input space which is formed by selecting a suitable subset of input variables so that this subspace retains the structure of the entire space. As this search is of combinatorial character, we use the technique of genetic optimization [genetic algorithms (GAs), to be more specific] to determine the optimal input subspaces. A series of numeric studies exploiting synthetic data and data coming from the Machine Learning Repository, University of California at Irvine, provide a detailed insight into the nature of the algorithm and its parameters as well as offer some comparative analysis.
  • Keywords
    genetic algorithms; learning (artificial intelligence); pattern clustering; radial basis function networks; Irvine; K-means clustering; University of California; clustering techniques; context-based clustering; context-based fuzzy C-means; dimensionality reduction; genetic algorithms; genetic optimization; granular neural networks; information granules; machine learning repository; radial basis function neural networks; Clustering algorithms; Design methodology; Genetic algorithms; Input variables; Machine learning; Multidimensional systems; Network topology; Neural networks; Radial basis function networks; Training data; Context-based fuzzy clustering; genetic algorithm (GA); information granules; proximity; radial basis function neural network (RBFNN); Biomimetics; Computer Simulation; Models, Theoretical; Neural Networks (Computer); Pattern Recognition, Automated;
  • fLanguage
    English
  • Journal_Title
    Neural Networks, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1045-9227
  • Type

    jour

  • DOI
    10.1109/TNN.2009.2027319
  • Filename
    5200389