Mining Maximal Frequent Itemsets in Data Streams Based on FP Tree 1st Edition by Fujiang Ao, Yuejin Yan, Jian Huang, Kedi Huang 9783540734987

Mining Maximal Frequent Itemsets in Data Streams Based on FP Tree 1st Edition by Fujiang Ao, Yuejin Yan, Jian Huang, Kedi Huang – Ebook PDF Instant Download/Delivery. 9783540734987

Full download Mining Maximal Frequent Itemsets in Data Streams Based on FP Tree 1st Edition after payment

Product details:

ISBN 13: 9783540734987

Author: Fujiang Ao, Yuejin Yan, Jian Huang; Kedi Huang

Mining maximal frequent itemsets in data streams is more difficult than mining them in static databases for the huge, high-speed and continuous characteristics of data streams. In this paper, we propose a novel one-pass algorithm called FpMFI-DS, which mines all maximal frequent itemsets in Landmark windows or Sliding windows in data streams based on FP-Tree. A new structure of FP-Tree is designed for storing all transactions in Landmark windows or Sliding windows in data streams. To improve the efficiency of the algorithm, a new pruning technique, extension support equivalency pruning (ESEquivPS), is imported to it. The experiments show that our algorithm is efficient and scalable. It is suitable for mining MFIs both in static database and in data streams.

Mining Maximal Frequent Itemsets in Data Streams Based on FP Tree 1st Table of contents:

1. Introduction
2. Problem Statement

3. Related Work

4. Spark for Big Data Processing

5. Proposed Approach for Static Mining Maximal Frequent Patterns

6. Incremental Mining Maximal Frequent Patterns from Dynamic Data Streams

7. Experiment Results

8. Conclusion and Outlook

People also search for Mining Maximal Frequent Itemsets in Data Streams Based on FP Tree 1st: 

frequent item mining

java frequent itemset mining

 frequent item-set mining

what is frequent item set in data mining