A niching scheme for EDAs to reduce spurious dependencies
Journal
GECCO 2013 - 2013 Genetic and Evolutionary Computation Conference
Pages
375-382
Date Issued
2013
Author(s)
Hsu, P.-C.
Abstract
This paper proposes a niching scheme, the dependency structure matrix restricted tournament replacement (DSMRTR). The restricted tournament replacement (RTR) is a well-known niching scheme in the field of estimation of distribution algorithms (EDAs). However, RTR induces spurious dependencies among variables, which impair the performance of EDAs. This paper utilizes building-block-wise distances to define a new distance metric, the one-niche distance. For those EDAs which provide explicit linkage information, the one-niche distances can be directly incorporated into RTR. For EDAs without such information, DSMRTR constructs a dependency structure matrix via the differential mutual complement to estimate the one-niche distances. Empirical results show that DSMRTR induces fewer spurious dependencies than RTR does while maintaining enough diversity for EDAs. Copyright © 2013 ACM.
Subjects
EDA; Model building; Niching; Spurious dependencies
Other Subjects
Dependency structure matrixes; Distance metrics; EDA; Estimation of distribution algorithms; Linkage information; Niching; Spurious dependencies; Model buildings; Evolutionary algorithms
Type
conference paper