IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/4676258.html
   My bibliography  Save this article

Bacterial Colony Algorithms for Association Rule Mining in Static and Stream Data

Author

Listed:
  • Danilo S. da Cunha
  • Rafael S. Xavier
  • Daniel G. Ferrari
  • Fabrício G. Vilasbôas
  • Leandro N. de Castro

Abstract

Bacterial colonies perform a cooperative and distributed exploration of the environmental resources by using their quorum-sensing mechanisms. This paper describes how bacterial colony networks and their skills to explore resources can be used as tools for mining association rules in static and stream data. A new algorithm is designed to maintain diverse solutions to the problems at hand, and its performance is compared to that of other well-known bacteria, genetic, and immune-inspired algorithms: Bacterial Foraging Optimization (BFO), a Genetic Algorithm (GA), and the Clonal Selection Algorithm (CLONALG). Taking into account the superior performance of our approach in static data, we applied the algorithms to dynamic environments by converting static into flow data via a stream data model named sliding-window. We also provide some notes on the running time of the proposed algorithm using different hardware and software architectures.

Suggested Citation

  • Danilo S. da Cunha & Rafael S. Xavier & Daniel G. Ferrari & Fabrício G. Vilasbôas & Leandro N. de Castro, 2018. "Bacterial Colony Algorithms for Association Rule Mining in Static and Stream Data," Mathematical Problems in Engineering, Hindawi, vol. 2018, pages 1-14, November.
    • Handle: RePEc:hin:jnlmpe:4676258
    DOI: 10.1155/2018/4676258
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2018/4676258.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2018/4676258.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2018/4676258?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:hin:jnlmpe:4676258. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.