Data Association Rules Mining Method Based on Improved Apriori Algorithm

Wu, Haotong

doi:10.1145/3445945.3445948

Cited by 5 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another study [39] utilized GA to enhance the Apriori algorithm for ARM, which improves the efficiency and accuracy of the algorithm and has resulted in better outcomings. Table 3 summarizes and compares existing EA approaches.…”

Section: ) Evolutionary Algorithms (Eas)mentioning

confidence: 99%

Preserving Privacy in Association Rule Mining Using Metaheuristic-Based Algorithms: A Systematic Literature Review

Aljehani,

Alotaibi

2024

IEEE Access

View full text Add to dashboard Cite

The current state of Association Rule Mining (ARM) technology is heading towards a critical yet profitable direction. The ARM process uncovers numerous association rules, determining correlations between itemsets, forming building blocks that have led to revolutionary scientific discoveries. However, a high level of privacy is vital for protecting sensitive rules, raising privacy concerns. Researchers recently highlighted challenges in the Privacy-Preserving Association Rule Mining (PPARM) field. Many studies have proposed workaround for the PPARM dilemma by using metaheuristics. This paper conducts a systematic literature review on metaheuristic-based algorithms addressing PPARM challenges. It explores existing studies, providing insights into diverse metaheuristic approaches tackling PPARM problems. A detailed taxonomy is presented, providing a structured classification of metaheuristic-based algorithms specific to PPARM. This classification facilitates a nuanced understanding of the field by categorizing these algorithms into metaphor-based and non-metaphor-based groups with discussion of the nature of the representation schemes for each category identified in the survey. This review extends its analysis to encompass the latest applied approaches, highlighting the diversification of existing metaheuristic algorithms in the PPARM context. Moreover, common datasets and evaluation metrics identified from selected studies are documented to provide a deeper understanding of the methodological choices made by researchers in this domain. Finally, a discussion of existing challenges and potential future directions are presented. This review serves as a helpful guide that outlines previous research and presents potential future opportunities of metaheuristic-based algorithms in the context of PPARM.

show abstract

Section: ) Evolutionary Algorithms (Eas)mentioning

confidence: 99%

Preserving Privacy in Association Rule Mining Using Metaheuristic-Based Algorithms: A Systematic Literature Review

Aljehani,

Alotaibi

2024

IEEE Access

View full text Add to dashboard Cite

show abstract

“…the overall complexity of the frequent pattern tree. Wu et al [20] proposed enhancing the Apriori algorithm to address its inefficiency in mining association rules from large databases. They introduced a genetic algorithm-based improvement, outlining the basic principles of association rules and the Apriori algorithm.…”

mentioning

confidence: 99%

Reptile Search Algorithm for Association Rule Mining

Boukhalat,

Heraguemi,

Benouis

et al. 2024

IJCDS

View full text Add to dashboard Cite

Association rule mining (ARM) is a very popular, engaging, and active research area in data mining. It seeks to find valuable connections between different attributes in a defined dataset. ARM, which describes it as an NP-complete problem, creates a fertile field for optimization applications. The Reptile Search Algorithm (RSA) is an innovative evolutionary algorithm. It yanks stimulation from the encircling and hunting conducts of crocodiles. It is a well-known optimization technique for solving NP-complete issues. Since its introduction by Abualigah et al. in 2022, the approach has attracted considerable attention from researchers and has extensively been used to address diverse optimization issues in several disciplines. This is due to its satisfactory execution speed, efficient convergence rate, and superior effectiveness compared to other widely recognized optimization methods. This paper suggests a new version of the reptile search algorithm for resolving the association rules mining challenge. Our proposal inherits the trade-off between local and global search optimization issues demonstrated by the Reptile search algorithm. To illustrate the power of our proposal, a sequence of experiments is taken out on a varied, well-known, employing multiple comparison criteria. The results show an evident dominance of the proposed approach in the front of the famous association rules mining algorithms as well as Bees Swarm Optimization (BSO), Bat Algorithm (BA), Whale Optimization Algorithm (WOA), and others regarding CPU time, fitness criteria, and the quality of generated rules.

show abstract