Symmetry Based Automatic Evolution of Clusters: A New Approach to Data Clustering
We present a multiobjective genetic clustering approach, in which data points are assigned to clusters based on new line symmetry distance. The proposed algorithm is called multiobjective line symmetry based genetic clustering (MOLGC). Two objective functions, first the Davies-Bouldin (DB) index and...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | Computational Intelligence and Neuroscience |
Online Access: | http://dx.doi.org/10.1155/2015/796276 |
id |
doaj-7a57a5ee959246c4996a896862a4efb3 |
---|---|
record_format |
Article |
spelling |
doaj-7a57a5ee959246c4996a896862a4efb32020-11-24T21:05:58ZengHindawi LimitedComputational Intelligence and Neuroscience1687-52651687-52732015-01-01201510.1155/2015/796276796276Symmetry Based Automatic Evolution of Clusters: A New Approach to Data ClusteringSingh Vijendra0Sahoo Laxman1Department of Computer Science and Engineering, Faculty of Engineering and Technology, Mody University of Science and Technology, Lakshmangarh, Rajasthan 332311, IndiaSchool of Computer Engineering, KIIT University, Bhubaneswar 751024, IndiaWe present a multiobjective genetic clustering approach, in which data points are assigned to clusters based on new line symmetry distance. The proposed algorithm is called multiobjective line symmetry based genetic clustering (MOLGC). Two objective functions, first the Davies-Bouldin (DB) index and second the line symmetry distance based objective functions, are used. The proposed algorithm evolves near-optimal clustering solutions using multiple clustering criteria, without a priori knowledge of the actual number of clusters. The multiple randomized K dimensional (Kd) trees based nearest neighbor search is used to reduce the complexity of finding the closest symmetric points. Experimental results based on several artificial and real data sets show that proposed clustering algorithm can obtain optimal clustering solutions in terms of different cluster quality measures in comparison to existing SBKM and MOCK clustering algorithms.http://dx.doi.org/10.1155/2015/796276 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Singh Vijendra Sahoo Laxman |
spellingShingle |
Singh Vijendra Sahoo Laxman Symmetry Based Automatic Evolution of Clusters: A New Approach to Data Clustering Computational Intelligence and Neuroscience |
author_facet |
Singh Vijendra Sahoo Laxman |
author_sort |
Singh Vijendra |
title |
Symmetry Based Automatic Evolution of Clusters: A New Approach to Data Clustering |
title_short |
Symmetry Based Automatic Evolution of Clusters: A New Approach to Data Clustering |
title_full |
Symmetry Based Automatic Evolution of Clusters: A New Approach to Data Clustering |
title_fullStr |
Symmetry Based Automatic Evolution of Clusters: A New Approach to Data Clustering |
title_full_unstemmed |
Symmetry Based Automatic Evolution of Clusters: A New Approach to Data Clustering |
title_sort |
symmetry based automatic evolution of clusters: a new approach to data clustering |
publisher |
Hindawi Limited |
series |
Computational Intelligence and Neuroscience |
issn |
1687-5265 1687-5273 |
publishDate |
2015-01-01 |
description |
We present a multiobjective genetic clustering approach, in which data points are assigned to clusters based on new line symmetry distance. The proposed algorithm is called multiobjective line symmetry based genetic clustering (MOLGC). Two objective functions, first the Davies-Bouldin (DB) index and second the line symmetry distance based objective functions, are used. The proposed algorithm evolves near-optimal clustering solutions using multiple clustering criteria, without a priori knowledge of the actual number of clusters. The multiple randomized K dimensional (Kd) trees based nearest neighbor search is used to reduce the complexity of finding the closest symmetric points. Experimental results based on several artificial and real data sets show that proposed clustering algorithm can obtain optimal clustering solutions in terms of different cluster quality measures in comparison to existing SBKM and MOCK clustering algorithms. |
url |
http://dx.doi.org/10.1155/2015/796276 |
work_keys_str_mv |
AT singhvijendra symmetrybasedautomaticevolutionofclustersanewapproachtodataclustering AT sahoolaxman symmetrybasedautomaticevolutionofclustersanewapproachtodataclustering |
_version_ |
1716767254801022976 |