IDEAS home Printed from https://ideas.repec.org/a/igg/jsir00/v12y2021i3p58-77.html
   My bibliography  Save this article

Cockroach Swarm Optimization Algorithm for High Utility Association Rule Mining

Author

Listed:
  • Sivamathi Abarajithan

    (Bharathiar University, India)

  • S. Vijayarani Mohan

    (Bharathiar University, India)

Abstract

Association rule mining is an important and widely used data mining technique. It is used to retrieve highly related objects in a database based on the occurrence. Recently, utility-based association rules were proposed to consider significant factors of the object. The main objective of this research work is to retrieve high utility association rules from a database using cockroach swarm optimization algorithm. So far, in the literature, no optimization algorithm was proposed in utility-based association rule mining. In this research work, CSOUAR (cockroach swarm optimization for high utility association rule mining) algorithm was proposed to generate utility association rules. CSOUAR algorithm is based on three behaviours of cockroach: chase-swarming, dispersing, and ruthless. To analyse the performance of CSOUAR, an improved particle swarm optimization (PSO-UAR), animal migration optimization (AMO-UAR), bees swarm optimisation (BSO-UAR), and penguins search optimisation (peSO-UAR) are also proposed in this work.

Suggested Citation

  • Sivamathi Abarajithan & S. Vijayarani Mohan, 2021. "Cockroach Swarm Optimization Algorithm for High Utility Association Rule Mining," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 12(3), pages 58-77, July.
    • Handle: RePEc:igg:jsir00:v:12:y:2021:i:3:p:58-77
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.2021070103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jsir00:v:12:y:2021:i:3:p:58-77. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.