A new DSM clustering algorithm for linkage groups identification

Authors:
Amin Nikanjam;Hadi Sharifi;B. Hoda Helmi;Adel Rahmani
Affiliations:
Iran University of Science and Technology, Tehran, Iran;Iran University of Science and Technology, Tehran, Iran;Iran University of Science and Technology, Tehran, Iran;Iran University of Science and Technology, Tehran, Iran
Venue:
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Year:
2010

Citing 3
Cited 3

Characterizing complex product architectures: Regular Paper

Systems Engineering
A matrix approach for finding extrema: problems with modularity, hierarchy, and overlap

A matrix approach for finding extrema: problems with modularity, hierarchy, and overlap
Dependency structure matrix, genetic algorithms, and effective recombination

Evolutionary Computation

Interaction detection for hybrid decomposable problems

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Linkage learning using the maximum spanning tree of the dependency graph

Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Efficient model building in competent genetic algorithms using DSM clustering

AI Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linkage learning has been considered as an influential factor in success of genetic and evolutionary algorithms for solving difficult optimization problems. In this paper, a deterministic model named Dependency Structure Matrix (DSM) is used for explicitly decomposing the problem. DSM captures pair-wise dependencies of the problem that must be turned into higher order interactions while solving complex problems. One way to obtain these higher order interactions (linkage groups) is clustering the DSM. A new DSM clustering algorithm is proposed in this paper which is able to identify all the linkage groups from a less accurate DSM leading to a reduction in the number of fitness calls required for identifying the linkage groups. The proposed technique is tested on several benchmark problems and it is shown that it can accurately identify all the linkage groups by O(n1.7) fitness evaluations, where n is problem size.