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

Tunnel Security Management Based on Association Rule Mining under Hadoop Platform

Author

Listed:
  • Qun Wang
  • Ting Xue
  • Zaoli Yang

Abstract

The problem of how to use large amounts of historical data for tunnel safety management has a greater practical application value. The association rule method in data mining technology can provide effective decision support for tunnel safety prevention by mining historical data. To address the problem of large data volume and sparse data items in tunnel safety management, an association rule method—Apriori algorithm—based on the Hadoop platform is proposed to improve the efficiency and accuracy of data mining in cloud environment. First, the parallel MapReduce implementation steps are analyzed on the basis of the distributed Hadoop framework. Then, the existing single-user data validation algorithm is improved by applying a multiuser parallel validation algorithm to Apriori in order to reduce the number of validations. Next, the traditional association rule Apriori algorithm is MapReduce optimized to generate a smaller set of useless candidate items. At the same time, Boolean ranking is used to optimize the way transactional data are stored in the database, reducing the number of redundant subsets and the number of times the database is connected, and shortening the task processing time. The experimental results show that the proposed method is able to mine the relationships between tunnel safety hazards and provide effective decision support for tunnel safety prevention. At the same time, the proposed method more efficiently operates than other association rule methods.

Suggested Citation

  • Qun Wang & Ting Xue & Zaoli Yang, 2022. "Tunnel Security Management Based on Association Rule Mining under Hadoop Platform," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-11, August.
  • Handle: RePEc:hin:jnlmpe:8508273
    DOI: 10.1155/2022/8508273
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/8508273.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/8508273.xml
    Download Restriction: no

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