A New Association Rule Mining based on Coverage and Exclusion for Network Intrusion Detection
2
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
Applying various association rule mining algorithms to the network intrusion detection task involves two critical issues: too large size of generated rule set which is hard to be utilized for IoT systems and hardness of control of false negative/positive rates. In this research, we propose an association rule mining algorithm based on the newly defined measures called coverage and exclusion. Coverage shows how frequently a pattern is discovered among the transactions of a class and exclusion does how frequently a pattern is not discovered in the transactions of the other classes. We compare our algorithm experimentally with the Apriori algorithm which is the most famous algorithm using the public dataset called KDDcup99. Compared to Apriori, the proposed algorithm reduces the resulting rule set size by up to 93.2 percent while keeping accuracy completely. The proposed algorithm also controls perfectly the false negative/positive rates of the generated rules by parameters. Therefore, network analysts can effectively apply the proposed association rule mining to the network intrusion detection task by solving two issues.
Abstract
Applying various association rule mining algorithms to the network intrusion detection task involves two critical issues: too large size of generated rule set which is hard to be utilized for IoT systems and hardness of control of false negative/positive rates. In this research, we propose an association rule mining algorithm based on the newly defined measures called coverage and exclusion. Coverage shows how frequently a pattern is discovered among the transactions of a class and exclusion does how frequently a pattern is not discovered in the transactions of the other classes. We compare our algorithm experimentally with the Apriori algorithm which is the most famous algorithm using the public dataset called KDDcup99. Compared to Apriori, the proposed algorithm reduces the resulting rule set size by up to 93.2 percent while keeping accuracy completely. The proposed algorithm also controls perfectly the false negative/positive rates of the generated rules by parameters. Therefore, network analysts can effectively apply the proposed association rule mining to the network intrusion detection task by solving two issues.
참고문헌 (18)
- A. S. Sadh, "Association Rules Optimization : A Survey", Int. J. of Advanced Comput. Res, 3(1), pp.111~115 (2013)
- G. J. Simon, "Extending Association Rule Summarization Techniques to Assess Risk of Diabetes Mellitus", IEEE Trans. Knowl. Data Eng, 27(1), pp.130~141 (2015)
- I. F. Videla-Cavieres, "Extending market basket analysis with graph mining techniques : A real case", Expert Syst. Appl, 41(4), pp.1928~1936 (2014)
- A. C. Squicciarini, "Privacy Policy Inference of User-Uploaded Images on Content Sharing Sites", IEEE Trans. Knowl. Data Eng, 27(1), pp.193~206 (2015)
- 이근호, "사물인터넷 환경에서 시스템에 대한 비정상행위 방지 기법", 사물인터넷융복합논문지, 5(2), pp.95~101 (2019), 한국사물인터넷학회
- I. H. Sarker, "Internet of things(iot)security intelligence : a comprehensive overview, machine learning solutions and research directions", Mobile Networks and Applications, pp.1~17 (2022)
- D. Sellappan, "Handbook of Research on Intelligent Data Processing and Information Security Systems", pp.1~24 (2020)
- L. Ertoz, "Next Generation Data Mining" (2004), MIT Press
- C. Miao, "A Study of Intrusion Detection System Based on Data Mining", 2010 IEEE Int. Conf. on Inform. Theory and Inform. Security, pp.186~189 (2010)
- N. Khamphakdee, "Improving Intrusion Detection System Based on Snort Rules for Network Probe Attacks Detection with Association Rules Technique of Data Mining", J. ICT Res. Appl, 8(3), pp.234~250 (2015)
- R. Agrawal, "Fast Algorithms for Mining Association Rules", Proc. 20th VLDB Conf, 1215, pp.487~499 (1994)
- J. Han, "Mining Frequent Patterns without Candidate Generation", ACM Sigmod Rec, 29(2), pp.1~12 (2000)
- A. Y. R. Gonzalez, "Mining frequent patterns and association rules using similarities", Expert Syst. Appl, 40, pp.6823~6836 (2013)
- R. Agrawal, "Mining association rules between sets of items in large databases", ACM Sigmod Rec, 22(2), pp.207~216 (1993)
- M. Hahsler, "New Probabilistic Interest Measures for Association Rules", Intelligent Data Anal, 11(5), pp.437~455 (2007)
- F. Benites, "Evaluation of Hierarchical Interestingness Measures for Mining Pairwise Generalized Association Rules", IEEE Trans. Knowl. Data Eng, 26(12), pp.3012~3025 (2014)
- "KDD Cup 1999 Data"[URL]
- "The NSL-KDD Data Set"[URL]