DMCA
Efficient Mining of Association Rules in Distributed Databases (1996)
| Citations: | 94 - 3 self |
BibTeX
@MISC{Cheung96efficientmining,
author = {David W. Cheung and Vincent T. Ng and Ada W. Fu and Yongjian Fu},
title = {Efficient Mining of Association Rules in Distributed Databases},
year = {1996}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Many sequential algorithms have been proposed for mining of association rules. However, very little work has been done in mining association rules in distributed databases. A direct application of sequential algorithms to distributed databases is not effective, because it requires a large amount of communication overhead. In this study, an efficient algorithm, DMA, is proposed. It generates a small number of candidate sets and requires only O(n) messages for support count exchange for each candidate set, where n is the number of sites in a distributed database. The algorithm has been implemented on an experimental test bed and its performance is studied. The results show that DMA has superior performance when comparing with the direct application of a popular sequential algorithm in distributed databases.
Keyphrases
distributed database association rule efficient mining direct application many sequential algorithm communication overhead efficient algorithm popular sequential algorithm little work candidate set support count exchange sequential algorithm large amount small number experimental test bed
