Performance analysis for parallel generalized association rule mining on a large scale PC cluster

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag Berlin Heidelberg 1999.

Cite

CITATION STYLE

APA

Shintani, T., Oguchi, M., & Kitsuregawa, M. (1999). Performance analysis for parallel generalized association rule mining on a large scale PC cluster. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1685 LNCS, pp. 1455–1459). Springer Verlag. https://doi.org/10.1007/3-540-48311-x_206

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free