Mining top-k high utility patterns over data streams

DOI10.1016/J.INS.2014.01.045zbMATH Open1355.68237OpenAlexW1966426226MaRDI QIDQ508685FDOQ508685

Authors: Morteza Zihayat, Aijun An 

Publication date: 7 February 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.01.045

Recommendations

• Opportunistic mining of top-\(n\) high utility patterns
• Efficient top-\(k\) high utility itemset mining on massive data
• A high-speed heuristic algorithm for mining frequent patterns in data stream
• Memory-adaptive high utility sequential pattern mining over data streams

zbMATH Keywords

data streamsliding windowhigh utility pattern miningtop-\(k\) pattern mining

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Cited In (7)

• Narrow big data in a stream: computational limitations and regression
• Memory-adaptive high utility sequential pattern mining over data streams
• Efficient top-\(k\) high utility itemset mining on massive data
• Opportunistic mining of top-\(n\) high utility patterns
• Efficient approach of recent high utility stream pattern mining with indexed list structure and pruning strategy considering arrival times of transactions
• Summarization and visualization of multi-level and multi-dimensional itemsets
• Efficiently mining uncertain high-utility itemsets

Uses Software

• UCI-ml
• Minebench

This page was built for publication: Mining top-\(k\) high utility patterns over data streams

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