A Fast Parallel Algorithm for Discovering Frequent Patterns

被引:7
作者
Lin, Kawuu W. [1 ]
Luo, Yu-Chin [1 ]
机构
[1] Natl Kaohsiung Univ Appl Sci, Dept Comp Sci & Informat Engn, Kaohsiung 807, Taiwan
来源
2009 IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING ( GRC 2009) | 2009年
关键词
Data mining; cloud computing; association rule mining; frequent pattern mining; privacy preserved;
D O I
10.1109/GRC.2009.5255089
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Fast discovery of frequent patterns is the most extensively discussed problem in data mining fields due to its wide applications. As the size of database increases, the computation time and the required memory increase severely. The difficulty of mining large database launched the research of designing parallel and distributed algorithms to solve the problem. Most of the past studies tried to parallelize the computation by dividing the database and distribute the divided database to other nodes for mining. This approach might leak data out and evidently is not suitable to be applied to sensitive domains like health-care. In this paper, we propose a novel data mining algorithm named FD-Mine that is able to efficiently utilize the nodes to discover frequent patterns in cloud computing environments with data privacy preserved. Through empirical evaluations on various simulation conditions, the proposed FD-Mine delivers excellent performance in terms of scalability and execution time.
引用
收藏
页码:398 / 403
页数:6
相关论文
共 50 条
[41]   A fast algorithm for mining frequent ordered subtrees [J].
Hido, Shohei ;
Kawano, Hiroyuki .
Systems and Computers in Japan, 2007, 38 (07) :34-43
[42]   Pincer-search: An efficient algorithm for discovering the maximum frequent set [J].
Lin, DI ;
Kedem, ZM .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2002, 14 (03) :553-566
[43]   Discovering Interesting Rules from Biological Data Using Parallel Genetic Algorithm [J].
Dash, Satya Ranjan ;
Dehuri, Satchidananda ;
Rayaguru, Susil .
PROCEEDINGS OF THE 2013 3RD IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE (IACC), 2013, :631-636
[44]   An Improved Algorithm for Mining Maximal Frequent Patterns [J].
Hu, Yan ;
Han, Ruixue .
FIRST IITA INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2009, :746-749
[45]   An incremental algorithm for mining frequent closed patterns [J].
Shi, Huai-Dong ;
Cai, Ming ;
Wu, Hong-Sen ;
Dong, Jin-Xiang ;
Fu, Hao .
Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science), 2009, 43 (08) :1389-1395
[46]   A High Performance Algorithm for Mining Frequent Patterns: LPS-Miner [J].
Chen, Xiaoyun ;
Liu, Huiling ;
Chen, Pengfei ;
Li, Longjie .
ISISE 2008: INTERNATIONAL SYMPOSIUM ON INFORMATION SCIENCE AND ENGINEERING, VOL 2, 2008, :7-11
[47]   Discovering Maximal Periodic-Frequent Patterns in Very Large Temporal Databases [J].
Kiran, R. Uday ;
Watanobe, Yutaka ;
Chaudhury, Bhaskar ;
Zettsu, Koji ;
Toyoda, Masashi ;
Kitsuregawa, Masaru .
2020 IEEE 7TH INTERNATIONAL CONFERENCE ON DATA SCIENCE AND ADVANCED ANALYTICS (DSAA 2020), 2020, :11-20
[48]   Discovering Closed Periodic-Frequent Patterns in Very Large Temporal Databases [J].
Likhitha, P. ;
Ravikumar, P. ;
Kiran, R. Uday ;
Hayamizu, Yuto ;
Goda, Kazuo ;
Toyoda, Masashi ;
Zettsu, Koji ;
Shrivastava, Sourabh .
2020 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2020, :4700-4709
[49]   Fast Distributed Mining Algorithm of Maximum Frequent Itemsets Based on Cloud Computing [J].
He, Bo .
INFORMATION COMPUTING AND APPLICATIONS, ICICA 2013, PT I, 2013, 391 :407-416
[50]   Fast Distributed Algorithm of Mining Global Frequent Itemsets [J].
He, Bo .
ADVANCED RESEARCH ON INFORMATION SCIENCE, AUTOMATION AND MATERIAL SYSTEM, PTS 1-6, 2011, 219-220 :191-194