An Automatic Clustering Technique for Optimal Clusters
K. Pavan. International Journal of Computer Science, Engineering and Applications (IJCSEA), 01 (04):
133-144(August 2011)
DOI: 10.5121/ijcsea.2011.1412
Abstract
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.
%0 Journal Article
%1 noauthororeditor
%A Pavan, K. Karteeka
%D 2011
%J International Journal of Computer Science, Engineering and Applications (IJCSEA)
%K algorithms networks
%N 04
%P 133-144
%R 10.5121/ijcsea.2011.1412
%T An Automatic Clustering Technique for Optimal Clusters
%U http://airccse.org/journal/ijcsea/papers/0811ijcsea12.pdf
%V 01
%X 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.
@article{noauthororeditor,
abstract = {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. },
added-at = {2018-05-09T13:12:01.000+0200},
author = {Pavan, K. Karteeka},
biburl = {https://www.bibsonomy.org/bibtex/2282a06a3ced8d82efda4633bfcc8009e/ijcsea},
doi = {10.5121/ijcsea.2011.1412},
interhash = {75c67a3423b7865c33aecb8ab9f64692},
intrahash = {282a06a3ced8d82efda4633bfcc8009e},
issn = {2230-9616},
journal = {International Journal of Computer Science, Engineering and Applications (IJCSEA)},
keywords = {algorithms networks},
month = {August},
number = 04,
pages = {133-144},
timestamp = {2018-05-09T13:12:01.000+0200},
title = {An Automatic Clustering Technique for Optimal Clusters},
url = {http://airccse.org/journal/ijcsea/papers/0811ijcsea12.pdf},
volume = 01,
year = 2011
}