L-ASTERISK LEARNING - A FAST SELF-ORGANIZING FEATURE MAP LEARNING ALGORITHM-BASED ON INCREMENTAL ORDERING

Cited 16 time in webofscience Cited 0 time in scopus
  • Hit : 307
  • Download : 0
The self-organizing feature map is one of the most widely used neural network paradigm based on unsupervised competitive learning. However, the learning algorithm introduced by Kohonen is very slow when the size of the map is large. The slowness is caused by the search for large map in each training steps of the learning. In this paper, a fast learning algorithm based on incremental ordering is proposed. The new learning starts with only a few units evenly distributed on a large topological feature map, and gradually increases the number of units until it covers the entire map. In middle phases of the learning, some units are well-ordered and others are not, while all units are weekly-ordered in Kohonen learning. The ordered units, during the learning, help to accelerate the search speed of the algorithm and accelerate the movements of the remaining unordered units to their topological locations. It is shown by theoretical analysis as well as experimental analysis that the proposed learning algorithm reduces the training time from O (M2) to O (log M) for M by M map without any additional working space, while preserving the ordering properties of the Kohonen learning algorithm.
Publisher
IEICE-INST ELECTRON INFO COMMUN ENG
Issue Date
1993-06
Language
English
Article Type
Article
Citation

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E76D, no.6, pp.698 - 706

ISSN
0916-8532
URI
http://hdl.handle.net/10203/58828
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 16 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0