An efficient divisive-agglomerative hierarchical clustering algorithm using minimum spanning tree

Many systems in Science and Engineering can be modeled as graph. Clustering is a process of discovering group of objects such that the objects of the same group are similar, and objects belonging to different groups are dissimilar. A number of clustering algorithms exist that can solve the problem o...

Full description

Saved in:
Bibliographic Details
Published in:Journal of discrete mathematical sciences & cryptography Vol. 14; no. 6; pp. 583 - 595
Main Authors: Peter, S. John, Chidambaranathan, S.
Format: Journal Article
Language:English
Published: Taylor & Francis Group 01.12.2011
Subjects:
Algorithms
Boundaries
Clustering
Clusters
Cryptography
edge structure
Euclidean minimum spanning tree
Graph theory
Graphs
Mathematical models
subtree
ISSN:0972-0529, 2169-0065
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Many systems in Science and Engineering can be modeled as graph. Clustering is a process of discovering group of objects such that the objects of the same group are similar, and objects belonging to different groups are dissimilar. A number of clustering algorithms exist that can solve the problem of clustering, but most of them are very sensitive to their input parameters. Graph based clustering algorithms aimed to find hidden structures from objects. Minimum Spanning Tree clustering algorithm is capable of detecting clusters with irregular boundaries. In this paper we present a new clustering algorithm using Minimum Spanning Tree. The newly proposed algorithm can find hierarchical structure of clusters without requiring any input parameters. The experiment using synthetic data demonstrates the performance of new algorithm.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0972-0529
2169-0065
DOI:10.1080/09720529.2011.10698357