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 条
  • [21] Mining frequent items and itemsets from distributed data streams for emergency detection and management
    Albino Altomare
    Eugenio Cesario
    Domenico Talia
    Journal of Ambient Intelligence and Humanized Computing, 2017, 8 : 47 - 55
  • [22] Sketching asynchronous data streams over sliding windows
    Xu, Bojian
    Tirthapura, Srikanta
    Busch, Costas
    DISTRIBUTED COMPUTING, 2008, 20 (05) : 359 - 374
  • [23] Clustering Data Streams over Sliding Windows by DCA
    Ta Minh Thuy
    Le Thi Hoai An
    Boudjeloud-Assala, Lydia
    ADVANCED COMPUTATIONAL METHODS FOR KNOWLEDGE ENGINEERING, 2013, 479 : 65 - 75
  • [24] Sketching asynchronous data streams over sliding windows
    Bojian Xu
    Srikanta Tirthapura
    Costas Busch
    Distributed Computing, 2008, 20 : 359 - 374
  • [25] Finding recently frequent itemsets adaptively over online transactional data streams
    Chang, Joong Hyuk
    Lee, Won Suk
    INFORMATION SYSTEMS, 2006, 31 (08) : 849 - 869
  • [26] Efficient mining algorithm of frequent itemsets for uncertain data streams
    Wang Qianqian
    Liu Fang-ai
    PROCEEDINGS OF 2016 9TH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID), VOL 2, 2016, : 443 - 446
  • [27] Mining Frequent Itemsets in Data Streams Based on Genetic Algorithm
    Han, Chong
    Sun, Lijuan
    Guo, Jian
    Chen, Xiaodong
    2013 15TH IEEE INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY (ICCT), 2013, : 748 - 753
  • [28] Decaying obsolete information in finding recent frequent itemsets over data streams
    Chang, JH
    Lee, WS
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2004, E87D (06): : 1588 - 1592
  • [29] Uncertain Frequent Itemsets Mining Algorithm on Data Streams with Constraints
    Yu, Qun
    Tang, Ke-Ming
    Tang, Shi-Xi
    Lv, Xin
    INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2016, 2016, 9937 : 192 - 201
  • [30] Mining Frequent Itemsets from Online Data Streams: Comparative Study
    Nabil, HebaTallah Mohamed
    Eldin, Ahmed Sharaf
    Belal, Mohamed Abd El-Fattah
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2013, 4 (07) : 117 - 125