• DocumentCode
    3179285
  • Title

    Efficient strategies for many-task frequent pattern mining in cloud computing environments

  • Author

    Lin, Kawuu W. ; Luo, Yu-Chin

  • Author_Institution
    Dept. of Comput. Sci. & Inf. Eng., Nat. Kaohsiung Univ. of Appl. Sci., Kaohsiung, Taiwan
  • fYear
    2010
  • fDate
    10-13 Oct. 2010
  • Firstpage
    620
  • Lastpage
    623
  • Abstract
    The goal of data mining is to discover the hidden useful information from large databases. Mining frequent patterns from transaction databases is an important problem in data mining field. As the size of database increases, the computation time and the required memory increase severely. Parallel and distributed computing techniques have attracted extensive attentions on the ability to manage and compute the significant amount of data in the past decades. The difficulty of mining large database launched the research of designing parallel and distributed algorithms to solve the problem. However, most of the past studies did not focus on the many-task issue that is very important, especially in cloud computing environments. In cloud computing environments, application is provided as service like Google search engine, meaning that it will be used by many users at the same time. In this paper, we propose a set of strategies for many-task frequent pattern mining. Through empirical evaluations on various simulation conditions, the proposed strategies deliver excellent performance in terms of execution time.
  • Keywords
    Internet; data mining; parallel processing; search engines; Google search engine; cloud computing; data mining; distributed computing; frequent pattern mining; parallel computing; Computers; Heating; Data mining; association rule mining; cloud computing; frequent pattern mining;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systems Man and Cybernetics (SMC), 2010 IEEE International Conference on
  • Conference_Location
    Istanbul
  • ISSN
    1062-922X
  • Print_ISBN
    978-1-4244-6586-6
  • Type

    conf

  • DOI
    10.1109/ICSMC.2010.5641816
  • Filename
    5641816