Efficient top-\(k\) high utility itemset mining on massive data (Q2127081): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Frequent Pattern Mining / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient single-pass frequent pattern mining using a prefix-tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2766900 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Opportunistic mining of top-\(n\) high utility patterns / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Data mining in bioinformatics / rank | |||
Normal rank | |||
Latest revision as of 16:47, 28 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient top-\(k\) high utility itemset mining on massive data |
scientific article |
Statements
Efficient top-\(k\) high utility itemset mining on massive data (English)
0 references
19 April 2022
0 references
massive data
0 references
top-\(k\) high-utility itemsets
0 references
prefix-based partitioning
0 references
full suffix utility
0 references
