Boora, Niranjan K. ; Bhattacharyya, Chiranjib ; Gopinath, K. (2004) Efficient Algorithms for Intrusion Detection Lecture Notes in Computer Science, 3347 . pp. 346-352. ISSN 0302-9743
Full text not available from this repository.
Official URL: http://doi.org/10.1007/978-3-540-30555-2_40
Related URL: http://dx.doi.org/10.1007/978-3-540-30555-2_40
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: | Article |
|---|---|
| Source: | Copyright of this article belongs to Springer-Verlag |
| ID Code: | 127793 |
| Deposited On: | 12 Oct 2022 06:15 |
| Last Modified: | 12 Oct 2022 06:15 |
Repository Staff Only: item control page
