Partition-Based Parallel Constructing-Density-Tree Clustering

A parallel constructing-density-tree clustering algorithm based on data partitioning (PCAP) was presented. The PCAP automatically partitioned global data space into load-balanced subspaces, which were distributed to different processors to complete subspacespsila clustering. The clustering result of global data space was achieved by merging those strong-association clusters though checking the association-intensity of leavespsila similarity. The detailed method of computing the association-intensity between clusters was described. Finally, the relevancy of the speedup and the amount of processors were discussed. The experiment results on artificial and real datasets show PCAP realizes the parallel of constructing-density-tree clustering algorithm and improves the clustering speed efficiently under preserving enough clustering precision. This approach is more suitable for dealing with great amounts of datasets.