Concept Shift Detection for Frequent Itemsets from Sliding Windows over Data Streams

被引:0
|
作者
Koh, Jia-Ling [1 ]
Lin, Ching-Yi [1 ]
机构
[1] Natl Taiwan Normal Univ, Dept Comp Sci & Informat Engn, Taipei, Taiwan
来源
DATABASE SYSTEMS FOR ADVANCED APPLICATIONS | 2009年 / 5667卷
关键词
Frequent Itemsets; Data Streams; Change Detection;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In a mobile business collaboration environment, frequent itemsets analysis will discover the noticeable associated events and data to provide important information of user behaviors. Many algorithms have been proposed for mining frequent itemsets over data streams. However, in many practical situations where the data arrival rate is very high, continuous mining the data sets within a sliding window is unfeasible. For such cases, we propose an approach whereby the data stream is monitored continuously to detect any occurrence of a concept shift. In this context, a "concept-shift" means a significant number of frequent itemsets in the up-to-date sliding window are different from the previously discovered frequent itemsets. Our goal is to detect the notable changes of frequent itemsets according to an estimated changing rate of frequent itemsets without having to perform mining of the frequent itemsets at every time point. Consequently, for saving the computing costs, it is triggered to discover the complete set of new frequent itemsets only when any significant change is observed. The experimental results show that the proposed method detects concept shifts of frequent itemsets both effectively and efficiently.
引用
收藏
页码:334 / 348
页数:15
相关论文
共 50 条
  • [1] 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
  • [2] Mining frequent itemsets over data streams using efficient window sliding techniques
    Li, Hua-Fu
    Lee, Suh-Yin
    EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (02) : 1466 - 1477
  • [3] Finding frequent itemsets over online data streams
    Chang, Joong Hyuk
    Lee, Won Suk
    INFORMATION AND SOFTWARE TECHNOLOGY, 2006, 48 (07) : 606 - 618
  • [4] Mining Recent Maximal Frequent Itemsets Over Data Streams with Sliding Window
    Cai, Saihua
    Hao, Shangbo
    Sun, Ruizhi
    Wu, Gang
    INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY, 2019, 16 (06) : 961 - 969
  • [5] A frequent itemsets mining algorithm based on matrix in sliding window over data streams
    Fan Guidan
    Yin Shaohong
    2013 THIRD INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEM DESIGN AND ENGINEERING APPLICATIONS (ISDEA), 2013, : 66 - 69
  • [6] Sliding Window- based Frequent Itemsets Mining over Data Streams using Tail Pointer Table
    Wang, Le
    Feng, Lin
    Jin, Bo
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2014, 7 (01) : 25 - 36
  • [7] Sliding Window-based Frequent Itemsets Mining over Data Streams using Tail Pointer Table
    Le Wang
    Lin Feng
    Bo Jin
    International Journal of Computational Intelligence Systems, 2014, 7 : 25 - 36
  • [8] A survey on algorithms for mining frequent itemsets over data streams
    James Cheng
    Yiping Ke
    Wilfred Ng
    Knowledge and Information Systems, 2008, 16 : 1 - 27
  • [9] A survey on algorithms for mining frequent itemsets over data streams
    Cheng, James
    Ke, Yiping
    Ng, Wilfred
    KNOWLEDGE AND INFORMATION SYSTEMS, 2008, 16 (01) : 1 - 27
  • [10] 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