Proceedings of the 2nd International Conference on Electronic & Mechanical Engineering and Information Technology (EMEIT 2012)

Fast Mining Algorithm of Association Rules Base on Cloud Computing

Authors
Bo He
Corresponding Author
Bo He
Available Online September 2012.
DOI
10.2991/emeit.2012.489How to use a DOI?
Keywords
Association rules, Frequent itemsets, FP-tree, FP-growth
Abstract

There were some problems in traditional mining algorithm of association rules: a lot of candidate itemsets and communication traffic. Aiming at these problems, this paper proposed a fast mining algorithm of association rules based on cloud computing, namely, FMAAR algorithm. Firstly, the frequent items were found. Secondly, the FP-tree was created and the frequent itemsets were mined by FP-growth algorithm. Finally, the association rules were got by cloud computing. The experimental results suggest that FMAAR algorithm is fast and effective.

Copyright
© 2012, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

Volume Title
Proceedings of the 2nd International Conference on Electronic & Mechanical Engineering and Information Technology (EMEIT 2012)
Series
Advances in Intelligent Systems Research
Publication Date
September 2012
ISBN
978-90-78677-60-4
ISSN
1951-6851
DOI
10.2991/emeit.2012.489How to use a DOI?
Copyright
© 2012, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

TY  - CONF
AU  - Bo He
PY  - 2012/09
DA  - 2012/09
TI  - Fast Mining Algorithm of Association Rules Base on Cloud Computing
BT  - Proceedings of the 2nd International Conference on Electronic & Mechanical Engineering and Information Technology (EMEIT 2012)
PB  - Atlantis Press
SP  - 2209
EP  - 2212
SN  - 1951-6851
UR  - https://doi.org/10.2991/emeit.2012.489
DO  - 10.2991/emeit.2012.489
ID  - He2012/09
ER  -