Top-K-FCI: Mining Top-K Frequent Closed Itemsets in Data Streams

Provided by: Binary Information Press
Topic: Data Management
Format: PDF
With the generation and analysis of stream data, such as network monitoring in real time, log records and click streams, a great deal of attention has been concerned on data streams mining in the field of data mining. In the process of the data streams mining, it is more reasonable to ask users to set a bound on the result size. Therefore, in this paper, a real-time single-pass algorithm, called top-K FCI (top-K Frequent Closed Item sets of data streams), is proposed for mining top-K closed item sets from data streams efficiently.

Find By Topic