Experiments on Clustering Algorithms for Mixed and Incomplete Data
Yamilé Hernández Echemendía

Yamilé Hernández Echemendía*, Department of Computer Science, University “Máximo Gómez Báez”, Ciego de Ávila, Cuba.

Manuscript received on November 22, 2019. | Revised Manuscript received on December 15, 2019. | Manuscript published on December 30, 2019. | PP: 4778-4784 | Volume-9 Issue-2, December, 2019. | Retrieval Number: B2551129219/2019©BEIESP | DOI: 10.35940/ijeat.B2551.129219
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: Clustering mixed and incomplete data is a goal of frequent approaches in the last years because its common apparition in soft sciences problems. However, there is a lack of studies evaluating the performance of clustering algorithms for such kind of data. In this paper we present an experimental study about performance of seven clustering algorithms which used one of these techniques: partition, hierarchal or metaheuristic. All the methods ran over 15 databases from UCI Machine Learning Repository, having mixed and incomplete data descriptions. In external cluster validation using the indices Entropy and V-Measure, the algorithms that use the last technique showed the best results. Thus, we recommend metaheuristic based clustering algorithms for clustering data having mixed and incomplete descriptions.
Keywords: Cluster validation, data clustering, incomplete data, mixed data.