Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
Self-Organizing Map Based on Block Learning Akitsugu OHTSUKA Naotake KAMIURA Teijiro ISOKAWA Nobuyuki MATSUI Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E88-A No.11 pp.3151-3160 Publication Date: 2005/11/01 Online ISSN: DOI: 10.1093/ietfec/e88-a.11.3151 Print ISSN: 0916-8508 Type of Manuscript: PAPER Category: Nonlinear Problems Keyword: block-based learning, self-organizing map, nonstationary environments, incremental learning, Full Text: PDF(1.3MB)>>
Summary: 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. | ||||||||||
| ||||||||||
