A fast and resource efficient mining algorithm for discovering frequent patterns in distributed computing environments

被引:16
|
作者
Lin, Kawuu W. [1 ]
Chung, Sheng-Hao [1 ]
机构
[1] Natl Kaohsiung Univ Appl Sci, Dept Comp Sci & Informat Engn, Kaohsiung 807, Taiwan
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2015年 / 52卷
关键词
Data mining; Frequent pattern mining; Distributed mining; Parallel mining; DATABASES;
D O I
10.1016/j.future.2015.05.009
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The advancement of electronic technology enables us to collect logs from various devices. Such logs require detailed analysis in order to be broadly useful. Data mining is a technique that has been widely used to extract hidden information from such data. Data mining is mainly composed of association rules mining, sequent pattern mining, classification and clustering. Association rules mining has attracted significant attention and been successfully applied to various fields. Although the past studies can effectively discover frequent patterns to deduce association rules, execution efficiency is still a critical problem. To speed up execution, many methods using parallel and distributed computing technology have been proposed in recent years. Most of the past studies focused on parallelizing the workload in a high end machine or in distributed computing environments like grid or cloud computing systems; however, very few of them discuss how to efficiently determine the appropriate number of computing nodes, considering execution efficiency and load balancing. An intuition is that execution speed is proportional to the number of computing nodes that is, more the number of computing nodes, faster is the execution speed. However, this is incorrect for such algorithms because of the inherently algorithmic design. Allocating too many computing nodes can lead to high execution time. In addition to the execution inefficiency, inappropriate resource allocation is a waste of computing power and network bandwidth. At the same time, load cannot be effectively distributed if there are too few nodes allocated. In this paper, we propose a fast, load balancing and resource efficient algorithm named FLR-Mining for discovering frequent patterns in distributed computing systems. FLR-Mining is capable of determining the appropriate number of computing nodes automatically and achieving better load balancing as compared with existing methods. Through empirical evaluation, FLR-Mining is shown to deliver excellent performance in terms of execution efficiency and load balancing. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:49 / 58
页数:10
相关论文
共 50 条
  • [21] An efficient mining algorithm for maximal frequent patterns in uncertain graph database
    Li, Feng
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2020, 39 (05) : 7021 - 7033
  • [22] SPaMi-FTS: An Efficient Algorithm for Mining Frequent Sequential Patterns
    Kadir Febrer-Hernandez, Jose
    Hernandez-Palancar, Jose
    Hernandez-Leon, Raudel
    Feregrino-Uribe, Claudia
    PROGRESS IN PATTERN RECOGNITION IMAGE ANALYSIS, COMPUTER VISION, AND APPLICATIONS, CIARP 2014, 2014, 8827 : 470 - 477
  • [23] A Fast Frequent Subgraph Mining Algorithm
    Wu, Jia
    Chen, Ling
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE FOR YOUNG COMPUTER SCIENTISTS, VOLS 1-5, 2008, : 82 - 87
  • [24] An efficient mining algorithm for maximal weighted frequent patterns in transactional databases
    Yun, Unil
    Shin, Hyeonil
    Ryu, Keun Ho
    Yoon, EunChul
    KNOWLEDGE-BASED SYSTEMS, 2012, 33 : 53 - 64
  • [25] Fast Discovering Frequent Patterns for Incremental XML Queries
    PENG Dun-lu 1
    2.Department of Computer Science and Engineering
    Wuhan University Journal of Natural Sciences, 2004, (05) : 638 - 646
  • [26] An efficient algorithm for mining maximal frequent patterns over data streams
    Yang, Junrui
    Wei, Yanjun
    Zhou, Fenfen
    2015 7TH INTERNATIONAL CONFERENCE ON INTELLIGENT HUMAN-MACHINE SYSTEMS AND CYBERNETICS IHMSC 2015, VOL II, 2015,
  • [27] An Efficient Approach for Mining Frequent Patterns over Uncertain Data Streams
    Shajib, Md. Badi-Uz-Zaman
    Samiullah, Md.
    Ahmed, Chowdhury Farhan
    Leung, Carson K.
    Pazdor, Adam G. M.
    2016 IEEE 28TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2016), 2016, : 980 - 984
  • [28] Frequent pattern mining algorithms in fog computing environments: A systematic review
    Tehrani, Ahmad Fadaei
    Sharifi, Mahdi
    Rahmani, Amir Masoud
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2022, 34 (24)
  • [29] A NOVEL ALGORITHM FOR FAST MINING FREQUENT PATTERNS BASED ON SUPPORT LIST STRUCTURE
    Zhu, Xiaolin
    JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2022, 23 (09) : 1943 - 1966
  • [30] Efficient frequent subgraph mining algorithm
    Li, Xian-Tong
    Li, Jian-Zhong
    Gao, Hong
    Ruan Jian Xue Bao/Journal of Software, 2007, 18 (10): : 2469 - 2480