• DocumentCode
    1946282
  • Title

    Parallel Growing SOM Monitored by Genetic Algorithm

  • Author

    MacLean, Daniel ; Valova, Iren

  • Author_Institution
    Univ. of Massachusetts, Dartmouth
  • fYear
    2007
  • fDate
    12-17 Aug. 2007
  • Firstpage
    1697
  • Lastpage
    1702
  • Abstract
    Genetic algorithms are an effective search technique to utilize when the search space of a problem is very large and an unintelligent brute-force search is too time-consuming. One such problem that would benefit from a genetic algorithm is the optimization of the ParaGSOM, a Self-Organizing Map that processes the input space in parallel. The ParaGSOM has several parameters that can be configured with a wide range of possible values. Each of these parameters can significantly change the behavior of the ParaGSOM, depending on the value. These behavioral changes will affect the ParaGSOM´s ability to adapt to the input space, leading to anything from a fast convergence to a slow convergence to no convergence at all. Applying a genetic algorithm to determine the optimal parameters to use for fast, accurate convergence in the ParaGSOM yields results much faster than testing each parameter combination individually. A genetic algorithm gives insight about how particular parameter combinations affect the network and shows how their relationships can be exploited for maximum efficiency of the ParaGSOM.
  • Keywords
    genetic algorithms; parallel processing; search problems; self-organising feature maps; ParaGSOM optimization; genetic algorithms; parallel growing self-organizing map; search technique; unintelligent brute-force search; Convergence; Data visualization; Genetic algorithms; Monitoring; Neural networks; Neurons; Pattern classification; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks, 2007. IJCNN 2007. International Joint Conference on
  • Conference_Location
    Orlando, FL
  • ISSN
    1098-7576
  • Print_ISBN
    978-1-4244-1379-9
  • Electronic_ISBN
    1098-7576
  • Type

    conf

  • DOI
    10.1109/IJCNN.2007.4371213
  • Filename
    4371213