DocumentCode :
445993
Title :
Training the SOFM efficiently: an example from intrusion detection
Author :
Wetmore, Leigh ; Zincir-Heywood, A. Nur ; Heywood, Malcolm I.
Author_Institution :
Fac. of Comput. Sci., Dalhousie Univ., Halifax, NS, Canada
Volume :
3
fYear :
2005
fDate :
31 July-4 Aug. 2005
Firstpage :
1575
Abstract :
The dynamic subset selection (DSS) active learning algorithm is generalized to include the case of unsupervised learning. To do so, training set partitioning, exemplar difficulty and age, and early stopping criteria are introduced into the self organizing feature map algorithm. The resulting model is able to build a hierarchical SOFM on a large (500,000 pattern) dataset in 3 hours. In comparison, the same architecture without active learning requires 33 hours to construct. No reduction in accuracy is recorded for the DSS SOFM model.
Keywords :
self-organising feature maps; unsupervised learning; active learning; dynamic subset selection; early stopping criteria; intrusion detection; self organizing feature map; training set partitioning; unsupervised learning; Algorithm design and analysis; Computer science; Data analysis; Decision support systems; Hardware; Intrusion detection; Neurons; Organizing; Partitioning algorithms; Unsupervised learning;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 2005. IJCNN '05. Proceedings. 2005 IEEE International Joint Conference on
Print_ISBN :
0-7803-9048-2
Type :
conf
DOI :
10.1109/IJCNN.2005.1556113
Filename :
1556113
Link To Document :
بازگشت