Abstract
In this paper, we first focus our attention on the question of how much space remains for performance improvement over current association rule mining algorithms. Our strategy is to compare their performance against an “Oracle algorithm” that knows in advance the identities of all frequent itemsets in the database and only needs to gather their actual supports to complete the mining process. Our experimental results show that current mining algorithms do not perform uniformly well with respect to the Oracle for all database characteristics and support thresholds. In many cases there is a substantial gap between the Oracle’s performance and that of the current mining algorithms. Second, we present a new mining algorithm, called ARMOR, that is constructed by making minimal changes to the Oracle algorithm. ARMOR consistently performs within a factor of two of the Oracle on both real and synthetic datasets over practical ranges of support specifications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of Intl. Conf. on Very Large Databases (VLDB), September 1994.
C. Hidber. Online association rule mining. In Proc. of ACM SIGMOD Intl. Conf. on Management of Data, June 1999.
J. Lin and M. H. Dunham. Mining association rules: Anti-skew algorithms. In Intl. Conf. on Data Engineering (ICDE), 1998.
V. Pudi and J. Haritsa. Quantifying the utility of the past in mining large databases. Information Systems, July 2000.
V. Pudi and J. Haritsa. On the optimality of association-rule mining algorithms. Technical Report TR-2001-01, DSL, Indian Institute of Science, 2001.
A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. of Intl. Conf. on Very Large Databases (VLDB), 1995.
P. Shenoy, J. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa, and D. Shah. Turbo-charging vertical mining of large databases. In Proc. of ACM SIGMOD Intl. Conf. on Management of Data, May 2000.
R. Srikant and R. Agrawal. Mining generalized association rules. In Proc. of Intl. Conf. on Very Large Databases (VLDB), September 1995.
Y. Xiao and M. H. Dunham. Considering main memory in mining association rules. In Intl. Conf. on Data Warehousing and Knowledge Discovery (DAWAK), 1999.
M. J. Zaki and K. Gouda. Fast vertical mining using diffsets. Technical Report 01-1, Rensselaer Polytechnic Institute, 2001.
Z. Zheng, R. Kohavi, and L. Mason. Real world performance of association rule algorithms. In Intl. Conf. on Knowledge Discovery and Data Mining (SIGKDD), August 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pudi, V., Haritsa, J.R. (2002). On the Efficiency of Association-Rule Mining Algorithms. In: Chen, MS., Yu, P.S., Liu, B. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2002. Lecture Notes in Computer Science(), vol 2336. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47887-6_8
Download citation
DOI: https://doi.org/10.1007/3-540-47887-6_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43704-8
Online ISBN: 978-3-540-47887-4
eBook Packages: Springer Book Archive