2004•Journal of information science and engineeringRequires access

A Sliding Window Method for Finding Recently Frequent Itemsets over Online Data Streams

Joong Hyuk Chang, Won Suk Lee

Abstract

A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is likely to be changed as time goes by. However, most of miming algorithms or frequency approximation algorithms for a data stream do not able to extract the recent change of information in a data stream adaptively. This paper proposes a sliding window method of finding recently frequent itemsets over an online data stream. The size of a window defines a desired life-time of the information of a transaction in a data stream.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 138 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Sliding window protocol, Computer science, Data stream, Data stream mining, Window (computing), Database transaction, Data mining, Data stream clustering