DISTRIBUTED ALGORITHM FOR CLUSTERING LARGE DATASETS

M. Pai , Radhika and V.S., Ananthanarayana (2007) DISTRIBUTED ALGORITHM FOR CLUSTERING LARGE DATASETS. In: 2nd International Conference on Informatics (Informatics 2007), Hilton Petaling Jaya Hotel, Petaling Jaya, Selangor, Malaysia.

[img] PDF
AIA.pdf

Download (3MB)
Official URL: http://dspace.fsktm.um.edu.my/handle/1812/343

Abstract

In this paper , we propose a novel scheme called Prefix-Suffix trees which is a compact and complete representation of the database that requires only a single database scan for its construction. We propose a clustering algorithm based on this scheme and a parallel implementation of the algorithm based on the message passing model. The proposed algorithm exploits the inherent parallelism in the algorithm. The algorithm is implemented on a cluster computer with 3 nodes running LINUX. We compare the execution times experimentally and show that the parallel algorithm is efficient than its sequential counterpart.

Item Type: Conference or Workshop Item (Paper)
Subjects: Z Bibliography. Library Science. Information Resources > Z665 Library Science. Information Science
Divisions: Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science
Depositing User: MS SITI NUR ATIKAH MOHAMAD RUSDI
Date Deposited: 16 Jul 2013 02:30
Last Modified: 16 Jul 2013 02:30
URI: http://repository.um.edu.my/id/eprint/429

Actions (login required)

View Item View Item