Mining Frequent Item over Evolving Data Streams Based On Decay Function Model

被引:0
|
作者
Tan Junshan [1 ]
Kuang Zhufang [1 ]
机构
[1] Cent S Univ Forestry & Technol, Sch Comp & Informat Engn, Changsha, Hunan, Peoples R China
关键词
data streams; data mining; frequent item; decay function; sliding window;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Because of the fluidity and continuity of data stream, the knowledge embedded in stream data is most likely to be changed as time goes by. Thus, in most data stream applications, people are more interested in the information of the recent transactions than that of the old. A data structure DF-FI is put forward based on this foundation. An algorithm DFStream which based on decay function for mining frequent item over data streams is put forward. The DFStream algorithm can accurately mining the frequent item over the sliding window. The IBM synthesizes data generation which output customer shopping a data and the accessing record of the world cup official website data in 1998 are adopted as experiment data. The algorithm has a very high preciseness for mining frequent item, and fast ability for data processing.
引用
收藏
页码:762 / 767
页数:6
相关论文
共 50 条
  • [1] An Efficient Algorithm for Mining Frequent Item over Data Streams Based on Sliding Window
    Kuang Zhufang
    Yang Guogui
    Xin Dongjun
    ICCSE 2008: PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDUCATION: ADVANCED COMPUTER TECHNOLOGY, NEW EDUCATION, 2008, : 613 - 618
  • [2] Efficient algorithm for mining approximate frequent item over data streams
    Wang, Wei-Ping
    Li, Jian-Zhong
    Zhang, Dong-Dong
    Guo, Long-Jiang
    Ruan Jian Xue Bao/Journal of Software, 2007, 18 (04): : 884 - 892
  • [3] A Change Detector for Mining Frequent Patterns over Evolving Data Streams
    Ng, Willie
    Dash, Manoranjan
    2008 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC), VOLS 1-6, 2008, : 2406 - +
  • [4] Mining evolving data streams for frequent patterns
    Laur, Pierre-Alain
    Nock, Richard
    Symphor, Jean-Emile
    Poncelet, Pascal
    PATTERN RECOGNITION, 2007, 40 (02) : 492 - 503
  • [5] TDMCS: An Efficient Method for Mining Closed Frequent Patterns over Data Streams Based on Time Decay Model
    Han, Meng
    Ding, Jian
    Li, Juan
    INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY, 2017, 14 (06) : 851 - 860
  • [6] An efficient algorithm for mining top-k closed frequent item sets over data streams over data streams
    Yimin, Mao
    Xiaofang, Xue
    Jinqing, Chen
    Telkomnika - Indonesian Journal of Electrical Engineering, 2013, 11 (07): : 3759 - 3766
  • [7] Mining frequent closed trees in evolving data streams
    Bifet, Albert
    Gavalda, Ricard
    INTELLIGENT DATA ANALYSIS, 2011, 15 (01) : 29 - 48
  • [8] Mining Frequent Item Sets in Asynchronous Transactional Data Streams over Time Sensitive Sliding Windows Model
    Javaid, Qaisar
    Memon, Farida
    Talpur, Shahnawaz
    Arif, Muhammad
    Awan, Muhammad Daud
    MEHRAN UNIVERSITY RESEARCH JOURNAL OF ENGINEERING AND TECHNOLOGY, 2016, 35 (04) : 625 - 644
  • [9] Mining frequent closed patterns with item constraints in data streams
    Hu, Wei-Cheng
    Wang, Ben-Nian
    Cheng, Zhuan-Liu
    PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, : 274 - 280
  • [10] Bloom Filter Based Frequent Patterns Mining over Data Streams
    Tan JunShan
    Kuang Zhufang
    Yang Guogui
    INTERNATIONAL CONFERENCE ON GRAPHIC AND IMAGE PROCESSING (ICGIP 2012), 2013, 8768