Maximum spanning tree based linkage learner

DOI10.3233/AIC-140594MaRDI QIDQ2811227zbMATH OpenFDO

Authors B. Hoda Helmi, Adel T. Rahmani

Publication date 10 June 2016

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/AIC-140594

zbMATH Keywords

graph theorymutual informationestimation of distribution algorithmsoptimization problemsmaximum spanning treelinkage learningdecomposable functions

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Linkage Learning in Estimation of Distribution Algorithms
• Inductive linkage identification on building blocks of different sizes and types
• A factor graph based genetic algorithm
• scientific article; zbMATH DE number 1872097
• Linkages Detection in Histogram-Based Estimation of Distribution Algorithm

Cited in

(3)

• A factor graph based genetic algorithm
• A multifactorial optimization paradigm for linkage tree genetic algorithm
• Foundations of Genetic Algorithms

This page was built for publication: Maximum spanning tree based linkage learner

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811227)