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

DOI10.1007/S10618-010-0204-8zbMATH Open1235.68202OpenAlexW2091806949MaRDI QIDQ408650FDOQ408650

Authors: En Tzu Wang, Arbee L. P. Chen 

Publication date: 11 April 2012

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-010-0204-8

Recommendations

• Approximate mining of global closed frequent itemsets over data streams
• Study on discovering frequent items algorithm for distributed data stream
• Mining recent frequent itemsets in sliding windows over data streams
• scientific article; zbMATH DE number 2204015
• P2P-FISM: mining (recently) frequent item sets from distributed data streams over P2P network

zbMATH Keywords

data miningcontinuous distributed modeldistributed data streamsfrequent itemsethash-based approach

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• An improved data stream summary: the count-min sketch and its applications
• Title not available (Why is that?)
• Database Theory - ICDT 2005

Cited In (3)

• Adaptive fuzzy partitions for evolving association rules in big data stream
• A MapReduce-based parallel frequent pattern growth algorithm for spatiotemporal association analysis of mobile trajectory big data
• Study on discovering frequent items algorithm for distributed data stream

This page was built for publication: Mining frequent itemsets over distributed data streams by continuously maintaining a global synopsis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408650)