Big data classification using belief decision trees: application to intrusion detection

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

Abstract

Over the past few years, the data volume explosion fueled by exciting progression in computer technologies, made the Big Data the focus of widespread attention. Big Data is nebulous since it is an interaction result of several dimensions of scale, among them the veracity which refers to biases and noise in data. Therefore, Big Data veracity is a challenge because it requires a different approach in order to cope with this imperfection. We propose to involve the belief function theory and the belief decison tree as a classification technique to accommodate large applications where the uncertainty reigns. In this paper, we will be firstly concerned with the construction of the belief decision tree, using MapReduce programming model and the averaging approach as a classification method under uncertainty. Then, we will conduct experiments on intrusion detection massive data set, to distinguish between attacks and normal connections in such uncertain context.

Cite

CITATION STYLE

APA

Ajabi, M., Boukhris, I., & Elouedi, Z. (2016). Big data classification using belief decision trees: application to intrusion detection. In Advances in Intelligent Systems and Computing (Vol. 407, pp. 369–379). Springer Verlag. https://doi.org/10.1007/978-3-319-26690-9_33

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