Mining maximal frequent itemsets for intrusion detection

被引:0
|
作者
Wang, H [1 ]
Li, QH [1 ]
Xiong, HY [1 ]
Jiang, SY [1 ]
机构
[1] Huazhong Univ Sci & Technol, Comp Sch, Wuhan 430074, Peoples R China
关键词
data mining; intrusion detection; maximal frequent itemset;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
It has been the recent research focus and trend to apply data mining techniques in an intrusion detection system for discovering new types of attacks, but it is still in its infancy. This paper presents an innovative technique, called MMID, that applies maximal frequent itemsets mining to intrusion detection and can significantly improve the accuracy and performance of an intrusion detection system. The experimental results show that MMID is efficient and accurate for the attacks that occur intensively in a short period of time.
引用
收藏
页码:422 / 429
页数:8
相关论文
共 50 条
  • [1] Efficiently mining maximal frequent itemsets
    Gouda, K
    Zaki, MJ
    2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, : 163 - 170
  • [2] 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
  • [3] Mining maximal frequent itemsets with frequent pattern list
    Qian, Jin
    Ye, Feiyue
    FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 1, PROCEEDINGS, 2007, : 628 - 632
  • [4] A New Method for Mining Maximal Frequent Itemsets
    Nadimi-Shahraki, Mohammad
    Mustapha, Norwati
    Sulaiman, Md Nasir B.
    Mamat, Ali B.
    INTERNATIONAL SYMPOSIUM OF INFORMATION TECHNOLOGY 2008, VOLS 1-4, PROCEEDINGS: COGNITIVE INFORMATICS: BRIDGING NATURAL AND ARTIFICIAL KNOWLEDGE, 2008, : 1064 - 1067
  • [5] Mining maximal frequent itemsets in uncertain data
    Tang, Xianghong
    Yang, Quanwei
    Zheng, Yang
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2015, 43 (09): : 29 - 34
  • [6] Scalable algorithm for mining maximal frequent itemsets
    Li, QH
    Wang, H
    He, Y
    Jiang, SY
    2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS, 2003, : 143 - 146
  • [7] Fast algorithm for mining maximal frequent itemsets
    Ma, Lisheng
    Deng, Huiwen
    PROCEEDINGS OF THE FIRST INTERNATIONAL SYMPOSIUM ON DATA, PRIVACY, AND E-COMMERCE, 2007, : 86 - +
  • [8] Recent Weighted Maximal Frequent Itemsets Mining
    Subbulakshmi, B.
    Dharini, B.
    Deisy, C.
    2017 INTERNATIONAL CONFERENCE ON I-SMAC (IOT IN SOCIAL, MOBILE, ANALYTICS AND CLOUD) (I-SMAC), 2017, : 391 - 397
  • [9] Efficiently Mining Maximal Diverse Frequent Itemsets
    Wu, Dingming
    Luo, Dexin
    Jensen, Christian S.
    Huang, Joshua Zhexue
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS (DASFAA 2019), PT II, 2019, 11447 : 191 - 207
  • [10] Parallel mining of maximal frequent itemsets in PC clusters
    Veng, Vong Chan
    IMECS 2008: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2008, : 480 - 485