A harmony search algorithm for clustering with feature selection
Fuente:
Redalyc
Saved in:
| Main Author: | |
|---|---|
| Format: | Artículo científico |
| Published: |
Universidad de Antioquia
2010
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1876467446226878464 |
|---|---|
| author | Carlos Cobos |
| author_facet | Carlos Cobos |
| contents | A harmony search algorithm for clustering with feature selection Carlos Cobos Elizabeth León Martha Mendoza Ingeniería clustering Harmony search feature selection 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. 2010 artículo científico 0120-6230 https://www.redalyc.org/articulo.oa?id=43019328016 http://www.redalyc.org/revista.oa?id=430 Revista Facultad de Ingeniería Universidad de Antioquia application/pdf Universidad de Antioquia Revista Facultad de Ingeniería Universidad de Antioquia (Colombia) Num.55 |
| format | Artículo científico |
| id | redalyc_43019328016 |
| institution | Redalyc |
| language | |
| publishDate | 2010 |
| publisher | Universidad de Antioquia |
| spellingShingle | A harmony search algorithm for clustering with feature selection Carlos Cobos Ingeniería clustering Harmony search feature selection A harmony search algorithm for clustering with feature selection Carlos Cobos Elizabeth León Martha Mendoza Ingeniería clustering Harmony search feature selection 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. 2010 artículo científico 0120-6230 https://www.redalyc.org/articulo.oa?id=43019328016 http://www.redalyc.org/revista.oa?id=430 Revista Facultad de Ingeniería Universidad de Antioquia application/pdf Universidad de Antioquia Revista Facultad de Ingeniería Universidad de Antioquia (Colombia) Num.55 |
| title | A harmony search algorithm for clustering with feature selection |
| topic | Ingeniería clustering Harmony search feature selection |
| url | https://www.redalyc.org/articulo.oa?id=43019328016 |