.png){kind=icon}
.png){kind=icon}
Return
Efficient Skyline Frequent-Utility Itemset Mining Algorithm on Massive Data
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2024.3349454.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Frequent itemset mining (FIM) and high-utility itemset mining (HUIM) are two important branches of itemset mining which is a key technology of knowledge discovery in many applications. Nowadays, there have been extensive algorithms on FIM and HUIM, but few studies consider frequency and utility together, so skyline frequent-utility itemset mining (SFUIM) is proposed to find useful itemsets with both frequency and utility measurements. Nevertheless, SFUIM is more challenging than FIM and HUIM since the search space is large and the calculation cost is expensive without any threshold, especially on large-scale databases. To address it, this paper proposes a novel prefix-based algorithm PSI* to mine skyline frequent-utility itemsets on massive data. PSI* divides the huge database by prefix-based partitioning, so that the calculation of itemsets with a specific prefix-item only involves a partition instead of the database. A multilevel-index based list is presented to compactly maintain the maximal utility under the frequency constraint, and a novel grid-based structure is devised to organize partitions or items by a designed order. Moreover, four efficient pruning strategies are proposed to prune itemsets as early as possible. Substantial experiments show that the PSI* algorithm has better performance than the state-of-the-art algorithms, obviously on large-scale databases.
Keywords:
Itemsets
Databases
Partitioning algorithms
Data mining
Dairy products
Costs
Frequency measurement
Skyline frequent-utility itemset mining
massive data
prefix-based partitioning
grid storage
multilevel-index based list
Journal
IF:
10.4
Papers:
6.7K
Citations:
3.2W