IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i5p1195-d1083809.html
   My bibliography  Save this article

Association Rule Mining through Combining Hybrid Water Wave Optimization Algorithm with Levy Flight

Author

Listed:
  • Qiyi He

    (School of Computer Science, Hubei University of Technology, Wuhan 430068, China)

  • Jin Tu

    (School of Computer Science, Hubei University of Technology, Wuhan 430068, China)

  • Zhiwei Ye

    (School of Computer Science, Hubei University of Technology, Wuhan 430068, China)

  • Mingwei Wang

    (School of Computer Science, Hubei University of Technology, Wuhan 430068, China)

  • Ye Cao

    (School of Computer Science, Hubei University of Technology, Wuhan 430068, China)

  • Xianjing Zhou

    (Wuhan Zhuoer Information Technology Co., Ltd., Wuhan 430312, China)

  • Wanfang Bai

    (Xining Data Services Authority, Xining 810007, China)

Abstract

Association rule mining (ARM) is one of the most important tasks in data mining. In recent years, swarm intelligence algorithms have been effectively applied to ARM, and the main challenge has been to achieve a balance between search efficiency and the quality of the mined rules. As a novel swarm intelligence algorithm, the water wave optimization (WWO) algorithm has been widely used for combinatorial optimization problems, with the disadvantage that it tends to fall into local optimum solutions and converges slowly. In this paper, a novel hybrid ARM method based on WWO with Levy flight (LWWO) is proposed. The proposed method improves the solution of WWO by expanding the search space through Levy flight while effectively increasing the search speed. In addition, this paper employs the hybrid strategy to enhance the diversity of the population in order to obtain the global optimal solution. Moreover, the proposed ARM method does not generate frequent items, unlike traditional algorithms (e.g., Apriori), thus reducing the computational overhead and saving memory space, which increases its applicability in real-world business cases. Experiment results show that the performance of the proposed hybrid algorithms is significantly better than that of the WWO and LWWO in terms of quality and number of mined rules.

Suggested Citation

  • Qiyi He & Jin Tu & Zhiwei Ye & Mingwei Wang & Ye Cao & Xianjing Zhou & Wanfang Bai, 2023. "Association Rule Mining through Combining Hybrid Water Wave Optimization Algorithm with Levy Flight," Mathematics, MDPI, vol. 11(5), pages 1-19, February.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:5:p:1195-:d:1083809
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/5/1195/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/5/1195/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yan, Zheping & Zhang, Jinzhong & Tang, Jialing, 2021. "Path planning for autonomous underwater vehicle based on an enhanced water wave optimization algorithm," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 181(C), pages 192-241.
    2. Clarisse Dhaenens & Laetitia Jourdan, 2022. "Metaheuristics for data mining: survey and opportunities for big data," Annals of Operations Research, Springer, vol. 314(1), pages 117-140, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Brennan McCann & Morad Nazari & Christopher Petersen, 2024. "Numerical Approaches for Constrained and Unconstrained, Static Optimization on the Special Euclidean Group SE(3)," Journal of Optimization Theory and Applications, Springer, vol. 201(3), pages 1116-1150, June.
    2. Yan, Zheping & Yan, Jinyu & Wu, Yifan & Cai, Sijia & Wang, Hongxing, 2023. "A novel reinforcement learning based tuna swarm optimization algorithm for autonomous underwater vehicle path planning," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 209(C), pages 55-86.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:5:p:1195-:d:1083809. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.