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
关键词
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 条
  • [41] ExMiner: An efficient algorithm for mining top-k frequent patterns
    Quang, Tran Minh
    Oyanagi, Shigeru
    Yamazaki, Katsuhiro
    ADVANCED DATA MINING AND APPLICATIONS, PROCEEDINGS, 2006, 4093 : 436 - 447
  • [42] A Novel Efficient Mining Algorithm For Frequent Patterns On Biological Multiple Sequence
    Liu, Wei
    Chen, Ling
    FRONTIERS OF MANUFACTURING AND DESIGN SCIENCE, PTS 1-4, 2011, 44-47 : 3697 - +
  • [43] More Efficient Algorithm for Mining Frequent Patterns with Multiple Minimum Supports
    Gan, Wensheng
    Lin, Jerry Chun-Wei
    Fournier-Viger, Philippe
    Chao, Han-Chieh
    WEB-AGE INFORMATION MANAGEMENT, PT I, 2016, 9658 : 3 - 16
  • [44] 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
  • [45] An efficient incremental algorithm for frequent itemsets mining in distorted databases with granular computing
    Xu, Congfu
    Wang, Jinlong
    2006 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE, (WI 2006 MAIN CONFERENCE PROCEEDINGS), 2006, : 913 - +
  • [46] Efficient Strategies for Many-task Frequent Pattern Mining in Cloud Computing Environments
    Lin, Kawuu W.
    Luo, Yu-Chin
    2010 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2010), 2010,
  • [47] A novel parallel algorithm for frequent pattern mining with privacy preserved in cloud computing environments
    Lin, Kawuu W.
    Deng, Der-Jiunn
    INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING, 2010, 6 (04) : 205 - 215
  • [48] FRP: a fast resource placement algorithm in distributed cloud computing platform
    Wei, Wei
    Zhang, Yuhong
    Liu, Yang
    Qin, Zhiguang
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2016, 28 (05): : 1399 - 1416
  • [49] 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
  • [50] A time- and memory-efficient frequent itemset discovering algorithm for association rule mining
    Ivancsy, Renata
    Vajk, Istvan
    INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY, 2006, 27 (04) : 270 - 280