SciELO - Scientific Electronic Library Online

 
 issue55Architecture and performance of optical packet switching router architecture for future Internet networksDetection and correction of inconsistencies of cyclical references in database logical schemas author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • On index processCited by Google
  • Have no similar articlesSimilars in SciELO
  • On index processSimilars in Google

Share


Revista Facultad de Ingeniería Universidad de Antioquia

Print version ISSN 0120-6230On-line version ISSN 2422-2844

Abstract

COBOS, Carlos; LEON, Elizabeth  and  MENDOZA, Martha. A harmony search algorithm for clustering with feature selection. Rev.fac.ing.univ. Antioquia [online]. 2010, n.55, pp.153-164. ISSN 0120-6230.

This paper presents a new clustering algorithm, called IHSK, with feature selection in a linear order of complexity. The algorithm is based on the combination of the harmony search and K-means algorithms. Feature selection uses both the concept of variability and a heuristic method that penalizes the presence of dimensions with a low probability of contributing to the current solution. The algorithm was tested with sets of synthetic and real data, obtaining promising results.

Keywords : harmony search; clustering; feature selection.

        · 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