Proceedings of the 2013 the International Conference on Education Technology and Information System (ICETIS 2013)

<Previous Article In Volume
Next Article In Volume>

An Improved Apriori Algorithm on the Frequent Itemse

Authors
Xiang Fang
Corresponding Author
Xiang Fang
Available Online June 2013.
DOI
10.2991/icetis-13.2013.193How to use a DOI?
Keywords
Association Rule; Apriori Algorithm; Frequent Itemse
Abstract

According to the problem that the traditional Apriori algorithm needs to scan database frequently, an improved strategy and corresponding algorithm is put forward in this paper. This method, only when L1-candidates are produced, scans the transaction database D. The rest frequent itemsets are produced through the scan of preceding result in place of the transaction database. The improved algorithm reduces I/O load and has higher efficiency.

Copyright
© 2013, 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)

<Previous Article In Volume
Next Article In Volume>
Volume Title
Proceedings of the 2013 the International Conference on Education Technology and Information System (ICETIS 2013)
Series
Advances in Intelligent Systems Research
Publication Date
June 2013
ISBN
978-90-78677-76-5
ISSN
1951-6851
DOI
10.2991/icetis-13.2013.193How to use a DOI?
Copyright
© 2013, 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

risenwbib
TY  - CONF
AU  - Xiang Fang
PY  - 2013/06
DA  - 2013/06
TI  - An Improved Apriori Algorithm on the Frequent Itemse
BT  - Proceedings of the 2013 the International Conference on Education Technology and Information System (ICETIS 2013)
PB  - Atlantis Press
SP  - 850
EP  - 853
SN  - 1951-6851
UR  - https://doi.org/10.2991/icetis-13.2013.193
DO  - 10.2991/icetis-13.2013.193
ID  - Fang2013/06
ER  -