%0 Generic
%A Landa-Torres, Itziar
%A Manjarres, Diana
%A Gil-López, Sergio
%A Del Ser, Javier
%A Sanz, Sancho Salcedo
%T A novel grouping harmony search algorithm for clustering problems
%J Advances in Intelligent Systems and Computing
%D 2017
%@ 2194-5357
%U https://hdl.handle.net/11556/2531
%X The problem of partitioning a data set into disjoint groups or clusters of related items plays a key role in data analytics, in particular when the information retrieval becomes crucial for further data analysis. In this context, clustering approaches aim at obtaining a good partition of the data based on multiple criteria. One of the most challenging aspects of clustering techniques is the inference of the optimal number of clusters. In this regard, a number of clustering methods from the literature assume that the number of clusters is known a priori and subsequently assign instances to clusters based on distance, density or any other criterion. This paper proposes to override any prior assumption on the number of clusters or groups in the data at hand by hybridizing the grouping encoding strategy and the Harmony Search (HS) algorithm. The resulting hybrid approach optimally infers the number of clusters by means of the tailored design of the HS operators, which estimates this important structural clustering parameter as an implicit byproduct of the instance-to-cluster mapping performed by the algorithm. Apart from inferring the optimal number of clusters, simulation results verify that the proposed scheme achieves a better performance than other naïve clustering techniques in synthetic scenarios and widely known data repositories.
%~