Self-Organizing Map Based on Block Learning

  • Authors:

  • Akitsugu Ohtsuka;Naotake Kamiura;Teijiro Isokawa;Nobuyuki Matsui

  • Affiliations:

  • The authors are with the Division of Computer Engineering, University of Hyogo, Himeji-shi, 671-2201 Japan. E-mail: eu04m001@steng.u-hyogo.ac.jp;The authors are with the Division of Computer Engineering, University of Hyogo, Himeji-shi, 671-2201 Japan. E-mail: eu04m001@steng.u-hyogo.ac.jp;The authors are with the Division of Computer Engineering, University of Hyogo, Himeji-shi, 671-2201 Japan. E-mail: eu04m001@steng.u-hyogo.ac.jp;The authors are with the Division of Computer Engineering, University of Hyogo, Himeji-shi, 671-2201 Japan. E-mail: eu04m001@steng.u-hyogo.ac.jp

  • Venue:
  • IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

A block-matching-based self-organizing map (BMSOM) is presented. Finding a winner is carried out for each block, which is a set of neurons arranged in square. The proposed learning process updates the reference vectors of all of the neurons in a winner block. Then, the degrees of vector modifications are mainly controlled by the size (i.e., the number of neurons) of the winner block. To prevent a single cluster with neurons from splitting into some disjointed clusters, the restriction of the block size is imposed in the beginning of learning. At the main stage, this restriction is canceled. In BMSOM learning, the size of a winner block does not always decrease monotonically. The formula used to update the reference vectors is basically uncontrolled by time. Therefore, even if a map is in a nonstationary environment, training the map is probably pursued without interruption to adjust time-controlled parameters such as learning rate. Numerical results demonstrate that the BMSOM makes it possible to improve the plasticity of maps in a nonstationary environment and incremental learning.