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 条
  • [41] Efficient mining of maximal frequent itemsets from databases on a cluster of workstations
    Soon M. Chung
    Congnan Luo
    Knowledge and Information Systems, 2008, 16 : 359 - 391
  • [42] Mining Maximal Frequent Itemsets: A java']java implementation of FPMAX Algorithm
    Ziani, B.
    Ouinten, Y.
    2009 INTERNATIONAL CONFERENCE ON INNOVATIONS IN INFORMATION TECHNOLOGY, 2009, : 11 - 15
  • [43] A two-way hybrid algorithm for maximal frequent itemsets mining
    Chen, Fu-zan
    Li, Min-qiang
    FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 3, PROCEEDINGS, 2007, : 499 - 503
  • [44] An efficient algorithm for mining maximal frequent itemsets over data streams
    Mao Y.
    Yang L.
    Li H.
    Chen Z.
    Liu L.
    Gaojishu Tongxin/Chinese High Technology Letters, 2010, 20 (03): : 246 - 252
  • [45] Efficient mining of maximal frequent itemsets from databases on a cluster of workstations
    Chung, Soon M.
    Luo, Congnan
    KNOWLEDGE AND INFORMATION SYSTEMS, 2008, 16 (03) : 359 - 391
  • [46] Research on Mining Global Maximal Frequent Itemsets for Health Big Data
    He, Bo
    Pei, Jianhui
    2017 IEEE 3RD INFORMATION TECHNOLOGY AND MECHATRONICS ENGINEERING CONFERENCE (ITOEC), 2017, : 1143 - 1146
  • [47] Incremental mining of weighted maximal frequent itemsets from dynamic databases
    Yun, Unil
    Lee, Gangin
    EXPERT SYSTEMS WITH APPLICATIONS, 2016, 54 : 304 - 327
  • [48] Online mining (recently) maximal frequent itemsets over data streams
    Li, H.-F. (hfli@csie.nctu.edu.tw), IEEE Computer Society Tech. Committee on Data Eng., TCDE (Institute of Electrical and Electronics Engineers Computer Society):
  • [49] Distributed mining of maximal frequent itemsets from Databases on a cluster of workstations
    Chung, SM
    Luo, CN
    2004 IEEE INTERNATIONAL SYMPOSIUM ON CLUSTER COMPUTING AND THE GRID - CCGRID 2004, 2004, : 499 - 507
  • [50] Mining maximal frequent itemsets using the ordered FP-tree
    Yu, Hong
    Wang, Xiu-Kun
    Meng, Jun
    Kongzhi yu Juece/Control and Decision, 2007, 22 (05): : 520 - 524
12345