DocumentCode :
2546558
Title :
Growing recurrent self organizing map
Author :
Yeloglu, Özge ; Zincir-Heywood, A. Nur ; Heywood, Malcolm I.
Author_Institution :
Dalhousie Univ., Halifax
fYear :
2007
fDate :
7-10 Oct. 2007
Firstpage :
290
Lastpage :
295
Abstract :
The growing recurrent self-organizing map (GRSOM) is embedded into a standard self-organizing map (SOM) hierarchy. To do so, the KDD benchmark dataset from the International Knowledge Discovery and Data Mining Tools Competition is employed. This dataset consists of 500,000 training patterns and 41 features for each pattern. Unlike most of the previous methods, only 6 of the basic features are employed. The resulting model has a capability of detection (false positive) rate of 89.6% (5.66%), where this is as good as the data-mining approaches that uses all 41 features and twice as faster than a similar hierarchical SOM architecture.
Keywords :
data mining; self-organising feature maps; Data Mining Tools Competition; International Knowledge Discovery; growing recurrent self-organizing map; hierarchical SOM architecture; standard self-organizing map; training patterns; Computer science; Data mining; Delay lines; Electronic mail; Intrusion detection; Neural networks; Neurons; Organizing; Speech recognition; Weather forecasting;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Systems, Man and Cybernetics, 2007. ISIC. IEEE International Conference on
Conference_Location :
Montreal, Que.
Print_ISBN :
978-1-4244-0990-7
Electronic_ISBN :
978-1-4244-0991-4
Type :
conf
DOI :
10.1109/ICSMC.2007.4414001
Filename :
4414001
Link To Document :
بازگشت