|
|
|
xi | |
|
|
|
xvii | |
| Preface |
|
xxiii | |
| Contributing Authors |
|
xxvii | |
| Series Foreword |
|
xxxiii | |
| Part I Foundations |
|
|
An Introduction to Evolutionary Algorithms |
|
|
3 | (24) |
|
|
|
|
|
|
|
|
3 | (3) |
|
|
|
6 | (8) |
|
|
|
14 | (5) |
|
|
|
19 | (1) |
|
|
|
20 | (7) |
|
An Introduction to Probabilistic Graphical Models |
|
|
27 | (30) |
|
|
|
|
|
|
|
|
27 | (1) |
|
|
|
28 | (3) |
|
|
|
31 | (13) |
|
|
|
44 | (7) |
|
|
|
51 | (1) |
|
|
|
51 | (6) |
|
A Review on Estimation of Distribution Algorithms |
|
|
57 | (44) |
|
|
|
|
|
|
|
|
57 | (1) |
|
EDA approaches to optimization |
|
|
58 | (6) |
|
EDA approaches to combinatorial optimization |
|
|
64 | (16) |
|
EDA approaches in continuous domains |
|
|
80 | (10) |
|
|
|
90 | (11) |
|
Benefits of Data Clustering in Multimodal Function Optimization via EDAs |
|
|
101 | (28) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
101 | (2) |
|
Data clustering in evolutionary algorithms for multimodal function optimization |
|
|
103 | (2) |
|
BNs and CGNs applied to data clustering |
|
|
105 | (6) |
|
Further considerations about the EMDA |
|
|
111 | (2) |
|
|
|
113 | (10) |
|
|
|
123 | (6) |
|
Parallel Estimation of Distribution Algorithms |
|
|
129 | (18) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
129 | (1) |
|
|
|
130 | (3) |
|
|
|
133 | (5) |
|
|
|
138 | (4) |
|
|
|
142 | (5) |
|
Mathematical Modeling of Discrete Estimation of Distribution Algorithms |
|
|
147 | (20) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
147 | (1) |
|
Using Markov chains to model EDAs |
|
|
148 | (7) |
|
Dynamical systems in the modeling of some EDAs |
|
|
155 | (4) |
|
Other approaches to modeling EDAs |
|
|
159 | (2) |
|
|
|
161 | (6) |
| Part II Optimization |
|
|
An Empirical Comparison of Discrete Estimation of Distribution Algorithms |
|
|
167 | (14) |
|
|
|
|
|
|
|
|
|
|
|
|
|
167 | (1) |
|
|
|
168 | (1) |
|
|
|
169 | (4) |
|
|
|
173 | (4) |
|
|
|
177 | (4) |
|
Results in Function Optimization with EDAs in Continuous Domain |
|
|
181 | (14) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
181 | (1) |
|
Description of the optimization problems |
|
|
182 | (1) |
|
|
|
183 | (2) |
|
Brief description of the experiments |
|
|
185 | (8) |
|
|
|
193 | (2) |
|
Solving the 0---1 Knapsack Problem with EDAs |
|
|
195 | (16) |
|
|
|
|
|
|
|
|
|
|
|
|
|
195 | (1) |
|
The 0---1 knapsack problem |
|
|
196 | (1) |
|
|
|
197 | (5) |
|
Representation based on permutations |
|
|
202 | (1) |
|
|
|
203 | (5) |
|
|
|
208 | (3) |
|
Solving the Traveling Salesman Problem with EDAs |
|
|
211 | (20) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
211 | (1) |
|
Review of algorithms for the TSP |
|
|
212 | (5) |
|
A new approach: Solving the TSP with EDAs |
|
|
217 | (4) |
|
Experimental results with EDAs |
|
|
221 | (5) |
|
|
|
226 | (5) |
|
EDAs Applied to the Job Shop Scheduling Problem |
|
|
231 | (12) |
|
|
|
|
|
|
|
|
|
|
|
|
|
231 | (2) |
|
EDAs in job shop scheduling problems |
|
|
233 | (1) |
|
|
|
234 | (3) |
|
|
|
237 | (3) |
|
|
|
240 | (3) |
|
Solving Graph Matching with EDAs Using a Permutation-Based Representation |
|
|
243 | (26) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
244 | (1) |
|
Graph matching as a combinatorial optimization problem with constraints |
|
|
245 | (2) |
|
Representing a matching as a permutation |
|
|
247 | (7) |
|
Obtaining a permutation with discrete EDAs |
|
|
254 | (2) |
|
Obtaining a permutation with continuous EDAs |
|
|
256 | (1) |
|
Experimental results. The human brain example |
|
|
257 | (5) |
|
Conclusions and further work |
|
|
262 | (7) |
| Part III Machine Learning |
|
|
Feature Subset Selection by Estimation of Distribution Algorithms |
|
|
269 | (26) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
269 | (2) |
|
Feature Subset Selection: Basic components |
|
|
271 | (2) |
|
FSS by EDAs in small and medium scale domains |
|
|
273 | (9) |
|
FSS by EDAs in large scale domains |
|
|
282 | (7) |
|
Conclusions and future work |
|
|
289 | (6) |
|
Feature Weighting for Nearest Neighbor by EDAs |
|
|
295 | (18) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
295 | (1) |
|
|
|
296 | (3) |
|
Learning weights by Bayesian and Gaussian networks |
|
|
299 | (3) |
|
|
|
302 | (6) |
|
|
|
308 | (5) |
|
Rule Induction by Estimation of Distribution Algorithms |
|
|
313 | (10) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
313 | (1) |
|
A review of Classifier Systems |
|
|
314 | (1) |
|
An approach to rule induction by means of EDAs |
|
|
315 | (3) |
|
|
|
318 | (2) |
|
Conclusions and future work |
|
|
320 | (3) |
|
Partial Abductive Inference in Bayesian Networks: An Empirical Comparison Between GAs and EDAs |
|
|
323 | (20) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
324 | (1) |
|
Query types in probabilistic expert systems |
|
|
324 | (2) |
|
|
|
326 | (1) |
|
Tackling the problem with Genetic Algorithms |
|
|
327 | (3) |
|
Tackling the problem with Estimation of Distribution Algorithms |
|
|
330 | (1) |
|
|
|
331 | (7) |
|
|
|
338 | (5) |
|
Comparing K-Means, GAs and EDAs in Partitional Clustering |
|
|
343 | (18) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
343 | (2) |
|
|
|
345 | (1) |
|
|
|
345 | (2) |
|
Genetic Algorithms in partitional clustering |
|
|
347 | (4) |
|
Estimation of Distribution Algorithms in partitional clustering |
|
|
351 | (1) |
|
|
|
352 | (3) |
|
|
|
355 | (6) |
|
Adjusting Weights in Artificial Neural Networks using Evolutionary Algorithms |
|
|
361 | (18) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
362 | (1) |
|
An evolutionary approach to ANN training |
|
|
363 | (5) |
|
|
|
368 | (5) |
|
|
|
373 | (6) |
| Index |
|
379 | |