Abstract

High utility itemset mining is an interesting research in the field of data mining, which can find more valuable information than frequent itemset mining. Several high-utility itemset mining approaches have already been proposed; however, they have high computational costs and low efficiency. To solve this problem, a high-utility itemset mining algorithm based on the particle filter is proposed. This approach first initializes a population, which consists of particle sets. Then, to update the particle sets and their weights, a novel state transition model is suggested. Finally, the approach alleviates the particle degradation problem by resampling. Substantial experiments on the UCI datasets show that the proposed algorithm outperforms the other previous algorithms in terms of efficiency, the number of high-utility itemsets, and convergence.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call