Closed Frequent Itemsets mining over Data streams for Visualizing Network Traffic

被引:0
|
作者
Jeyasutha, M. [1 ]
Dhanaseelan, F. Ramesh [1 ]
机构
[1] St Xaviers Catholic Coll Engn, Dept Comp Applicat, Nagercoil 629003, India
来源
2015 INTERNATIONAL CONFERENCED ON CIRCUITS, POWER AND COMPUTING TECHNOLOGIES (ICCPCT-2015) | 2015年
关键词
Data mining; Frequent Closed Itemsets; Sliding windows; Trans-sequence representation;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The main objective of Network monitoring is to understand the active events that happen frequently and can influence or ruin the network. In this paper, we have introduced an efficient method of Closed Frequent item set mining over data streams for visualizing these events. The proposed MFCI-SWI ( Mining Frequent Closed Item sets using Sliding Window with Intersection method) algorithm processes the data stream for mining only when user requires. Otherwise simply slides the window and receive the new transactions. Experimental evaluations on real datasets show that our proposed method outperforms recently proposed TMoment algorithm.
引用
收藏
页数:5
相关论文
共 50 条
  • [1] An Efficient Frequent Closed Itemsets Mining Algorithm Over Data Streams
    Tan, Jun
    Yu, Shao-jun
    2011 SECOND INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATION AND EDUCATION APPLICATION (ICEA 2011), 2011, : 197 - 201
  • [2] An Efficient Frequent Closed Itemsets Mining Algorithm Over Data Streams
    Tan, Jun
    Bu, Yingyong
    Yang, Bo
    2009 INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING, VOL 3, PROCEEDINGS, 2009, : 65 - +
  • [3] Fast Mining of Closed Frequent Itemsets in Data Streams
    Mao Yimin
    Chen Zhigang
    Liu Lixin
    INFORMATION TECHNOLOGY APPLICATIONS IN INDUSTRY, PTS 1-4, 2013, 263-266 : 231 - +
  • [4] Efficient strategies for incremental mining of frequent closed itemsets over data streams
    Liu, Junqiang
    Ye, Zhousheng
    Yang, Xiangcai
    Wang, Xueling
    Shen, Linjie
    Jiang, Xiaoning
    EXPERT SYSTEMS WITH APPLICATIONS, 2022, 191
  • [5] An algorithm for mining frequent closed itemsets with density from data streams
    Caiyan D.
    Ling C.
    Caiyan, Dai (daicaiyan@gmail.com), 1600, Inderscience Enterprises Ltd., 29, route de Pre-Bois, Case Postale 856, CH-1215 Geneva 15, CH-1215, Switzerland (12): : 146 - 154
  • [6] An algorithm for mining frequent closed itemsets with density from data streams
    Dai Caiyan
    Chen Ling
    INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2016, 12 (2-3) : 146 - 154
  • [7] Mining frequent closed itemsets from a landmark window over online data streams
    Liu, Xuejun
    Guan, Jihong
    Hu, Ping
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2009, 57 (06) : 927 - 936
  • [8] A New Algorithm for Mining Frequent Closed Itemsets from Data Streams
    Mao, Guojun
    Yang, Xialing
    Wu, Xindong
    2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 154 - +
  • [9] Interactive mining of top-K frequent closed itemsets from data streams
    Li, Hua-Fu
    EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (07) : 10779 - 10788
  • [10] Incremental updates of closed frequent itemsets over continuous data streams
    Li, Hlia-Fu
    Ho, Chin-Chuan
    Lee, Suh-Yin
    EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (02) : 2451 - 2458