MID: An Innovative Model for Intrusion Detection by Mining Maximal Frequent Patterns

被引:0
|
作者
Wang, Hui [1 ]
Ma, Chuanxiang [2 ]
Zhang, Hongjun [3 ]
机构
[1] Wuhan Telecommun Acad, Wuhan, Peoples R China
[2] Hubei Univ, Comp Sch, Wuhan 430070, Peoples R China
[3] 161 Hosp, Dept Informat, Wuhan 430010, Peoples R China
关键词
Data mining; Intrusion detection system; Maximal frequent pattern; Accuracy; Performance;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Intrusion detection is a very important topic in dependable computing. Intrusion detection system has become a vital part in network security systems with wide spread use of computer networks. It has been the recent research focus and trend to apply various kinds of data mining techniques in IDS for discovering new types of attacks efficiently, but it is still in its infancy. The most difficult part is their poor performance and accuracy. This paper presents an innovative model, called MID, that counts maximal frequent patterns for detecting intrusions, needless to count all association rules, can significantly improve the accuracy and performance of an IDS. The experimental results show that MID is efficient and accurate for the attacks that occur intensively in a short period of time.
引用
收藏
页数:4
相关论文
共 50 条
  • [31] Mining maximal frequent patterns based on improved FP-tree in database
    Liu Wenzhou
    Hao Xinghai
    Meng Xiangping
    Wang Huajin
    3RD INT CONF ON CYBERNETICS AND INFORMATION TECHNOLOGIES, SYSTEMS, AND APPLICAT/4TH INT CONF ON COMPUTING, COMMUNICATIONS AND CONTROL TECHNOLOGIES, VOL 2, 2006, : 297 - +
  • [32] Mining maximal frequent patterns based on hierarchical bit vector and stack principle
    College of Information Science and Engineering, Yanshan University, Qinhuangdao, China
    不详
    J. Comput. Inf. Syst., 1 (369-376):
  • [33] Mining maximal frequent patterns by considering weight conditions over data streams
    Yun, Unil
    Lee, Gangin
    Ryu, Keun Ho
    KNOWLEDGE-BASED SYSTEMS, 2014, 55 : 49 - 65
  • [34] The Complexity of Mining Maximal Frequent Subgraphs
    Kimelfeld, Benny
    Kolaitis, Phokion G.
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2014, 39 (04):
  • [35] MARGIN: Maximal Frequent Subgraph Mining
    Thomas, Lini T.
    Valluri, Satyanarayana R.
    Karlapalem, Kamalakar
    ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2010, 4 (03)
  • [36] MARGIN: Maximal frequent subgraph mining
    Thomas, Lini T.
    Valluri, Satyanarayana R.
    Karlapalem, Kamalakar
    ICDM 2006: SIXTH INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2006, : 1097 - +
  • [37] Efficiently mining maximal frequent itemsets
    Gouda, K
    Zaki, MJ
    2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, : 163 - 170
  • [38] Maximal Frequent Item Sequences Mining
    Zhou Lijuan
    Zhang Zhang
    PROGRESS IN MEASUREMENT AND TESTING, PTS 1 AND 2, 2010, 108-111 : 1211 - 1216
  • [39] On Maximal Frequent Itemsets Mining with Constraints
    Jabbour, Said
    Mana, Fatima Ezzahra
    Dlala, Imen Ouled
    Raddaoui, Badran
    Sais, Lakhdar
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, 2018, 11008 : 554 - 569
  • [40] A data mining based intrusion detection model
    Sun, JH
    Jin, H
    Chen, H
    Han, ZF
    Zou, DQ
    INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING, 2003, 2690 : 677 - 684