A sliding window algorithm for mining frequent itemsets on data stream

被引:0
|
作者
Liu, Junqiang [1 ]
Li, Xiurong [1 ]
机构
[1] Zhejiang Gongshang Univ, Inst Artif Intelligence, Hangzhou, Zhejiang, Peoples R China
来源
DCABES 2006 PROCEEDINGS, VOLS 1 AND 2 | 2006年
关键词
data mining; data stream; frequent itemsets; sliding window;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Sonic applications generate continuous, unbounded, and extremely fast data stream. Due to its characteristics, it is difficult to apply the existing productions of mining frequent itemsets in traditional databases to the data stream environment directly. A one-scan algorithm SFP of mining frequent itemsets on data stream was proposed by using a fixed-size sliding window model and adopting a data structure of SPFT. The window limited memory usage. SPFT made use of the advantages of FP-Growth and additionally introduced a pivotal timeldList into the SPFT. TimeldList marked the itemsets contained in those expired transactions so as to remove the effect of old transactions on the mining results as the window slides forward.
引用
收藏
页码:637 / 639
页数:3
相关论文
共 50 条
  • [31] Mining frequent itemsets in a stream
    Calders, Toon
    Dexters, Nele
    Gillis, Joris J. M.
    Goethals, Bart
    INFORMATION SYSTEMS, 2014, 39 : 233 - 255
  • [32] An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
    Yen, Show-Jane
    Lee, Yue-Shi
    Wu, Cheng-Wei
    Lin, Chin-Lin
    NEXT-GENERATION APPLIED INTELLIGENCE, PROCEEDINGS, 2009, 5579 : 767 - 776
  • [33] An efficient algorithm for mining maximal frequent itemsets over data streams
    Mao Y.
    Yang L.
    Li H.
    Chen Z.
    Liu L.
    Gaojishu Tongxin/Chinese High Technology Letters, 2010, 20 (03): : 246 - 252
  • [34] An Efficient Sliding Window Based Algorithm for Adaptive Frequent Itemset Mining over Data Streams
    Deypir, Mhmood
    Sadreddini, Mohammad Hadi
    Taahomi, Mehran
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2013, 29 (05) : 1001 - 1020
  • [35] A New Sliding Window Based Algorithm for Frequent Closed Itemset Mining Over Data Streams
    Nori, Fatemeh
    Deypir, Mahmood
    Sadreddini, Mohamad Hadi
    Ziarati, Korosh
    2011 1ST INTERNATIONAL ECONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE), 2011, : 249 - 253
  • [36] Closed High Utility Itemsets Mining over Data Stream Based on Sliding Window Model
    Cheng H.
    Han M.
    Zhang N.
    Li X.
    Wang L.
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2021, 58 (11): : 2500 - 2514
  • [37] 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
  • [38] An Improved Algorithm for Frequent Itemsets Mining
    Jiang, Hao
    He, Xu
    2017 FIFTH INTERNATIONAL CONFERENCE ON ADVANCED CLOUD AND BIG DATA (CBD), 2017, : 314 - 317
  • [39] A Frequent Itemsets Data Mining Algorithm Based on Differential Privacy
    Li, Qingpeng
    Zhang, Longjun
    Li, Haoyu
    Sun, Wenjun
    PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, INFORMATION MANAGEMENT AND NETWORK SECURITY, 2016, 47 : 251 - 253
  • [40] Towards a new approach for mining frequent itemsets on data stream
    Chedy Raïssi
    Pascal Poncelet
    Maguelonne Teisseire
    Journal of Intelligent Information Systems, 2007, 28 : 23 - 36