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 条
  • [31] 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
  • [32] 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
  • [33] Tracking clusters in evolving data streams over sliding windows
    Zhou, Aoying
    Cao, Feng
    Qian, Weining
    Jin, Cheqing
    KNOWLEDGE AND INFORMATION SYSTEMS, 2008, 15 (02) : 181 - 214
  • [34] Random sampling algorithms for sliding windows over data streams
    Zhang, LB
    Li, ZH
    Yu, M
    Wang, Y
    Jiang, Y
    PROCEEDINGS OF THE 11TH JOINT INTERNATIONAL COMPUTER CONFERENCE, 2005, : 572 - 575
  • [35] Tracking clusters in evolving data streams over sliding windows
    Aoying Zhou
    Feng Cao
    Weining Qian
    Cheqing Jin
    Knowledge and Information Systems, 2008, 15 : 181 - 214
  • [36] Effect of Count Estimation in Finding Frequent Itemsets over Online Transactional Data Streams
    Joong Hyuk Chang
    Won Suk Lee
    Journal of Computer Science and Technology, 2005, 20 : 63 - 69
  • [37] Effect of count estimation in finding frequent itemsets over online transactional data streams
    Chang, JH
    Lee, WS
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2005, 20 (01) : 63 - 69
  • [38] Catch the moment: maintaining closed frequent itemsets over a data stream sliding window
    Chi, Yun
    Wang, Haixun
    Yu, Philip S.
    Muntz, Richard R.
    KNOWLEDGE AND INFORMATION SYSTEMS, 2006, 10 (03) : 265 - 294
  • [39] Catch the moment: maintaining closed frequent itemsets over a data stream sliding window
    Yun Chi
    Haixun Wang
    Philip S. Yu
    Richard R. Muntz
    Knowledge and Information Systems, 2006, 10 : 265 - 294
  • [40] DSM-FI: an efficient algorithm for mining frequent itemsets in data streams
    Hua-Fu Li
    Man-Kwan Shan
    Suh-Yin Lee
    Knowledge and Information Systems, 2008, 17 : 79 - 97