A High Utility Itemset Mining Algorithm Based on Particle Filter

  • Yang Y
  • Ding J
  • Wang H
  • et al.
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Yang, Y., Ding, J., Wang, H., Xing, H., & Li, E. (2023). A High Utility Itemset Mining Algorithm Based on Particle Filter. Mathematical Problems in Engineering, 2023(1). https://doi.org/10.1155/2023/7941673

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free