Incremental association rule mining: a survey

Bhabesh Nath, Dhruba K. Bhattacharyya, Ashish Ghosh

Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · 2013 · 53 citations · 54 references

Concepts

TL;DR

Association rule mining is computationally expensive yet popular because of useful rules; many efficient algorithms exist, but adding new data can generate new or modify existing rules, making full re‑analysis wasteful and prompting incremental methods. The paper surveys state‑of‑the‑art incremental association rule mining algorithms and analyzes them to address the incremental mining problem. The authors review and analyze incremental association rule mining algorithms, focusing on non‑static datasets. © 2013 Wiley Periodicals, Inc., article categorized under Algorithmic Development > Association Rules Technologies > Classification.

Abstract

Abstract Association rule mining is a computationally expensive task. Despite the huge processing cost, it has gained tremendous popularity due to the usefulness of association rules. Several efficient algorithms can be found in the literature. This paper provides a comprehensive survey on the state‐of‐the‐art algorithms for association rule mining, specially when the data sets used for rule mining are not static. Addition of new data to a data set may lead to additional rules or to the modification of existing rules. Finding the association rules from the whole data set may lead to significant waste of time if the process has started from the scratch. Several algorithms have been evolved to attend this important issue of the association rule mining problem. This paper analyzes some of them to tackle the incremental association rule mining problem. © 2013 Wiley Periodicals, Inc. This article is categorized under: Algorithmic Development > Association Rules Technologies > Classification

References

54