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
来源：
GRID AND COOPERATIVE COMPUTING GCC 2004 WORKSHOPS, PROCEEDINGS | 2004年 / 3252卷
关键词：
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 条
  • [31] An algorithm for mining maximal frequent itemsets without candidate generation
    Li Haiwen
    Yang Li
    Hong De
    2011 INTERNATIONAL CONFERENCE ON COMPUTER, ELECTRICAL, AND SYSTEMS SCIENCES, AND ENGINEERING (CESSE 2011), 2011, : 330 - 333
  • [32] An efficient approach based on selective partitioning for maximal frequent itemsets mining
    Bai, Anita
    Dhabu, Meera
    Jagtap, Viraj
    Deshpande, Parag S.
    SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2019, 44 (08):
  • [33] Online mining (recently) maximal frequent itemsets over data streams
    Li, HF
    Lee, SY
    Shan, MK
    15th International Workshop on Research Issues in Data Engineering: Stream Data Mining and Applications, Proceedings, 2005, : 11 - 18
  • [34] An efficient approach based on selective partitioning for maximal frequent itemsets mining
    Anita Bai
    Meera Dhabu
    Viraj Jagtap
    Parag S Deshpande
    Sādhanā, 2019, 44
  • [35] Mining maximal frequent itemsets in a sliding window over data streams
    Mao Y.
    Li H.
    Yang L.
    Liu L.
    Gaojishu Tongxin/Chinese High Technology Letters, 2010, 20 (11): : 1142 - 1148
  • [36] A Mining Maximal Frequent Itemsets over the Entire History of Data Streams
    Mao, Yinmin
    Li, Hong
    Yang, Lumin
    Chen, Zhigang
    Liu, Lixin
    FIRST INTERNATIONAL WORKSHOP ON DATABASE TECHNOLOGY AND APPLICATIONS, PROCEEDINGS, 2009, : 413 - 417
  • [37] Mining maximal frequent itemsets using combined FP-tree
    Yan, YJ
    Li, ZJ
    Wang, T
    Chen, YX
    Chen, HW
    AI 2004: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 3339 : 475 - 487
  • [38] A Depth-First Search Algorithm of Mining Maximal Frequent Itemsets
    Zhang Xin
    Li Kunlun
    Liao Pin
    2015 SEVENTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTATIONAL INTELLIGENCE (ICACI), 2015, : 170 - 173
  • [39] Mining Opened Frequent Itemsets to Generate Maximal Boolean Association Rules
    Jiang, Baoqing
    Han, Chong
    Li, Lingsheng
    2009 IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING ( GRC 2009), 2009, : 274 - 277
  • [40] A New Method for Mining Maximal Frequent Itemsets based on Graph Theory
    Nadi, Farzad
    Foroozandeh, Atefeh
    Hormozi, Shahram Golzari
    Shahraki, Mohammad H. Nadimi
    2014 4TH INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE), 2014, : 183 - 188
12345