Abstract
Intrusion Detection Systems (IDS) are security tools that generate alerts when detecting a malicious activity. The main drawback of IDS is the high number of generated alerts. We propose an approach that integrates the preferences of several security experts to rank IDS results. The experts’ preferences are expressed either in IFO-BCF (Instantiated First Order) logic or in IFO-guaranteed possibilistic one. A new logical preferences merging algorithm is given, it takes in input the different experts’ preferences and produces a unique preferences base. The resulted preferences base is used to rank the IDS alerts.
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
References
Benferhat, S., Dubois, D., Prade, H.: How to infer from inconsistent beliefs without revising ? In: Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI 1995, pp. 1449–1455, Montreal Canada, August 1995
Benferhat, S., Kaci, S.: Logical representation and fusion of prioritized information based on guaranteed possibility measures: application to the distance-based merging of classical bases. Artif. Intell. 148(1), 291–333 (2003)
Bouzar-Benlabiod, L., Benferhat, S., Bouabana-Tebibel, T.: Instantiated first order qualitative choice logic for an efficient handling of alerts correlation. Intell. Data Anal. 19(1), 3–27 (2015)
Brewka, G., Benferhat, S., Le Berre, D.: Qualitative choice logic. Artif. Intell. 157(1), 203–237 (2004)
Dubois, D., Lang, J., Prade, H.: Possibilistic logic. In: Gabbay, D., Hogger, C., Robinson, J. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3. Oxford University Press, New York (1994)
Dubois, D., Prade, H.: Possibility theory as a basis for preference propagation in automated reasoning. In: IEEE International Conference on Fuzzy Systems, pp. 821–832 (1992)
Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artif. Intell. 44(12), 167–207 (1990)
Lang, J.: Possibilistic logic: complexity and algorithms. In: Kohlas, J., Moral, S. (eds.) Algorithms for Uncertainty and Defeasible Reasoning, volume 5 of Handbook of Defeasible Reasoning and Uncertainty Management Systems (Gabbay D., Smets P. Eds.), vol. 5, pp. 179–220. Kluwer Academic Publishers, Dordrecht (2001)
Mu, K., Liu, W., Jin, Z., Bell, D.A.: A syntax-based approach to measuring the degree of inconsistency for belief bases. Int. J. Approx. Reason. 52(7), 978–999 (2011)
Qi, G., Liu, W., Bell, D.A.: Measuring conflict and agreement between two prioritized knowledge bases in possibilistic logic. Fuzzy Sets Syst. 161(14), 1906–1925 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Bouzar-Benlabiod, L., Meziani, L., Rim, NE., Mellal, Z. (2018). Merging Guaranteed Possibilistic Bases to Rank IDS Alerts. In: Mouhoub, M., Sadaoui, S., Ait Mohamed, O., Ali, M. (eds) Recent Trends and Future Technology in Applied Intelligence. IEA/AIE 2018. Lecture Notes in Computer Science(), vol 10868. Springer, Cham. https://doi.org/10.1007/978-3-319-92058-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-319-92058-0_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-92057-3
Online ISBN: 978-3-319-92058-0
eBook Packages: Computer ScienceComputer Science (R0)