Volume 8 Number 6 (Jun. 2013)
Home > Archive > 2013 > Volume 8 Number 6 (Jun. 2013) >
JCP 2013 Vol.8(6): 1456-1463 ISSN: 1796-203X
doi: 10.4304/jcp.8.6.1456-1463

Intrusion Detection Based on Improved SOM with Optimized GA

Jian-Hua Zhao1, 2 and Wei-Hua Li1
1 1College of computer, Northwestern Polytechnical University, Xi’an 710072, China
2 Department of Computer Science, ShangLuo University, ShangLuo 726000, China


Abstract—In order to improve the effectiveness of supervised self-organizing map (SSOM) neural network, a kind of genetic algorithm is designed to optimize it. To improve its classification rate, a real number encoding genetic algorithm is provided and used to optimize the learning rate and neighbor radius of SSOM. To speed up the modeling speed, a binary encoding genetic algorithm is provided to optimize input variables of SSOM and reduce its dimension of input sample. Finally, intrusion detection data set KDD Cup 1999 is used to carry out experiment based on the proposed model. The results show that the optimized model has shorter modeling time and higher intrusion detection rate.

Index Terms—SOM, intrusion detection, classification, dimension reduction, genetic algorithm

[PDF]

Cite: Jian-Hua Zhao and Wei-Hua Li, " Intrusion Detection Based on Improved SOM with Optimized GA," Journal of Computers vol. 8, no. 6, pp. 1456-1463, 2013.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>