Name
Abstract | ||
|---|---|---|
•Current top-k HUIM algorithms only concern small and moderate transaction database.•A novel PTM algorithm is presented to mine top-k HUIs on massive data efficiently.•Prefix-based partitioning is devised to obtain prefix-based partitions.•Set enumeration tree in depth-first growing mode is presented to process partitions.•Subtree pruning rule is devised to reduce exploration space of set enumeration tree. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.ins.2020.08.028 | Information Sciences |
Keywords | DocType | Volume |
Massive data,Top-k high utility itemsets,Prefix-based partitioning,Full suffix utility | Journal | 557 |
ISSN | Citations | PageRank |
0020-0255 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xixian Han | 1 | 78 | 10.45 |
| Xianmin Liu | 2 | 12 | 5.00 |
| Jianzhong Li | 3 | 3196 | 304.46 |
| Hong Gao | 4 | 1086 | 120.07 |