Study of Incremental Updating Algorithm for Association Rules

DOI

10.2991/iccasm.2012.292How to use a DOI?

Keywords

Data mining, Association rules, Incremental updating

Abstract

Discover frequent itemsets is the key problem of mining association rules, and the expenditure of this process is high. So, the research of incremental updating algorithms is particular important. This paper presents a comprehensive study on the performance of incremental updating algorithms that currently available, such as IUA [1] which makes full use of frequent itemsets already got. Based on the shortcomings of IUA, presents a new algorithm AIUA as an improved algorithm of IUA.

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)

TY  - CONF
AU  - Hongmei An
AU  - Ping Chen
AU  - Lijing Huang
PY  - 2012/08
DA  - 2012/08
TI  - Study of Incremental Updating Algorithm for Association Rules
BT  - Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)
PB  - Atlantis Press
SP  - 1147
EP  - 1150
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccasm.2012.292
DO  - 10.2991/iccasm.2012.292
ID  - An2012/08
ER  -