Published on Mon Oct 15 2007

Effective linkage learning using low-order statistics and clustering

Leonardo Emmendorfer, Aurora Pozo

The adoption of probabilistic models for the best individuals found so far is a powerful approach for evolutionary computation. Increasingly more complex models have been used by estimation of distribution algorithms. Supervised and unsupervised learning of Bayesian networks are very effective options.

0
0
0
Abstract

The adoption of probabilistic models for the best individuals found so far is a powerful approach for evolutionary computation. Increasingly more complex models have been used by estimation of distribution algorithms (EDAs), which often result better effectiveness on finding the global optima for hard optimization problems. Supervised and unsupervised learning of Bayesian networks are very effective options, since those models are able to capture interactions of high order among the variables of a problem. Diversity preservation, through niching techniques, has also shown to be very important to allow the identification of the problem structure as much as for keeping several global optima. Recently, clustering was evaluated as an effective niching technique for EDAs, but the performance of simpler low-order EDAs was not shown to be much improved by clustering, except for some simple multimodal problems. This work proposes and evaluates a combination operator guided by a measure from information theory which allows a clustered low-order EDA to effectively solve a comprehensive range of benchmark optimization problems.

Fri Feb 04 2005
Neural Networks
Sub-structural Niching in Estimation of Distribution Algorithms
0
0
0
Wed Apr 25 2018
Machine Learning
HG-means: A scalable hybrid genetic algorithm for minimum sum-of-squares clustering
minimum sum-of-squares clustering (MSSC) is a widely used clustering model. It is known that the solutions of K-means can be arbitrarily distant from the MSSC global optimum. Dozens of alternative heuristics have been proposed for this problem.
0
0
0
Tue Oct 22 2019
Neural Networks
Genetic Programming for Evolving Similarity Functions for Clustering: Representations and Analysis
Clustering is a difficult and widely-studied data mining task. Nearly all algorithms use a similarity measure such as a distance metric to decide which instances to assign to the same cluster. We propose a new approach to automatically evolving similarity functions for a given clustering algorithm by using genetic programming.
0
0
0
Mon Feb 07 2005
Neural Networks
Multiobjective hBOA, Clustering, and Scalability
0
0
0
Wed Oct 31 2018
Machine Learning
An Evolutionary Algorithm with Crossover and Mutation for Model-Based Clustering
An evolutionary algorithm (EA) is developed as an alternative to the EM algorithm for parameter estimation in model-based clustering. This EA facilitates a different search of the fitness landscape, i.e., the likelihood surface, utilizing both crossover and mutation.
0
0
0
Wed Sep 19 2018
Artificial Intelligence
Data-Driven Clustering via Parameterized Lloyd's Families
Algorithms for clustering points in metric spaces is a long-studied area of research. We design efficient learning algorithms which receive samples from an application-specific distribution over clustering instances and learn a near-optimal clustering algorithm.
0
0
0