Multiple SOFMs Working Cooperatively In a Vote-based Ranking System For Network Intrusion Detection
Author(s) -
Charlie Obimbo,
Haochen Zhou,
Ryan J. Wilson
Publication year - 2011
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2011.08.041
Subject(s) - computer science , intrusion detection system , ranking (information retrieval) , data mining , computer network , artificial intelligence
Protection from hackers on networks is currently of great importance. Recent examples of victims include the recent repeated hacking of Sony PS3, which involved 24.6 million customer accounts being vulnerable, and the hacking of websites both includ-ing US and Canadian government sites. Thus there is a drear need for effective Intrusion Detection and Prevention systems. Anomaly intrusion detection is a popular method of detecting Intrusions on Computer Networks. In 2011, Wilson and Obimbo proved that the use of Self-Organized Feature Maps (SOFM) could be used to increase the performance on KDD-99 dataset. This paper introduces a vote-based ranking system for intrusion detection based on SOFM. The experimental results are promising and are an improvement in both Wilson and Obimbo's system and the Winning system of the KDD IDS Competition
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom