Mining Incrementally Closed Itemsets over Data Stream with the Technique of Batch-Update

被引:0
|
作者
Thanh-Trung Nguyen [1 ]
Quang Nguyen [1 ]
Ngo Thanh Hung [2 ]
机构
[1] Hong Bang Int Univ, Dept Informat Technol, Ho Chi Minh City, Vietnam
[2] Ho Chi Minh City Univ Technol, Fac Informat Technol, Ho Chi Minh City, Vietnam
关键词
Batch-update; Constructive set; Data mining; Data stream; Incremental mining; LATTICES;
D O I
10.1007/978-3-030-35653-8_6
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Currently incremental mining techniques can be divided into two groups: direct-update technique and batch-update technique. Mining closed item sets is one of the core tasks of data mining. In addition, advances in hardware technology and information technology have created huge data streams in recent years. Therefore, mining incrementally closed item sets over data streams with the batch-update technique is necessary. Incremental algorithms are always associated with an intermediate structure such as tree, lattice, table. In the previous study, the author proposed an intermediate structure which is a linear list called constructive set. In this paper, an incremental mining algorithm based on the constructive with the batch-update technique is proposed in order to mine data streams.
引用
收藏
页码:68 / 84
页数:17
相关论文
共 50 条
  • [1] An Efficient Algorithm for Mining Frequent Closed Itemsets over Data Stream
    Li Guodong
    Xia Kewen
    NEW TRENDS IN MECHATRONICS AND MATERIALS ENGINEERING, 2012, 151 : 570 - 575
  • [2] Mining Closed Frequent Itemsets in the Sliding Window over Data Stream
    Mao Yinmin
    Yang Lumin
    Li Hong
    Chen Zhigang
    Liu Lixin
    2009 IEEE YOUTH CONFERENCE ON INFORMATION, COMPUTING AND TELECOMMUNICATION, PROCEEDINGS, 2009, : 146 - 149
  • [3] Improve frequent closed itemsets mining over data stream with bitmap
    Li, Haifeng
    Chen, Hong
    PROCEEDINGS OF NINTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING, 2008, : 399 - 404
  • [4] Moment plus : Mining Closed Frequent Itemsets over Data Stream
    Li, Haifeng
    Chen, Hong
    ADVANCED DATA MINING AND APPLICATIONS, PROCEEDINGS, 2008, 5139 : 612 - 619
  • [5] Mining approximate closed frequent itemsets over stream
    Li, Haifeng
    Lu, Zongjian
    Chen, Hong
    PROCEEDINGS OF NINTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING, 2008, : 405 - 410
  • [6] An Algorithm for Mining Frequent Closed Itemsets in Data Stream
    Dai, Caiyan
    Chen, Ling
    INTERNATIONAL CONFERENCE ON APPLIED PHYSICS AND INDUSTRIAL ENGINEERING 2012, PT C, 2012, 24 : 1722 - 1728
  • [7] An Algorithm for Mining Frequent Closed Itemsets in Data Stream
    Dai, Caiyan
    Chen, Ling
    2010 INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT (CCCM2010), VOL I, 2010, : 281 - 284
  • [8] An efficient algorithm for incrementally mining frequent closed itemsets
    Show-Jane Yen
    Yue-Shi Lee
    Chiu-Kuang Wang
    Applied Intelligence, 2014, 40 : 649 - 668
  • [9] An efficient algorithm for incrementally mining frequent closed itemsets
    Yen, Show-Jane
    Lee, Yue-Shi
    Wang, Chiu-Kuang
    APPLIED INTELLIGENCE, 2014, 40 (04) : 649 - 668
  • [10] CLAIM: An efficient method for relaxed frequent closed itemsets mining over stream data
    Song, Guojie
    Yang, Dongqing
    Cui, Bin
    Zheng, Baihua
    Liu, Yunfeng
    Xie, Kunqing
    ADVANCES IN DATABASES: CONCEPTS, SYSTEMS AND APPLICATIONS, 2007, 4443 : 664 - +