A high-speed heuristic algorithm for mining frequent patterns in data stream

MaRDI QIDQ3365677zbMATH OpenFDO

Authors Xin Zhang, Xiaoguang Li, Daling Wang, Ge Yu

Publication date 23 January 2006

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• Algorithm of frequent-patterns mining in data stream
• Mining frequent closed patterns over data stream
• Fast mining frequent patterns in semi-structured data stream
• An efficient algorithm for mining approximate frequent item over data streams
• MAX-FISM: mining (recently) maximal frequent itemsets over data streams using the sliding window model

Cited in

(4)

• Fast mining frequent patterns in semi-structured data stream
• Algorithm of frequent-patterns mining in data stream
• Mining top-\(k\) high utility patterns over data streams
• Mining frequent closed itemsets from a landmark window over online data streams

This page was built for publication: A high-speed heuristic algorithm for mining frequent patterns in data stream

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