SciELO - Scientific Electronic Library Online

 
vol.18 issue2Attribute and Case Selection for NN Classifier through Rough Sets and Naturally Inspired AlgorithmsUnsupervised Learning for Syntactic Disambiguation author indexsubject indexsearch form
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • Have no similar articlesSimilars in SciELO

Share


Computación y Sistemas

Print version ISSN 1405-5546

Abstract

ARELLANO-VERDEJO, Javier; GUZMAN-ARENAS, Adolfo; GODOY-CALDERON, Salvador  and  BARRON FERNANDEZ, Ricardo. Efficiently Finding the Optimum Number of Clusters in a Dataset with a New Hybrid Cellular Evolutionary Algorithm. Comp. y Sist. [online]. 2014, vol.18, n.2, pp.313-327. ISSN 1405-5546.  http://dx.doi.org/10.13053/CyS-18-2-2014-034.

A challenge in hybrid evolutionary algorithms is to employ efficient strategies to cover all the search space, applying local search only in actually promising search areas; on the other hand, clustering algorithms, a fundamental base for data mining procedures and learning techniques, suffer from the lack of efficient methods for determining the optimal number of clusters to be found in an arbitrary dataset. Some existing methods use evolutionary algorithms with cluster validation index as the objective function. In this article, a new cellular evolutionary algorithm based on a hybrid model of global and local heuristic search is proposed for the same task, and extensive experimentation is done with different datasets and indexes.

Keywords : Clustering; cellular genetic algorithm; micro-evolutionary algorithms; particle swarm optimization; optimal number of clusters.

        · abstract in Spanish     · text in English     · English ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License