Abstract
The discovery of association rules has been known to be useful in selective marketing, decision analysis, and business management. An important application area of mining association rules is the market basket analysis, which studies the buying behaviors of customers by searching for sets of items that are frequently purchased together. With the increasing use of the record-based databases whose data is being continuously added, recent important applications have called for the need of incremental mining. In dynamic transaction databases, new transactions are appended and obsolete transactions are discarded as time advances. Several research works have developed feasible algorithms for deriving precise association rules efficiently and effectively in such dynamic databases. On the other hand, approaches to generate approximations from data streams have received a significant amount of research attention recently. In each scheme, previously proposed algorithms are explored with examples to illustrate their concepts and techniques in this chapter.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Rights and permissions
About this chapter
Cite this chapter
Teng, WG., Chen, MS. Incremental Mining on Association Rules. In: Chu, W., Young Lin, T. (eds) Foundations and Advances in Data Mining. Studies in Fuzziness and Soft Computing, vol 180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11362197_6
Download citation
DOI: https://doi.org/10.1007/11362197_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25057-9
Online ISBN: 978-3-540-32393-8
eBook Packages: EngineeringEngineering (R0)