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

An Algorithm for Mining of Association Rules for the Information Communication Network Alarms Based on Swarm Intelligence

Author

Listed:
  • Yang Wang
  • Guocai Li
  • Yakun Xu
  • Jie Hu

Abstract

Due to the centralized management of information communication network, the network operator have to face these pressures, which come from the increasing network alarms and maintenance efficiency. The effective analysis on mining of the network alarm association rules is achieved by incorporating classic data association mining algorithm and swarm intelligence optimization algorithm. From the related concept of the information communication network, the paper analyzes the data characteristics and association logic of the network alarms. Besides, the alarm data are preprocessed and the main standardization information fields are screened. The APPSO algorithm is proposed on the basis of combining the evaluation method for support and confidence coefficient in the Apriori (AP) algorithm as well as the particle swarm optimization (PSO) algorithm. By establishing a sparse linked list, the algorithm is able to calculate the particle support thus further improving the performance of the APPSO algorithm. Based on the test for the network alarm data, it is discovered that rational setting of the particle swarm scale and number of iterations of the APPSO algorithm can be used to mine the vast majority and even all of the association rules and the mining efficiency is significantly improved, compared with Apriori algorithm.

Suggested Citation

  • Yang Wang & Guocai Li & Yakun Xu & Jie Hu, 2014. "An Algorithm for Mining of Association Rules for the Information Communication Network Alarms Based on Swarm Intelligence," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-14, January.
  • Handle: RePEc:hin:jnlmpe:894205
    DOI: 10.1155/2014/894205
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2014/894205.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2014/894205.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/894205?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:894205. 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.