Mining frequent closed patterns over data stream

DOI10.3724/SP.J.1087.2008.01467MaRDI QIDQ3406855zbMATH OpenFDO

Authors Wen-Liang Rong, Yan Yang

Publication date 20 February 2010

Published in Journal of Computer Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/SP.J.1087.2008.01467

zbMATH Keywords

data streamsliding windowassociation rulefrequent closed patterns

Mathematics Subject Classification ID

Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Mining frequent closed itemsets from a landmark window over online data streams
• Mining recent frequent itemsets in sliding windows over data streams
• An efficient closed frequent itemset miner for the MOA stream mining system
• Algorithm of frequent-patterns mining in data stream
• Approximate mining of global closed frequent itemsets over data streams

Cited in

(11)

• A high-speed heuristic algorithm for mining frequent patterns in data stream
• Approximate mining of global closed frequent itemsets over data streams
• Mining closed patterns in relational, graph and network data
• RFIMiner: A regression-based algorithm for recently frequent patterns in multiple time granularity data streams
• Fast mining frequent patterns in semi-structured data stream
• Cherry: an algorithm for mining frequent closed itemsets without subset checking
• Mining recent frequent itemsets in sliding windows over data streams
• Algorithm of frequent-patterns mining in data stream
• An incremental algorithm for mining frequent closed patterns
• An efficient closed frequent itemset miner for the MOA stream mining system
• Mining frequent closed itemsets from a landmark window over online data streams

This page was built for publication: Mining frequent closed patterns over data stream

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