Abstract
In this paper, we study the issues of mining and maintaining association rules in a large database of customer transactions. The problem of mining association rules can be mapped into the problems of finding large itemsets which are sets of items bought together in a sufficient number of transactions. We revise a graph-based algorithm to further speed up the process of itemset generation. In addition, we extend our revised algorithm to maintain discovered association rules when incremental or decremental updates are made to the databases. Experimental results show the efficiency of our algorithms. The revised algorithm significantly improves over the original one on mining association rules. The algorithms for maintaining association rules are more efficient than re-running the mining algorithms for the whole updated database and outperform previously proposed algorithms that need multiple passes over the database.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Reference
R. Agrawal, T. Imielinski, and A. Swami Mining Association Rules between Sets of Items in Large Databases. In Proc. of ACM SIGMOD, pages 207–216, 1993.
R. Agrawal and R. Srikant. Fast Algorithm for Mining Association Rules. In Proc. of the International Conference on Very Large Data Bases, pages 487–499, 1994.
D.W. Cheung, J. Han, V.T. Ng, and C.Y. Wong. Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In Proc. of the International Conference on Data Engineering, pages 106–114, 1996.
D.W. Cheung, S.D. Lee, and Benjamin Kao. A General Incremental Technique for Maintaining Discovered Association Rules. In Proc. of International Conference on Database Systems for Advanced Applications, April 1–4, pages 185–194, 1997.
E. Simoudis, J. Han and U. Fayyad. Proc. of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD96), 1996.
R. Srikant and R. Agrawal. Mining Sequential Patterns: Generalizations and Performance Improvements. In Proc. of the Fifth International Conference on Extending Database Technology (EDBT), Avignon, France, March 1996.
J.T.-L. Wang, G.-W. Chirn, T.G. Marr, B. Shapiro, D. Shasha, and K. Zhang, Combinatorial Pattern Discovery for Scientific Data: Some Preliminary Results. In Proc. of ACM SIGMOD, pages 115–125, 1994.
S.J. Yen and A.L.P. Chen. An Efficient Algorithm for Deriving Compact Rules from Databases. In Proc. of International Conference on Database Systems for Advanced Applications, pages 364–371, 1995.
S.J. Yen and A.L.P. Chen. The Analysis of Relationships in Databases for Rule Derivation. In Journal of Intelligent Information Systems, Vol.7, pages 1–24, 1996.
S.J. Yen and A.L.P. Chen. An Efficient Approach to Discovering Knowledge from Large Databases, In Proc. of the IEEE/ACM International Conference on Parallel and Distributed Information Systems, pages 8–18, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, K.L., Lee, G., Chen, A.L.P. (1999). Efficient Graph-Based Algorithm for Discovering and Maintaining Knowledge in Large Databases. In: Zhong, N., Zhou, L. (eds) Methodologies for Knowledge Discovery and Data Mining. PAKDD 1999. Lecture Notes in Computer Science(), vol 1574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48912-6_55
Download citation
DOI: https://doi.org/10.1007/3-540-48912-6_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65866-5
Online ISBN: 978-3-540-48912-2
eBook Packages: Springer Book Archive