首页 | 官方网站   微博 | 高级检索  
     


Association Rule Mining Frequent-Pattern-Based Intrusion Detection in Network
Authors:S Sivanantham  V Mohanraj  Y Suresh  J Senthilkumar
Affiliation:1 Department of Information and Communication Engineering, Anna University, Chennai, 600025, Tamilnadu, India2 Department of Electronics and Communication Engineering, VeltechMultitech Dr. RR Dr. SR Engineering College, Chennai-42, Tamilnadu, India
Abstract:In the network security system, intrusion detection plays a significant role. The network security system detects the malicious actions in the network and also conforms the availability, integrity and confidentiality of data information resources. Intrusion identification system can easily detect the false positive alerts. If large number of false positive alerts are created then it makes intrusion detection system as difficult to differentiate the false positive alerts from genuine attacks. Many research works have been done. The issues in the existing algorithms are more memory space and need more time to execute the transactions of records. This paper proposes a novel framework of network security Intrusion Detection System (IDS) using Modified Frequent Pattern (MFP-Tree) via K-means algorithm. The accuracy rate of Modified Frequent Pattern Tree (MFPT)-K means method in finding the various attacks are Normal 94.89%, for DoS based attack 98.34%, for User to Root (U2R) attacks got 96.73%, Remote to Local (R2L) got 95.89% and Probe attack got 92.67% and is optimal when it is compared with other existing algorithms of K-Means and APRIORI.
Keywords:IDS  K-means  frequent pattern tree  false alert  mining  L1-norm
点击此处可从《计算机系统科学与工程》浏览原始摘要信息
点击此处可从《计算机系统科学与工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号