Bagging-TPMiner: a classifier ensemble for masquerader detection based on typical objects

被引:20
作者
Angel Medina-Perez, Miguel [1 ]
Monroy, Raul [1 ]
Benito Camina, J. [1 ]
Garcia-Borroto, Milton [2 ]
机构
[1] Tecnol Monterrey, Escuela Ingn & Ciencias, Carretera Lago Guadalupe Km 3-5, Atizapan 52926, Estado De Mexic, Mexico
[2] Inst Super Politecn Jose Antonio Echeverria, Calle 114,11901 Entre Ciclovia & Rotonda, Marianao 11901, Habana, Cuba
关键词
One-class classifier; Classifier ensemble; Masquerader detection; INTRUSION-DETECTION; STATISTICAL COMPARISONS; USERS;
D O I
10.1007/s00500-016-2278-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The goal of a masquerade detection system is to determine whether a given computer activity does not correspond to a target user, thereby inferring that a masquerader has stolen the computer session of a user. Masquerade detection should be addressed as a one-class classification problem, where only user information is available for classifier construction. This might be mandatory when it is difficult to account for all types of attack patterns or collect enough evidence thereof. In this paper, we introduce a masquerader detection method, named Bagging-TPMiner, a one-class classifier ensemble. As the name suggests, Bagging-TPMiner bootstraps the training dataset of genuine user behavior in order to find typical objects. In the classification phase, it renders a new sample of computer behavior to be a masquerade if that behavior is distinct from the typical objects. Critically, unlike existing clustering techniques, Bagging-TPMiner gives similar attention to both types of regions, dense and sparse, thus capturing the (hidden) structure of ordinary user behavior. We have successfully tested Bagging-TPMiner on WUIL, a repository of datasets for masquerader detection that contain more faithful masquerade attempts. Our experimental results show that Bagging-TPMiner improves classification accuracy when compared to other classifiers and that it is significantly better at identifying bursts of attacks, called persistent attacks, or at continuously updating from prior mistakes.
引用
收藏
页码:557 / 569
页数:13
相关论文
共 32 条
[31]  
Vapnik VN., 1998, STAT LEARNING THEORY
[32]  
Wang K., 2003, Work. Data Min. Comput. Secur, P10