Conditional Random Fields for Intrusion Detection

Authors:
Kapil Kumar Gupta;Baikunth Nath;Kotagiri Ramamohanarao
Affiliations:
National ICT Australia, University of Melbourne, Australia;Senior Member IEEE/ National ICT Australia, University of Melbourne, Australia;National ICT Australia, University of Melbourne, Australia
Venue:
AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01
Year:
2007

Citing 0
Cited 4

The curse of ease of access to the internet

ICISS'07 Proceedings of the 3rd international conference on Information systems security
Typed linear chain conditional random fields and their application to intrusion detection

IDEAL'10 Proceedings of the 11th international conference on Intelligent data engineering and automated learning
Towards adjusting mobile devices to user's behaviour

MSM'10/MUSE'10 Proceedings of the 2010 international conference on Analysis of social media and ubiquitous data
Gradient computation in linear-chain conditional random fields using the entropy message passing algorithm

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

An Intrusion Detection System is now an inevitable part of any computer network. With the ever increasing number and diverse type of attacks, including new and previously unseen attacks, the effectiveness of an Intrusion Detection System is often subjected to testing. The use of such systems have greatly reduced the threat level, however, the networks and hence the data and services offered by them are far away from the state when they can be considered as secure. In this paper we propose and experimentally validate the use and robustness of 'Conditional Random Fields,' for the task of Intrusion Detection. We show, experimentally, that the Conditional Random Fields, can be very effective in detecting intrusions when compared with the previously known techniques.