Paper Title:
A False Negative Maximal Frequent Itemsets Mining Algorithm over Stream
  Abstract

Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in frequent itemsets using less space, thus being more suitable for stream mining. This paper focuses on mining maximal frequent itemsets approximately over a stream landmark model. A false negative method is proposed based on Chernoff Bound to save the computing and memory cost. Our experimental results on a real world dataset show that our algorithm is effective and efficient.

  Info
Periodical
Chapter
Chapter 1: Transportation & Service Science
Edited by
Robin G. Qiu and Yongfeng Ju
Pages
21-25
DOI
10.4028/www.scientific.net/AMM.135-136.21
Citation
H. F. Li, N. Zhang, "A False Negative Maximal Frequent Itemsets Mining Algorithm over Stream", Applied Mechanics and Materials, Vols. 135-136, pp. 21-25, 2012
Online since
October 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Hui Wang
Chapter 5: Numerical Methods, Computation Methods and Algorithms for Modeling, Simulation and Optimization, Data Mining and Data Processing
Abstract:We present a new algorithm for mining maximal frequent itemsets, MaxMining, from big transaction databases. MaxMining employs the depth-first...
1765
Authors: Manoj Kumar, Hemant Kumar Soni
Abstract:Association rule mining is an iterative and interactive process of discovering valid, novel, useful, understandable and hidden associations...
120