Abstract
There have been proposed efficient ways of enumerating all the association rules that are interesting with respect to support, confidence, or other measures. In contrast, we examine the optimization problem of computing the optimal association rule that maximizes the significance of the correlation between the assumption and the conclusion of the rule. We propose a parallel branch-and-bound graph search algorithm tailored to this problem. The key features of the design are (1) novel branch-and-bound heuristics, and (2) a rule of rewriting conjunctions that avoids maintaining the list of visited nodes. Experiments on two different types of large-scale shared-memory multi-processors confirm that the speed-up of the computation time scales almost linearly with the number of processors, and the size of search space could be dramatically reduced by the branch-and-bound heuristics.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of ACM SIGMOD, pages 207–216, May 1993.
R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proceedings of VLDB Conference, pages 487–499, 1994.
G. Y. Ananth, V. Kumar, and P. Pardalos. Parallel processing of discrete optimization problems. 1993.
D. Avis and K. Fukuda. A basis enumeration algorithm for linear systems with geometric applications. Applied Mathematics Letters, 5:39–42, 1991.
S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules tocorrelations. In Proceedings of ACM SIGMOD, pages 265–276. SIGMOD Record 26(2), June 1997.
V. Kumar, A. Grama, and G. Karypis. Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjamin Cummings, Nov. 1993.
S. Morishita. On classification and regression. In Proceedings of Discovery Science, DS’98, Lecture Notes in Artificial Intelligence, volume 1532, pages 40–57, Dec. 1998.
R. T. Ng, L. V. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained association rules. In Proceedings of ACM SIGMOD, pages 13–24, June 1998.
J. S. Park, M.-S. Chen, and P. S. Yu. An effective hash-based algorithm for mining association rules. In Proceedings of ACM SIGMOD, pages 175–186, May 1995.
R. J. Bayardo Jr. Efficiently Mining Long Patterns from Databases. In Proceedings of ACM SIGMOD, pages 85–93, June 1998.
R. J. Bayardo Jr., R. Agrawal, D. Gunopulos. Constraint-Based Rule Mining in Large, Dense Databases. In Proceedings of ICDE, pages 188–197, March 1999.
R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In Proceedings of ACM SIGMOD, June 1996.
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
Morishita, S., Nakaya, A. (2000). Parallel Branch-and-Bound Graph Search for Correlated Association Rules. In: Zaki, M.J., Ho, CT. (eds) Large-Scale Parallel Data Mining. Lecture Notes in Computer Science(), vol 1759. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46502-2_6
Download citation
DOI: https://doi.org/10.1007/3-540-46502-2_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67194-7
Online ISBN: 978-3-540-46502-7
eBook Packages: Springer Book Archive