Abstract
Since the introduction of association rules, many algorithms have been developed to perform the computationally very intensive task of association rule mining. During recent years there has been the tendency in research to concentrate on developing algorithms for specialized tasks, e.g. for mining optimized rules or incrementally updating rule sets. Here we return to the “classic” problem, namely the efficient generation of all association rules that exist in a given set of transactions with respect to minimum support and minimum confidence. From our point of view, the performance problem concerning this task is still not adequately solved. In this paper we address two topics: First of all, today there is no satisfying comparison of the common algorithms. Therefore we identify the fundamental strategies of association rule mining and present a general framework that is independent of any particular approach and its implementation. Based on this we carefully analyze the algorithms. We explain differences and similarities in performance behavior and complete our theoretic insights by runtime experiments. Second, the results are quite surprising and enable us to derive a new algorithm. This approach avoids the identified pitfalls and at the same time profits from the strengths of known approaches. It turns out that it achieves remarkably better runtimes than the previous algorithms.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of the ACM SIGMOD ’93, USA, May 1993.
R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of the 20th Int’l Conf. on Very Large Databases (VLDB ’94), Chile, June 1994.
R. J. Bayardo Jr., R. Agrawal, and D. Gunopulos. Constraint-based rule mining in large, dense databases. In Proc. of the 15th Int’l Conf. on Data Engineering, Sydney, Australia, March 1999.
S. Brin, R. Motwani, J. D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. In Proc. of the ACM SIGMOD ’97, 1997
J. Hipp, A. Myka, R. Wirth, and U. Güntzer. A new algorithm for faster mining of generalized association rules. In Proc. of the 2nd European Symp. on Principles of Data Mining and Knowledge Discovery (PKDD ’98), France, Sept. 1998.
M. Holsheimer, M. Kersten, H. Mannila, and H. Toivonen. A perspective on databases and data mining. In Proc. of the 1st Int’l Conf. on Knowlegde Discovery and Data Mining (KDD ’95), Montreal, Canada, August 1995.
A. Savasere, E. Omiecinski, and S. Navathe. An effcient algorithm for mining association rules in large databases. In Proc. of the 21st Conf. on Very Large Databases (VLDB ’95), Switzerland, September 1995.
R. Srikant and R. Agrawal. Mining generalized association rules. In Proc. of the 21st Conf. on Very Large Databases (VLDB ’95), Switzerland, September 1995.
M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In Proc. of the 3rd Int’l Conf. on KDD and Data Mining (KDD ’97), Newport Beach, California, August 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hipp, J., Güntzer, U., Nakhaeizadeh, G. (2000). Mining Association Rules: Deriving a Superior Algorithm by Analyzing Today’s Approaches. In: Zighed, D.A., Komorowski, J., Żytkow, J. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 2000. Lecture Notes in Computer Science(), vol 1910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45372-5_16
Download citation
DOI: https://doi.org/10.1007/3-540-45372-5_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41066-9
Online ISBN: 978-3-540-45372-7
eBook Packages: Springer Book Archive