• DocumentCode
    2017771
  • Title

    An improved learning algorithm for laterally interconnected synergetically self-organizing map

  • Author

    Zhang, Bai-ling ; Gedeon, T.D.

  • Author_Institution
    Dept. of Inf. Eng., New South Wales Univ., Kensington, NSW, Australia
  • Volume
    1
  • fYear
    1999
  • fDate
    1999
  • Firstpage
    257
  • Abstract
    LISSOM (Laterally Interconnected Synergetically Self-Organizing Map) is a biologically motivated self-organizing neural network for the simultaneous development of topographic maps and lateral interactions in the visual cortex. However, the simple Hebbian mechanism for afferent connections requires a redundant dimension to be added to the input, and normalization is necessary. Another shortcoming of LISSOM is that several parameters must be chosen before it can be used as a model of topographic map formation. To solve these problems, we propose to apply the least mean-square error reconstruction (LMSER) learning rule as an alternative to the simple Hebbian rule for the afferent connections. Experiments demonstrate the essential topographic map properties from the improved LISSOM model
  • Keywords
    Hebbian learning; brain models; interconnected systems; least mean squares methods; redundancy; self-organising feature maps; vision; Hebbian mechanism; LISSOM; LMSER learning rule; afferent connections; biologically motivated self-organizing neural network; lateral interactions; laterally interconnected synergetically self-organizing map; learning algorithm; least mean-square error reconstruction; normalization; redundant dimension; topographic map formation; visual cortex; Biology; Brain modeling; Computer science; Hebbian theory; Lattices; Mean square error methods; Neural networks; Neurons; Piecewise linear approximation; Retina;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Information Processing, 1999. Proceedings. ICONIP '99. 6th International Conference on
  • Conference_Location
    Perth, WA
  • Print_ISBN
    0-7803-5871-6
  • Type

    conf

  • DOI
    10.1109/ICONIP.1999.843996
  • Filename
    843996