Incremental updates of closed frequent itemsets over continuous data streams

Authors:
Hua-Fu Li;Chin-Chuan Ho;Suh-Yin Lee
Affiliations:
Department of Computer Science, Kainan University, Taiwan;Department of Computer Science, National Chiao-Tung University, Taiwan;Department of Computer Science, National Chiao-Tung University, Taiwan
Venue:
Expert Systems with Applications: An International Journal
Year:
2009

Citing 12
Cited 13

Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Models and issues in data stream systems

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Issues in data stream management

ACM SIGMOD Record
Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window

ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Online Mining (Recently) Maximal Frequent Itemsets over Data Streams

RIDE '05 Proceedings of the 15th International Workshop on Research Issues in Data Engineering: Stream Data Mining and Applications
An Algorithm for In-Core Frequent Itemset Mining on Streaming Data

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Research issues in data stream association rule mining

ACM SIGMOD Record
Approximate frequency counts over data streams

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
StatStream: statistical monitoring of thousands of data streams in real time

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
A regression-based temporal pattern mining scheme for data streams

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
False positive or false negative: mining frequent itemsets from high speed transactional data streams

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Interactive mining of top-K frequent closed itemsets from data streams

Expert Systems with Applications: An International Journal
Discovering frequent itemsets over transactional data streams through an efficient and stable approximate approach

Expert Systems with Applications: An International Journal
Mining closed flexible patterns in time-series databases

Expert Systems with Applications: An International Journal
Mining top-k frequent closed itemsets over data streams using the sliding window model

Expert Systems with Applications: An International Journal
Mining closed itemsets in data stream using formal concept analysis

DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
MHUI-max: An efficient algorithm for discovering high-utility itemsets from data streams

Journal of Information Science
Mining of multiobjective non-redundant association rules in data streams

ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Efficient algorithms for mining maximal high utility itemsets from data streams with different models

Expert Systems with Applications: An International Journal
Fast, Scalable, and Context-Sensitive Detection of Trending Topics in Microblog Post Streams

ACM Transactions on Management Information Systems (TMIS)
BIDE-Based parallel mining of frequent closed sequences with mapreduce

ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
A sliding window based algorithm for frequent closed itemset mining over data streams

Journal of Systems and Software
Incremental Algorithm for Discovering Frequent Subsequences in Multiple Data Streams

International Journal of Data Warehousing and Mining
Projection-based partial periodic pattern mining for event sequences

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.06

Visualization

Abstract

Online mining of closed frequent itemsets over streaming data is one of the most important issues in mining data streams. In this paper, we propose an efficient one-pass algorithm, NewMoment to maintain the set of closed frequent itemsets in data streams with a transaction-sensitive sliding window. An effective bit-sequence representation of items is used in the proposed algorithm to reduce the time and memory needed to slide the windows. Experiments show that the proposed algorithm not only attain highly accurate mining results, but also run significant faster and consume less memory than existing algorithm Moment for mining closed frequent itemsets over recent data streams.