A computationally efficient technique for data-clustering

Murty, Narasimha M and Krishna, G (1980) A computationally efficient technique for data-clustering. In: Pattern Recognition, 12 (3). pp. 153-158.

PDF fulltext.pdf - Published Version Restricted to Registered users only Download (381kB) | Request a copy

Abstract

A computationally efficient agglomerative clustering algorithm based on multilevel theory is presented. Here, the data set is divided randomly into a number of partitions. The samples of each such partition are clustered separately using hierarchical agglomerative clustering algorithm to form sub-clusters. These are merged at higher levels to get the final classification. This algorithm leads to the same classification as that of hierarchical agglomerative clustering algorithm when the clusters are well separated. The advantages of this algorithm are short run time and small storage requirement. It is observed that the savings, in storage space and computation time, increase nonlinearly with the sample size.

Item Type:	Journal Article
Publication:	Pattern Recognition
Publisher:	Elsevier Science
Additional Information:	Copyright of this article belongs to Elsevier Science.
Keywords:	Nonparametric;Agglomerative;Multilevel theory; Partitioning; Relabeling;Representative samples;Well separated clusters.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	23 Jul 2009 05:50
Last Modified:	19 Sep 2010 05:38
URI:	http://eprints.iisc.ac.in/id/eprint/21723

Actions (login required)

View Item