Efficient algorithms for intrusion detection

Authors:
Niranjan K. Boora;Chiranjib Bhattacharyya;K. Gopinath
Affiliations:
Dept of Electrical Engineering;Dept of Computer Science & Automation, Indian Institute of Science, Bangalore, India;Dept of Computer Science & Automation, Indian Institute of Science, Bangalore, India
Venue:
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
Year:
2004

Citing 5
Cited 0

The power of amnesia: learning probabilistic automata with variable memory length

Machine Learning - Special issue on COLT '94
Making large-scale support vector machine learning practical

Advances in kernel methods
An introduction to intrusion detection

Crossroads - Special issue on computer security
A Tutorial on Support Vector Machines for Pattern Recognition

Data Mining and Knowledge Discovery
Using the Fisher Kernel Method to Detect Remote Protein Homologies

Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology

Quantified Score

Hi-index	0.00

Visualization

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.