Issue No. 10 - Oct. (2011 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.32
Eray Özkural , Bilkent University, Ankara
Bora Uçar , LIP, ENS Lyon, Lyon
Cevdet Aykanat , Bilkent University, Ankara
We introduce a transaction database distribution scheme that divides the frequent item set mining task in a top-down fashion. Our method operates on a graph where vertices correspond to frequent items and edges correspond to frequent item sets of size two. We show that partitioning this graph by a vertex separator is sufficient to decide a distribution of the items such that the subdatabases determined by the item distribution can be mined independently. This distribution entails an amount of data replication, which may be reduced by setting appropriate weights to vertices. The data distribution scheme is used in the design of two new parallel frequent item set mining algorithms. Both algorithms replicate the items that correspond to the separator. NoClique replicates the work induced by the separator and NoClique2 computes the same work collectively. Computational load balancing and minimization of redundant or collective work may be achieved by assigning appropriate load estimates to vertices. The experiments show favorable speedups on a system with small-to-medium number of processors for synthetic and real-world databases.
Parallel data mining, frequent item set mining, mining methods and algorithms, selective data replication, graph partitioning by vertex separator.
C. Aykanat, E. Özkural and B. Uçar, "Parallel Frequent Item Set Mining with Selective Item Replication," in IEEE Transactions on Parallel & Distributed Systems, vol. 22, no. , pp. 1632-1640, 2011.