Negative Correlation Learning in the Estimation of Distribution Algorithms for Combinatorial Optimization
Warin Wattanapornprom, Prabhas Chongstitvatana · IEICE Transactions on Information and Systems · 2013
This article introduces the Coincidence Algorithm (COIN) to solve several multimodal puzzles. COIN is an algorithm in the category of Estimation of Distribution Algorithms (EDAs) that makes use of probabilistic models to generate solutions. The model of COIN is a joint probability table of adjacent events (coincidence) derived from the population of candidate solutions. A unique characteristic of COIN is the ability to learn from a negative sample. Various experiments show that learning from a negative example helps to prevent premature convergence, promotes diversity and preserves good building blocks.