Abstract
Most of the approaches for association rule mining focus on the performance of the discovery of the frequent itemsets. They are based on the algorithms that require the transformation of data from one representation to another, and therefore excessively use resources and incur heavy CPU overhead. This chapter proposes a hybrid algorithm that is resource efficient and provides better performance. It characterizes the trade-offs among data representation, computation, I/O, and heuristics. The proposed algorithm uses an array-based item storage for the candidate and frequent itemsets. In addition, we propose a comparison algorithm (CmpApr) that compares candidate itemsets with a transaction, a filtering algorithm (FilterApr) that reduces the number of comparison operations required to find frequent itemsets. The hybrid algorithm (ARM++) integrates filtering methods within the Partition algorithm
Access provided by Autonomous University of Puebla. Download to read the full chapter text
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 (1993): Mining Association Rules between Sets of Items in Large Databases. Proc. SIGMOD International Conference on Management of Data, Washington, DC, pp. 207–216.
R. Agrawal and R. Srikant (1994): Fast Algorithms for Mining Association Rules. Proc. Very Large Database International Conference, Santiago, pp. 487–498.
R. Agrawal and J.C. Shafer (1996): Parallel Mining of Association Rules: Design, Implementation and Experience. Research Report RJ10004, IBM Almaden Research Center, San Jose.
D. W. Cheung, V. T. Ng, A. W. Fu, and Y. Fu (1996): Efficient Mining of Association Rules in Distributed Databases. IEEE Trans. Knowledge Data Eng. 8(6), 911–921.
M. Houtsma, and Arun Swami (1995): Set-Oriented Mining for Association Rules in Relational Databases. IEEE Int. Conf. on Data Engineering pp. 25–33.
J.S. Park, M-S Chen, and P. S. Yu (1995): An Effective Hash-Based Algorithm for Mining Association Rules. Proc. SIGMOD Int. Conf. Management of Data, pp. 175–186.
A. Savasere, E. Omiecinski, and S. Navathe (1995): An Efficient Algorithm for Mining Association Rules in Large Databases. Proc. Very Large Database Int. Conf., Zurich, pp. 432–444.
R. Srikant and R. Agrawal (1996): Mining Quantitative Association Rules in Large Relational Tables. Proc. SIGMOD Int. Con. on Management of Data, Montreal, pp. 1–12.
http://www.almaden.ibm.com/cs/quest/syndata.html
R. Srikant and R. Agrawal: Mining Quantitative Association Rules in Large Relational Tables. SIGMOD 96, Montreal, pp. 1–12.
D. Hand, H. Mannila, and P. Smyth (2001): Principles of Data Mining. MIT Press, Cambridge, MA.
J. Han and M. Kamber (2001): Data Mining—Concepts and Techniques. Academic Press, New York.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Tari, Z., Wu, W. (2006). Arm++: A Hybrid Association Rule Mining Algorithm. In: Zomaya, A.Y. (eds) Handbook of Nature-Inspired and Innovative Computing. Springer, Boston, MA. https://doi.org/10.1007/0-387-27705-6_2
Download citation
DOI: https://doi.org/10.1007/0-387-27705-6_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-40532-2
Online ISBN: 978-0-387-27705-9
eBook Packages: Computer ScienceComputer Science (R0)