Buscar
Mostrando ítems 1-10 de 612
Hybrid evolutionary algorithm for the Capacitated Centered Clustering Problem
(Pergamon-Elsevier B.V. Ltd, 2011-05-01)
The Capacitated Centered Clustering Problem (CCCP) consists of defining a set of p groups with minimum dissimilarity on a network with n points. Demand values are associated with each point and each group has a demand ...
Hybrid evolutionary algorithm for the Capacitated Centered Clustering Problem
(Pergamon-Elsevier B.V. Ltd, 2011-05-01)
The Capacitated Centered Clustering Problem (CCCP) consists of defining a set of p groups with minimum dissimilarity on a network with n points. Demand values are associated with each point and each group has a demand ...
Combining K-Means and K-Harmonic with Fish School Search Algorithm for data clustering task on graphics processing units
(2016-04-01)
Data clustering is related to the split of a set of objects into smaller groups with common features. Several optimization techniques have been proposed to increase the performance of clustering algorithms. Swarm Intelligence ...
Hybrid evolutionary algorithm for the Capacitated Centered Clustering Problem
(Pergamon-Elsevier B.V. Ltd, 2014)
Boosting optimum-path forest clustering through harmony Search and its applications for intrusion detection in computer networks
(2012-12-01)
In this paper we propose a nature-inspired approach that can boost the Optimum-Path Forest (OPF) clustering algorithm by optimizing its parameters in a discrete lattice. The experiments in two public datasets have shown ...
Boosting optimum-path forest clustering through harmony Search and its applications for intrusion detection in computer networks
(2012-12-01)
In this paper we propose a nature-inspired approach that can boost the Optimum-Path Forest (OPF) clustering algorithm by optimizing its parameters in a discrete lattice. The experiments in two public datasets have shown ...
Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
(Elsevier B.V., 2016-03-01)
The minimization of tool switches problem (MTSP) seeks a sequence to process a set of jobs so that the number of tool switches required is minimized. The MTSP is well known to be NP-hard. This paper presents a new hybrid ...
On the efficiency of evolutionary fuzzy clustering
(SPRINGER, 2009)
This paper tackles the problem of showing that evolutionary algorithms for fuzzy clustering can be more efficient than systematic (i.e. repetitive) approaches when the number of clusters in a data set is unknown. To do so, ...