A False Negative Maximal Frequent Itemsets Mining Algorithm over Stream

Abstract:

Article Preview

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:

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 and 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:

$35.00

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

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