DocumentCode
2882218
Title
A modified algorithm for the fast processing with the Growing Self-Organizing Map
Author
Yu, Yaohua ; Alahakoon, Damminda
Author_Institution
Monash Univ., Clayton
fYear
2006
fDate
15-17 Dec. 2006
Firstpage
140
Lastpage
145
Abstract
The Growing Self-organizing map algorithm (GSOM) has been developed based on SOM. With its dynamic structure, GSOM can generate feature maps without predetermining their size. It has shown many significant advantages when processing very large data sets. These advantages could be further enhanced if the processing speed of the algorithm could be increased. This paper presents a modified version of GSOM, which implements the batch processing principle to shorten the processing time. The algorithm and experimental results showing the improved performance are presented in this paper.
Keywords
batch processing (computers); self-organising feature maps; batch processing; data sets; growing self-organizing map; Clustering algorithms; Information technology; Probability density function; Size control; Vector quantization; Growing Self-Organizing Map; batch processing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information and Automation, 2006. ICIA 2006. International Conference on
Conference_Location
Shandong
Print_ISBN
1-4244-0555-6
Electronic_ISBN
1-4244-0555-6
Type
conf
DOI
10.1109/ICINFA.2006.374097
Filename
4250187
Link To Document