Decision trees and qualitative possibilistic inference: Application to the intrusion detection problem

7Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we apply decision trees (DT) to intrusion detection problems. Experimentations are done on KDD'99 datasets. These data offer main features needed to evaluate intrusion detection systems. We consider three levels of attack granularities depending on whether dealing with all attacks, or grouping them in special categories or just focusing on normal and abnormal behaviours. We also extend the classification procedure to handle uncertain observations encountered in connection features. To this end, uncertainty is represented by possibility distributions and the inference in DT is based on the qualitative possibilistic logic.

Cite

CITATION STYLE

APA

Amor, N. B., Benferhat, S., Elouedi, Z., & Mellouli, K. (2003). Decision trees and qualitative possibilistic inference: Application to the intrusion detection problem. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2711, pp. 419–431). Springer Verlag. https://doi.org/10.1007/978-3-540-45062-7_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free