An Algorithm to Construct FP-Tree on VODCA

Author

Yongmu, Tong ; Xiaoyan, Zheng

Author_Institution

Tianjin Univ. of Technol. & Educ., Tianjin, China

Volume

1

fYear

2010

fDate

11-12 May 2010

Firstpage

485

Lastpage

488

Abstract

To construct FP-Tree in mining frequent pattern, we propose a parallel algorithm CFPV (Construct FP-Tree on VODCA) for construct FP-Tree. This method is based on a new parallel computing environment on the distributed shared memory, called View-Oriented, Distributed, Cluster-based Approach to parallel computing (VODCA). It discusses the fact of views division and the results when generate FP-Tree on VODCA, and discusses the dynamic task allocation strategy of the algorithm. The experimental results prove the correctness and effectiveness of CFPV algorithm.

Keywords

data mining; distributed shared memory systems; parallel algorithms; parallel programming; pattern clustering; trees (mathematics); CFPV; FP-tree construction; VODCA; distributed shared memory; dynamic task allocation strategy; frequent pattern mining; parallel algorithm; parallel computing; view oriented distributed cluster based approach; Automation; Clustering algorithms; Concurrent computing; Data mining; Educational technology; Message passing; Parallel algorithms; Parallel processing; Parallel programming; Programming profession; FP-Tree; VODCA; shared-memory; task allocation;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Computation Technology and Automation (ICICTA), 2010 International Conference on

Conference_Location

Changsha

Print_ISBN

978-1-4244-7279-6

Electronic_ISBN

978-1-4244-7280-2

Type

conf

DOI

10.1109/ICICTA.2010.280

Filename

5522689