A new 3-Clustering algorithm for minimum sum of diameter using bit representation

Cluster analysis is concerned with the problem of partitioning a given set of entities into homogeneous and well-separated subsets called clusters. 3-Clustering problem is one of the most famous strongly NP-complete combinatorial problems in computer science [1]. Most of the existing 3-Clustering algorithms are heuristics in nature. In this paper we propose a technique which gives Minimum Sum of Diameters clustering for three clusters and proposed algorithm is not heuristic in nature. A new technique, “Bit Representation” is used for the representation of clusters. Our experiment indicates that our method requires less time.