Abstract
One of the most important problems in data mining is discovery of association rules in large database. We had proposed parallel algorithms for mining generalized association rules with classification hierarchy. In this paper, we implemented the proposed algorithms on a large scale PC cluster which consists of one hundred PCs interconnected by an ATM switch, and analyzed the performance of our algorithms using a large amount of transaction dataset. Performance evaluations show our parallel algorithms are effective for handling skew for such large scale parallel systems.
Chapter PDF
References
R. Srikant, R. Agrawal: Mining generalized association rules. Proc. of VLDB (1995)
J. Han, Y. Fu: Discovery of multi-level association rules from large databases. Proc. of VLDB (1995)
T. Shintani, M. Kitsuregawa: Parallel algorithms for mining generalized association rules with classification hierarchy. Proc. of ACM SIGMOD (1998)
T. Tamura, M. Oguchi, M. kitsuregawa: Parallel database processing on a 100 node PC cluster: cases for decision support query processing and data mining. Proc. of SC97:High Performance Networking and Computing (1997)
E.-H. Han, G. Karypis, Vipin Kumar: Scalable parallel data mining for association rules. Proc. of ACM SIGMOD (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shintani, T., Oguchi, M., Kitsuregawa, M. (1999). Performance Analysis for Parallel Generalized Association Rule Mining on a Large Scale PC Cluster. In: Amestoy, P., et al. Euro-Par’99 Parallel Processing. Euro-Par 1999. Lecture Notes in Computer Science, vol 1685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48311-X_206
Download citation
DOI: https://doi.org/10.1007/3-540-48311-X_206
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66443-7
Online ISBN: 978-3-540-48311-3
eBook Packages: Springer Book Archive