Efficient top-\(k\) high utility itemset mining on massive data

DOI10.1016/j.ins.2020.08.028zbMath1484.68211OpenAlexW3058140611MaRDI QIDQ2127081

Hong Gao, Jian-Zhong Li, Xixian Han, Xianmin Liu

Publication date: 19 April 2022

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

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

zbMATH Keywords

massive datafull suffix utilityprefix-based partitioningtop-\(k\) high-utility itemsets

Mathematics Subject Classification ID

Statistical aspects of big data and data science (62R07) Computational aspects of data analysis and big data (68T09)

Related Items (1)

An efficient approach for mining maximized erasable utility patterns

Uses Software

• SPMF

Cites Work

• Unnamed Item
• Data mining in bioinformatics
• Efficient single-pass frequent pattern mining using a prefix-tree
• Opportunistic mining of top-\(n\) high utility patterns
• Frequent Pattern Mining

This page was built for publication: Efficient top-\(k\) high utility itemset mining on massive data