Research Area: Metaheuristic Computing
In the area of association rule mining, many optimization algorithms have been proposed to improve the computational efficiency of rule mining or the quality and diversity of association rules. However, in real applications, since the user may have prior knowledge and research trends for some key items, the association rules containing key items are more valuable and meaningful for these users. This contributes to a new issue that association rules related to key items should be mined in a targeted manner. To solve this issue, this paper proposes a novel animal dynamic migration optimization (ADMO) method to realize directional rule mining as well as maintain high mining efficiency and high rule quality. Taking the support and confidence of frequent itemsets as input, the method first identifies valuable rules and then initializes and updates the animal population to search for the best animal. The support and confidence of the best animal are defined as threshold values to delete unnecessary rules and discover more key rules. During the optimization, the population size value is dynamically generated. The effectiveness and applicability of ADMO are validated on 11 open-source datasets and a real-world elevator case. The results reveal that the ADMO method has a faster mining speed and obtains more key rules than the ARM-PSO, ARM-AMO, ARM-MOPSO, ARM-WOA, and ARM-DE methods. In the elevator case, the association rule generated by ADMO can provide a higher success rate and accuracy for requirement transformation.
Keywords:
association rule mining
optimization algorithms
dynamic migration
mining efficiency
high rule quality
accuracy
Author(s) Name: Kerui Hu, Lemiao Qiu, Shuyou Zhang, Zili Wang, Naiyu Fang
Journal name: Expert Systems with Applications
Conferrence name:
Publisher name: Elsevier
DOI: 10.1016/j.eswa.2022.118617
Volume Information: Volume 211
