Linear assignment clustering algorithm based on the least similar cluster representatives

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

1 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)3552-3557
Journal / PublicationProceedings of the IEEE International Conference on Systems, Man and Cybernetics
Volume4
Publication statusPublished - 1997
Externally publishedYes

Conference

TitleProceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5)
CityOrlando, FL, USA
Period12 - 15 October 1997

Abstract

This paper presents a linear assignment algorithm for solving the classical NP-complete clustering problem. By use of the most dissimilar data as cluster representatives, a linear assignment algorithm is developed based on a linear assignment model for clustering multivariate data. The computational results evaluated using multiple performance criteria show that the clustering algorithm is very effective and efficient, especially for clustering a large number of data with many attributes.