Efficient Algorithms for Intrusion Detection

Boora, Niranjan K and Bhattacharyya, Chiranjib and Gopinath, K (2004) Efficient Algorithms for Intrusion Detection. In: First International Conference on Distributed Computing and Internet Technology:ICDCIT 2004(Lecture Notes in Computer Science), 22-24 December, 2004, Bhubaneswar, India, Vol. 3347, 346-352.

PDF EfficientAlgorithms_BC_Feb19th.pdf Restricted to Registered users only Download (128kB) | Request a copy

Abstract

Detecting user to root attacks is an important intrusion detection task. This paper uses a mix of spectrum kernels and probabilistic suffix trees as a possible solution for detecting such intrusions efficiently. Experimental results on two real world datasets show that the proposed approach outperforms the state of the art Fisher kernel based methods in terms of speed with no loss of accuracy.

Item Type:	Conference Paper
Publication:	First International Conference on Distributed Computing and Internet Technology, ICDCIT 2004,Bhubaneswar, India (Lecture Notes in Computer Science)
Publisher:	Springer Verlag
Additional Information:	Copyright of this article belongs to Springer Verlag.
Department/Centre:	Division of Electrical Sciences > Electrical Engineering Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	22 Aug 2008
Last Modified:	19 Sep 2010 04:35
URI:	http://eprints.iisc.ac.in/id/eprint/9922

Actions (login required)

View Item