DocumentCode :
2401755
Title :
A Clustering Algorithm Use SOM and K-Means in Intrusion Detection
Author :
Wang Huai-bin ; Yang Hong-liang ; Xu Zhi-jian ; Yuan Zheng
Author_Institution :
Tianjin Key Lab. of Intell. Comput. & Novel Software Technol., Tianjin Univ. of Technol., Tianjin, China
fYear :
2010
fDate :
7-9 May 2010
Firstpage :
1281
Lastpage :
1284
Abstract :
Improving detection definition is a pivotal problem for intrusion detection. Many intelligent algorithms were used to improve the detection rate and reduce the false rate. Traditional SOM cannot provide the precise clustering results to us, while traditional K-Means depends on the initial value serious and it is difficult to find the center of cluster easily. Therefore, in this paper we introduce a new algorithm, first, we use SOM gained roughly clusters and center of clusters, then, using K-Means refine the clustering in the SOM stage. At last of this paper we take KDD CUP-99 dataset to test the performance of the new algorithm. The new algorithm overcomes the defects of traditional algorithms effectively. Experimental results show that the new algorithm has a good stability of efficiency and clustering accuracy.
Keywords :
pattern clustering; security of data; SOM; clustering algorithm; intrusion detection; k-means; Algorithm design and analysis; Artificial neural networks; Clustering algorithms; Image color analysis; Intrusion detection; Testing; Training; IDS(Intrusion Detection System); K-Means; SOM(Self-Organizing Map);
fLanguage :
English
Publisher :
ieee
Conference_Titel :
E-Business and E-Government (ICEE), 2010 International Conference on
Conference_Location :
Guangzhou
Print_ISBN :
978-0-7695-3997-3
Type :
conf
DOI :
10.1109/ICEE.2010.327
Filename :
5590930
Link To Document :
بازگشت