<fmt:message key='jsp.layout.header-default.alt'/>  

DSpace@UM >
Faculty of Computer Science and Information Technology >
Conference Proceedings >
International Conference on Informatics >
Informatics 2007 >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1812/343

Authors: Radhika M. Pai
Ananthanarayana V.S.
Keywords: Distributed algorithm
Data mining
Prefix-Suffix Trees
Issue Date: 2007
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.
Description: Proceeding of the 2nd International Conference on Informatics (Informatics 2007), 27th-28th November 2007, Hilton Petaling Jaya Hotel, Petaling Jaya, Selangor, Malaysia. T1-34 - T1-40
URI: http://dspace.fsktm.um.edu.my/handle/1812/343
ISBN: 978-983-43491-1-0
Appears in Collections:Informatics 2007

Files in This Item:

File Description SizeFormat
AIA.pdf3.42 MBAdobe PDFView/Open

This item is protected by original copyright

Your Tags:


  © Copyright 2008 DSpace Faculty of Computer Science and Information Technology, University of Malaya . All Rights Reserved.
DSpace@UM is powered by MIT - Hawlett-Packard. More information and software credits. Feedback