Abstract
Genetic Algorithms perform crossovers effectively when linkage sets — sets of variables tightly linked to form building blocks — are identified. Several methods have been proposed to detect the linkage sets. Perturbation methods (PMs) investigate fitness differences by perturbations of gene values and Estimation of distribution algorithms (EDAs) estimate the distribution of promising strings. In this paper, we propose a novel approach combining both of them, which detects dependencies of variables by estimating the distribution of strings clustered according to fitness differences. The proposed algorithm, called the Dependency Detection for Distribution Derived from fitness Differences (D5), can detect dependencies of a class of functions that are difficult for EDAs, and requires less computational cost than PMs.