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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anderson, J.P.: Computer security threat monitoring and surveillance. tech. rep., James P Anderson Co., Fort Washington, Pennsylvania (April 1980)
Kendall, K.: A database of computer attacks for the evalutation of intrusion detection. Master’s thesis, MIT (June 1999)
Axelsson, S.: Intrusion detection systems: A survey and taxonomy. tech. rep., Department of Computer Engineering, Chalmers University of Technology (2000)
Sundaram, A.: An introduction to intrusion detection. ACM Crossroads Student Magazine (1996)
Baras, J., Rabi, M.: Intrusion detection with support vector machines and generative models. tech. rep., Institute for Systems Research, University of Maryland (2002)
Jaakkola, T., Haussler, D.: Using the Fisher kernel methods to detect remote protein homologies. In: Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology, pp. 149–158 (1999)
Leslie, C., Eskin, E., Stafford, W.: The spectrum kernel: A string kernel for SVM protein classification. In: Proceedings of the Pacific Symposium on Biocomputing, January 2002, pp. 564–575 (2002)
Ron, D., Singer, Y., Tishby, N.: The power of amnesia: learning probabilistic automata with variable memory length. Machine Learning 25(2-3), 117–149 (1996)
Rabiner, L.R.: A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE 77(2), 257–286 (1989)
Rabiner, L.R., Juang, B.H.: An introduction to hidden Markov models. IEEE ASSP Magazine, 4–15 (January 1986)
Duggad, R., Desai, U.B.: A tutorial on hidden Markov models. tech. rep., Electrical Department, Indian Institute of Technology, Bombay (1996)
Burges, C.J.C.: A tutorial on support vector machine for pattern recognition. Data Mining and Knowledge Discovery 2, 121–167 (1998)
Pavlidis, P., Furey, T.S., Liberto, M., Haussler, D., Grundy, W.N.: Promoter region-based classification of genes. In: Proceedings of the Pacific Symposium on Biocomputing, January 2001, pp. 151–163 (2001)
Bejerano, G., Yona, G.: Variations on probabilistic suffix trees: statistical modeling and prediction of protein families. Bioinformatics 17(1), 23–43 (2001)
UNM, Department of Computer Science, Computer immune systems homepage, http://www.cs.unm.edu/immsec/systemcalls.htm
Joachims, T.: Making large-scale SVM learning practical. In: Schölkopf, B., Burges, C., Smola, A. (eds.) Advances in Kernel Methods - Support Vector Learning (1999)
M. P. I. f. M. G. Algorithmics group, General hidden Markov model library (ghmm), http://sourceforge.net/projects/ghmm/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boora, N.K., Bhattacharyya, C., Gopinath, K. (2004). Efficient Algorithms for Intrusion Detection. In: Ghosh, R.K., Mohanty, H. (eds) Distributed Computing and Internet Technology. ICDCIT 2004. Lecture Notes in Computer Science, vol 3347. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30555-2_40
Download citation
DOI: https://doi.org/10.1007/978-3-540-30555-2_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24075-4
Online ISBN: 978-3-540-30555-2
eBook Packages: Computer ScienceComputer Science (R0)