Ensemble based collaborative and distributed intrusion detection systems: A survey

被引:89
作者
Folino, Gianluigi [1 ]
Sabatino, Pietro [1 ]
机构
[1] ICAR CNR Ist Calcolo & Reti Ad Alte Prestaz, Via P Bucci, I-87036 Arcavacata Di Rende, CS, Italy
关键词
RANDOM-FORESTS; CATEGORIZATION; INFORMATION; ALGORITHM; SUPPORT;
D O I
10.1016/j.jnca.2016.03.011
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Modern network intrusion detection systems must be able to handle large and fast changing data, often also taking into account real-time requirements. Ensemble-based data mining algorithms and their distributed implementations are a promising approach to these issues. Therefore, this work presents the current state of the art of the ensemble-based methods used in modern intrusion detection systems, with a particular attention to distributed approaches and implementations. This review also consider supervised and unsupervised data mining algorithms, more suitable to work in an environment that requires the analysis of data streams in real-time. Sharing knowledge across multiple nodes is another of the key points in designing appropriate NIDSs and for this reason, collaborative IDS were also included in this work. Finally, we discuss some open issues and lessons learned from this review, which can help researchers to design more efficient NIDSs. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1 / 16
页数:16
相关论文
共 109 条
[1]   Automatic subspace clustering of high dimensional data [J].
Agrawal, R ;
Gehrke, J ;
Gunopulos, D ;
Raghavan, P .
DATA MINING AND KNOWLEDGE DISCOVERY, 2005, 11 (01) :5-33
[2]   Mutual information-based feature selection for intrusion detection systems [J].
Amiri, Fatemeh ;
Yousefi, MohammadMahdi Rezaei ;
Lucas, Caro ;
Shakery, Azadeh ;
Yazdani, Nasser .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2011, 34 (04) :1184-1199
[3]  
[Anonymous], APPL SOFT COMPUT
[4]  
[Anonymous], 2010, NSDI
[5]  
[Anonymous], 1996, SIGMOD REC ACM SPEC, DOI DOI 10.1145/235968.233324
[6]  
[Anonymous], INT J NETW SECUR
[7]  
[Anonymous], P 3 ANN C PRIV SEC T
[8]  
[Anonymous], 2005, P 28 AUSTR CS C
[9]  
[Anonymous], P 3 WORKSH HOT TOP S
[10]  
[Anonymous], P 7 INT C SEC INF NE