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 条
  • [41] Mining frequent itemsets in data streams within a time horizon
    Troiano, Luigi
    Scibelli, Giacomo
    DATA & KNOWLEDGE ENGINEERING, 2014, 89 : 21 - 37
  • [42] Frequent Itemsets Mining in Data Streams Using Reconfigurable Hardware
    Bustio, Lazaro
    Cumplido, Rene
    Hernandez, Raudel
    Bande, Jose M.
    Feregrino, Claudia
    NEW FRONTIERS IN MINING COMPLEX PATTERNS, 2016, 9607 : 32 - 45
  • [43] DSM-FI: an efficient algorithm for mining frequent itemsets in data streams
    Li, Hua-Fu
    Shan, Man-Kwan
    Lee, Suh-Yin
    KNOWLEDGE AND INFORMATION SYSTEMS, 2008, 17 (01) : 79 - 97
  • [44] Mining Frequent Itemsets with Normalized Weight in Continuous Data Streams
    Kim, Younghee
    Kim, Wonyoung
    Kim, Ungmo
    JOURNAL OF INFORMATION PROCESSING SYSTEMS, 2010, 6 (01): : 79 - 90
  • [45] Search method of time sensitive frequent itemsets in data streams
    Park, Tae-Su
    Lee, Ju-Hong
    Park, Sang-Ho
    Choi, Bumghi
    Kim, Deok-Hwan
    PROGRESS IN PATTERN RECOGNITION, IMAGE ANALYSIS AND APPLICATIONS, PROCEEDINGS, 2006, 4225 : 511 - 518
  • [46] A sliding window algorithm for mining frequent itemsets on data stream
    Liu, Junqiang
    Li, Xiurong
    DCABES 2006 PROCEEDINGS, VOLS 1 AND 2, 2006, : 637 - 639
  • [47] Interactive mining of top-K frequent closed itemsets from data streams
    Li, Hua-Fu
    EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (07) : 10779 - 10788
  • [48] Incremental mining of closed inter-transaction itemsets over data stream sliding windows
    Chiu, Shih-Chuan
    Li, Hua-Fu
    Huang, Jiun-Long
    You, Hsin-Han
    JOURNAL OF INFORMATION SCIENCE, 2011, 37 (02) : 208 - 220
  • [49] Queueing Analysis of Continuous Queries for Uncertain Data Streams Over Sliding Windows
    Xiao, Guoqing
    Li, Kenli
    Zhou, Xu
    Li, Keqin
    INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2016, 30 (09)
  • [50] An Efficient Subset-Lattice Algorithm for Mining Closed Frequent Itemsets in Data Streams
    Chang, Ye-In
    Li, Chia-En
    Peng, Wei-Hau
    2012 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI), 2012, : 21 - 26