An Automated Penetration Semantic Knowledge Mining Algorithm Based on Bayesian Inference

被引:4
作者
Zang, Yichao [1 ]
Hu, Tairan [2 ]
Zhou, Tianyang [2 ]
Deng, Wanjiang [3 ]
机构
[1] State Key Lab Math Engn & Adv Comp, Zhengzhou 450000, Peoples R China
[2] Natl Engn Technol Res Ctr Digital Switching Syst, Zhengzhou 450000, Peoples R China
[3] Natl Univ Singapore, NUS Business Sch, Singapore 119077, Singapore
来源
CMC-COMPUTERS MATERIALS & CONTINUA | 2021年 / 66卷 / 03期
基金
中国国家自然科学基金;
关键词
Penetration semantic knowledge; automated penetration testing; Bayesian inference; cyber security; FREQUENT ITEMSETS;
D O I
10.32604/cmc.2021.012220
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Mining penetration testing semantic knowledge hidden in vast amounts of raw penetration testing data is of vital importance for automated penetration testing. Associative rule mining, a data mining technique, has been studied and explored for a long time. However, few studies have focused on knowledge discovery in the penetration testing area. The experimental result reveals that the long-tail distribution of penetration testing data nullifies the effectiveness of associative rule mining algorithms that are based on frequent pattern. To address this problem, a Bayesian inference based penetration semantic knowledge mining algorithm is proposed. First, a directed bipartite graph model, a kind of Bayesian network, is constructed to formalize penetration testing data. Then, we adopt the maximum likelihood estimate method to optimize the model parameters and decompose a large Bayesian network into smaller networks based on conditional independence of variables for improved solution efficiency. Finally, irrelevant variable elimination is adopted to extract penetration semantic knowledge from the conditional probability distribution of the model. The experimental results show that the proposed method can discover penetration semantic knowledge from raw penetration testing data effectively and efficiently.
引用
收藏
页码:2573 / 2585
页数:13
相关论文
共 22 条
[1]  
[Anonymous], 2010, KDD, DOI DOI 10.1145/1835804.1835839
[2]   negFIN: An efficient algorithm for fast mining frequent itemsets [J].
Aryabarzan, Nader ;
Minaei-Bidgoli, Behrouz ;
Teshnehlab, Mohammad .
EXPERT SYSTEMS WITH APPLICATIONS, 2018, 105 :129-143
[3]   Nonlinear optical components for all-optical probabilistic graphical model [J].
Babaeian, Masoud ;
Blanche, Pierre-A. ;
Norwood, Robert A. ;
Kaplas, Tommi ;
Keiffer, Patrick ;
Svirko, Yuri ;
Allen, Taylor G. ;
Chen, Vincent W. ;
Chi, San-Hui ;
Perry, Joseph W. ;
Marder, Seth R. ;
Neifeld, Mark A. ;
Peyghambarian, N. .
NATURE COMMUNICATIONS, 2018, 9
[4]   A Two-Phase Algorithm for Mining Sequential Patterns with Differential Privacy [J].
Bonomi, Luca ;
Xiong, Li .
PROCEEDINGS OF THE 22ND ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM'13), 2013, :269-278
[5]   PrePost+: An efficient N-lists-based algorithm for mining frequent itemsets via Children-Parent Equivalence pruning [J].
Deng, Zhi-Hong ;
Lv, Sheng-Long .
EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (13) :5424-5432
[6]   Fast mining frequent itemsets using Nodesets [J].
Deng, Zhi-Hong ;
Lv, Sheng-Long .
EXPERT SYSTEMS WITH APPLICATIONS, 2014, 41 (10) :4505-4512
[7]   A new algorithm for fast mining frequent itemsets using N-lists [J].
Deng ZhiHong ;
Wang ZhongHui ;
Jiang JiaJian .
SCIENCE CHINA-INFORMATION SCIENCES, 2012, 55 (09) :2008-2030
[8]   EclatDS: An efficient sliding window based frequent pattern mining method for data streams [J].
Deypir, Mahmood ;
Sadreddini, Mohammad Hadi .
INTELLIGENT DATA ANALYSIS, 2011, 15 (04) :571-587
[9]  
[冯兴杰 Feng Xingjie], 2016, [计算机应用研究, Application Research of Computers], V33, P754
[10]   The SPMF Open-Source Data Mining Library Version 2 [J].
Fournier-Viger, Philippe ;
Lin, Jerry Chun-Wei ;
Gomariz, Antonio ;
Gueniche, Ted ;
Soltani, Azadeh ;
Deng, Zhihong ;
Hoang Thanh Lam .
MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, ECML PKDD 2016, PT III, 2016, 9853 :36-40