Abstract
Generalized association rules are a very important extension of boolean association rules, but with current approaches mining generalized rules is computationally very expensive. Especially when considering the rule generation as being part of an interactive KDD-process this becomes annoying. In this paper we discuss strengths and weaknesses of known approaches to generate frequent itemsets. Based on the insights we derive a new algorithm, called Prutax, to mine generalized frequent itemsets. The basic ideas of the algorithm and further optimisation are described. Experiments with both synthetic and real-life data show that Prutax is an order of magnitude faster than previous approaches.
Chapter PDF
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, A. Swami: Mining Association Rules between Sets of Items in Large Databases, In Proc. of ACM SIGMOD ’93, 1993, Washington, USA.
R. Agrawal, R. Srikant, Fast Algorithms for Mining Association Rules, In Proc. of the VLDB ’94, 1994, Santiago, Chile.
J. Han, Y. Fu, Discovery of Multiple-Level Association Rules from Large Databases, In Proc. of the VLDB ’95, 1995, Zürich, Switzerland.
R. Srikant, R. Agrawal, Mining Generalized Association Rules, In Proc. of the VLDB ’95, 1995, Zürich, Switzerland.
A. Savasere, E. Omiecinski, S. Navathe, An Efficient Algorithm for Mining Association Rules in Large databases, In Proc. of the VLDB ’95, 1995, Zürich, Switzerland.
M. Holsheimer, M. Kersten, Heikki Mannila, Hannu Toivonen, A Perspective on Databases and Data Mining, In Proc. of the KDD ’95, 1995, Montreal, Canada.
M. J. Zaki, S. Parthasarathy, M. Ogihara, W. Li, New Algorithms for Fast Discovery of Association Rules, In Proc. of the KDD ’97, 1997, Newport Beach, California.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hipp, J., Myka, A., Wirth, R., Güntzer, U. (1998). A new algorithm for faster mining of generalized association rules. In: Żytkow, J.M., Quafafou, M. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 1998. Lecture Notes in Computer Science, vol 1510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0094807
Download citation
DOI: https://doi.org/10.1007/BFb0094807
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65068-3
Online ISBN: 978-3-540-49687-8
eBook Packages: Springer Book Archive