Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)

An Algorithm of Association Rule Mining Based on Memory Indexing

Authors
Yong Huang, Huamei Sun
Corresponding Author
Yong Huang
Available Online August 2012.
DOI
10.2991/iccasm.2012.69How to use a DOI?
Keywords
Data mining, association rules, memory indexing
Abstract

In the field of data mining, Apriori is a classical algorithm for mining association rules. In this paper, an improved Apriori algorithm is proposed, which is based on the principle of memory indexing. By recording unnecessary scanning transactions and storing relatively frequent transactions, the algorithm decreases the scanning times of the database, and consequently save the time of I/O operation. The experiments result has verified the effectiveness of the improved algorithm.

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 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)
Series
Advances in Intelligent Systems Research
Publication Date
August 2012
ISBN
978-94-91216-00-8
ISSN
1951-6851
DOI
10.2991/iccasm.2012.69How 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  - Yong Huang
AU  - Huamei Sun
PY  - 2012/08
DA  - 2012/08
TI  - An Algorithm of Association Rule Mining Based on Memory Indexing
BT  - Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)
PB  - Atlantis Press
SP  - 276
EP  - 279
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccasm.2012.69
DO  - 10.2991/iccasm.2012.69
ID  - Huang2012/08
ER  -