Memetic Differential Evolution Methods for Semi-Supervised Clustering
In this paper, we propose an extension for semi-supervised Minimum Sum-of-Squares Clustering (MSSC) problems of MDEClust, a memetic framework based on the Differential Evolution paradigm for unsupervised clustering. In semi-supervised MSSC, background knowledge is available in the form of (instance-level) "must-link" and "cannot-link" constraints, each of which indicating if two dataset points should be associated to the same or to a different cluster, respectively. The presence of such constraints makes the problem at least as hard as its unsupervised version and, as a consequence, some framework operations need to be carefully designed to handle this additional complexity: for instance, it is no more true that each point is associated to its nearest cluster center. As far as we know, our new framework, called S-MDEClust, represents the first memetic methodology designed to generate a (hopefully) optimal feasible solution for semi-supervised MSSC problems. Results of thorough computational experiments on a set of well-known as well as synthetic datasets show the effectiveness and efficiency of our proposal.
Code (1)
Tasks
ClusteringMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Memetic Search in Differential Evolution Algorithm
Differential Evolution (DE) is a renowned optimization stratagem that can easily solve nonlinear and comprehensive problems. DE is a well known and uncomplicated population based probabilistic approach for comprehensive …
Evolutionary AlgorithmsPositionLarge Scale Global Optimization Algorithms for IoT Networks: A Comparative Study
The advent of Internet of Things (IoT) has bring a new era in communication technology by expanding the current inter-networking services and enabling the machine-to-machine communication. IoT massive deployments will cr…
Clusteringglobal-optimizationSingle Particle AnalysisBootstrapping of memetic from genetic evolution via inter-agent selection pressures
We create an artificial system of agents (attention-based neural networks) which selectively exchange messages with each-other in order to study the emergence of memetic evolution and how memetic evolutionary pressures i…
Memetic Viability Evolution for Constrained Optimization
The performance of evolutionary algorithms can be heavily undermined when constraints limit the feasible areas of the search space. For instance, while Covariance Matrix Adaptation Evolution Strategy is one of the most e…
Evolutionary AlgorithmsFeature selection for transient stability assessment based on kernelized fuzzy rough sets and memetic algorithm
A new feature selection method based on kernelized fuzzy rough sets (KFRS) and the memetic algorithm (MA) is proposed for transient stability assessment of power systems. Considering the possible real-time information pr…
AttributeClassificationfeature selection