Presentation	2001/12/14 Ability of Growing Self-Organizing Map Ryuji OHTA, Toshimichi SAITO,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	In this paper, we consider ability of Growing Self-Organizing Map. First, we consider clustering function. Controlling a signal counter of each cell, the map can grow without distortion. If there exists undesired cell for the clustering, the cell can be deleted and connected to the neighbors. It can reinforce the clustering function. Setting the parameters appropriately, the learning can be adapted flexibely to changes of the input space. Second, we apply the algorithm to the Traveling salesman problem and show that quasi-optimal solution can be obtained.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	Self organization / Growing cell structures / Clustering / Ring-connection / Traveling salseman problem
Paper #	NC2001-74
Date of Issue

Conference Information
Committee	NC
Conference Date	2001/12/14(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Neurocomputing (NC)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Ability of Growing Self-Organizing Map
Sub Title (in English)
Keyword(1)	Self organization
Keyword(2)	Growing cell structures
Keyword(3)	Clustering
Keyword(4)	Ring-connection
Keyword(5)	Traveling salseman problem
1st Author's Name	Ryuji OHTA
1st Author's Affiliation	Department of Electronics and Electrical Engineering, Hosei University()
2nd Author's Name	Toshimichi SAITO
2nd Author's Affiliation	Department of Electronics and Electrical Engineering, Hosei University
Date	2001/12/14
Paper #	NC2001-74
Volume (vol)	vol.101
Number (no)	534
Page	pp.pp.-
#Pages	8
Date of Issue