Mining frequent itemsets over distributed data streams by continuously maintaining a global synopsis

ISSN： 1384-5810

Source： Data Mining and Knowledge Discovery, Vol.23, Iss.2, 2011-09, pp. : 252-299

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A survey on algorithms for mining frequent itemsets over data streams

By Cheng James Ke Yiping Ng Wilfred

Knowledge and Information Systems, Vol. 16, Iss. 1, 2008-07 ,pp. : 1-27

Springer Publishing Company

Access to resources Recommend Favorite

Mining top-K frequent itemsets from data streams

By Wong Raymond Fu Ada

Data Mining and Knowledge Discovery, Vol. 13, Iss. 2, 2006-09 ,pp. : 193-217

Springer Publishing Company

Access to resources Recommend Favorite

Distributed Mining of Maximal Frequent Itemsets on a Data Grid System

By Luo Congnan Pereira Anil Chung Soon

The Journal of Supercomputing, Vol. 37, Iss. 1, 2006-07 ,pp. : 71-90

Springer Publishing Company

Access to resources Recommend Favorite

Catch the moment: maintaining closed frequent itemsets over a data stream sliding window

By Chi Yun Wang Haixun Yu Philip Muntz Richard

Knowledge and Information Systems, Vol. 10, Iss. 3, 2006-10 ,pp. : 265-294

Springer Publishing Company

Access to resources Recommend Favorite

Towards a new approach for mining frequent itemsets on data stream

By Raïssi Chedy Poncelet Pascal Teisseire Maguelonne

Journal of Intelligent Information Systems, Vol. 28, Iss. 1, 2007-02 ,pp. : 23-36

Springer Publishing Company

Access to resources Recommend Favorite