Automatic Clustering with Single Optimal Solution

02/08/2012
by   K. Karteeka Pavan, et al.
0

Determining optimal number of clusters in a dataset is a challenging task. Though some methods are available, there is no algorithm that produces unique clustering solution. The paper proposes an Automatic Merging for Single Optimal Solution (AMSOS) which aims to generate unique and nearly optimal clusters for the given datasets automatically. The AMSOS is iteratively merges the closest clusters automatically by validating with cluster validity measure to find single and nearly optimal clusters for the given data set. Experiments on both synthetic and real data have proved that the proposed algorithm finds single and nearly optimal clustering structure in terms of number of clusters, compactness and separation.

READ FULL TEXT
research
09/06/2011

An Automatic Clustering Technique for Optimal Clusters

This paper proposes a simple, automatic and efficient clustering algorit...
research
03/06/2021

The Automatic Quasi-clique Merger algorithm (AQCM)

The Automatic Quasi-clique Merger algorithm is a new algorithm adapted f...
research
09/07/2023

Medoid Silhouette clustering with automatic cluster number selection

The evaluation of clustering results is difficult, highly dependent on t...
research
08/30/2019

Optimal Legislative County Clustering in North Carolina

North Carolina's constitution requires that state legislative districts ...
research
01/16/2013

Model-Based Hierarchical Clustering

We present an approach to model-based hierarchical clustering by formula...
research
02/27/2017

Optimal Experiment Design for Causal Discovery from Fixed Number of Experiments

We study the problem of causal structure learning over a set of random v...
research
05/10/2013

Performance Enhancement of Distributed Quasi Steady-State Genetic Algorithm

This paper proposes a new scheme for performance enhancement of distribu...

Please sign up or login with your details

Forgot password? Click here to reset