An Automatic Clustering Technique for Optimal Clusters

09/06/2011
by   K. Karteeka Pavan, et al.
0

This paper proposes a simple, automatic and efficient clustering algorithm, namely, Automatic Merging for Optimal Clusters (AMOC) which aims to generate nearly optimal clusters for the given datasets automatically. The AMOC is an extension to standard k-means with a two phase iterative procedure combining certain validation techniques in order to find optimal clusters with automation of merging of clusters. Experiments on both synthetic and real data have proved that the proposed algorithm finds nearly optimal clustering structures in terms of number of clusters, compactness and separation.

READ FULL TEXT
research
02/08/2012

Automatic Clustering with Single Optimal Solution

Determining optimal number of clusters in a dataset is a challenging tas...
research
02/14/2023

Multi-Prototypes Convex Merging Based K-Means Clustering Algorithm

K-Means algorithm is a popular clustering method. However, it has two li...
research
05/10/2013

Performance Enhancement of Distributed Quasi Steady-State Genetic Algorithm

This paper proposes a new scheme for performance enhancement of distribu...
research
09/12/2023

G-Mapper: Learning a Cover in the Mapper Construction

The Mapper algorithm is a visualization technique in topological data an...
research
10/15/2015

Sparsity-aware Possibilistic Clustering Algorithms

In this paper two novel possibilistic clustering algorithms are presente...
research
02/23/2021

CAC: A Clustering Based Framework for Classification

In data containing heterogeneous subpopulations, classification performa...
research
01/23/2020

Towards Automatic Clustering Analysis using Traces of Information Gain: The InfoGuide Method

Clustering analysis has become a ubiquitous information retrieval tool i...

Please sign up or login with your details

Forgot password? Click here to reset