Estimation of Distribution Algorithms

by ;
Format: Hardcover
Pub. Date: 2001-10-01
Publisher(s): Kluwer Academic Pub
List Price: $299.57

Rent Textbook

Select for Price
There was a problem. Please try again later.

Rent Digital

Rent Digital Options
Online:30 Days access
Downloadable:30 Days
$75.24
Online:60 Days access
Downloadable:60 Days
$100.32
Online:90 Days access
Downloadable:90 Days
$125.40
Online:120 Days access
Downloadable:120 Days
$150.48
Online:180 Days access
Downloadable:180 Days
$163.02
Online:1825 Days access
Downloadable:Lifetime Access
$250.80
*To support the delivery of the digital material to you, a non-refundable digital delivery fee of $3.99 will be charged on each digital item.
$163.02*

New Textbook

We're Sorry
Sold Out

Used Textbook

We're Sorry
Sold Out

How Marketplace Works:

  • This item is offered by an independent seller and not shipped from our warehouse
  • Item details like edition and cover design may differ from our description; see seller's comments before ordering.
  • Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
  • Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
  • Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.

Summary

Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation is devoted to a new paradigm for evolutionary computation, named estimation of distribution algorithms (EDAs). This new class of algorithms generalizes genetic algorithms by replacing the crossover and mutation operators with learning and sampling from the probability distribution of the best individuals of the population at each iteration of the algorithm. Working in such a way, the relationships between the variables involved in the problem domain are explicitly and effectively captured and exploited. This text constitutes the first compilation and review of the techniques and applications of this new tool for performing evolutionary computation. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation is clearly divided into three parts. Part I is dedicated to the foundations of EDAs. In this part, after introducing some probabilistic graphical models - Bayesian and Gaussian networks - a review of existing EDA approaches is presented, as well as some new methods based on more flexible probabilistic graphical models. A mathematical modeling of discrete EDAs is also presented. Part II covers several applications of EDAs in some classical optimization problems: the travelling salesman problem, the job scheduling problem, and the knapsack problem. EDAs are also applied to the optimization of some well-known combinatorial and continuous functions. Part III presents the application of EDAs to solve some problems that arise in the machine learning field: feature subset selection, feature weighting in K-NN classifiers, rule induction, partial abductive inference in Bayesian networks, partitional clustering, and the search for optimal weights in artificial neural networks. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation is a useful and interesting tool for researchers working in the field of evolutionary computation and for engineers who face real-world optimization problems. This book may also be used by graduate students and researchers in computer science. '... I urge those who are interested in EDAs to study this well-crafted book today.' David E. Goldberg, University of Illinois Champaign-Urbana.

Table of Contents

List of Figures
xi
List of Tables
xvii
Preface xxiii
Contributing Authors xxvii
Series Foreword xxxiii
Part I Foundations
An Introduction to Evolutionary Algorithms
3(24)
J.A. Lozano
Introduction
3(3)
Genetic Algorithms
6(8)
Evolution Strategies
14(5)
Evolutionary Programming
19(1)
Summary
20(7)
An Introduction to Probabilistic Graphical Models
27(30)
P. Larranaga
Introduction
27(1)
Notation
28(3)
Bayesian networks
31(13)
Gaussian networks
44(7)
Simulation
51(1)
Summary
51(6)
A Review on Estimation of Distribution Algorithms
57(44)
P. Larranaga
Introduction
57(1)
EDA approaches to optimization
58(6)
EDA approaches to combinatorial optimization
64(16)
EDA approaches in continuous domains
80(10)
Summary
90(11)
Benefits of Data Clustering in Multimodal Function Optimization via EDAs
101(28)
J.M. Pena
J.A. Lozano
P. Larranaga
Introduction
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)
Experimental results
113(10)
Conclusions
123(6)
Parallel Estimation of Distribution Algorithms
129(18)
J.A. Lozano
R. Sagarna
P. Larranaga
Introduction
129(1)
Sequential Ebnabic
130(3)
Parallel Ebnabic
133(5)
Numerical evaluation
138(4)
Summary and conclusions
142(5)
Mathematical Modeling of Discrete Estimation of Distribution Algorithms
147(20)
C. Gonzalez
J.A. Lozano
P. Larranaga
Introduction
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)
Conclusions
161(6)
Part II Optimization
An Empirical Comparison of Discrete Estimation of Distribution Algorithms
167(14)
R. Blanco
J.A. Lozano
Introduction
167(1)
Experimental framework
168(1)
Sets of function test
169(4)
Experimental results
173(4)
Conclusions
177(4)
Results in Function Optimization with EDAs in Continuous Domain
181(14)
E. Bengoetxea
T. Miquelez
P. Larranaga
J.A. Lozano
Introduction
181(1)
Description of the optimization problems
182(1)
Algorithms to test
183(2)
Brief description of the experiments
185(8)
Conclusions
193(2)
Solving the 0---1 Knapsack Problem with EDAs
195(16)
R. Sagarna
P. Larranaga
Introduction
195(1)
The 0---1 knapsack problem
196(1)
Binary representation
197(5)
Representation based on permutations
202(1)
Experimental results
203(5)
Conclusions
208(3)
Solving the Traveling Salesman Problem with EDAs
211(20)
V. Robles
P. de Miguel
P. Larranaga
Introduction
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)
Conclusions
226(5)
EDAs Applied to the Job Shop Scheduling Problem
231(12)
J.A. Lozano
A. Mendiburu
Introduction
231(2)
EDAs in job shop scheduling problems
233(1)
Hybridization
234(3)
Experimental results
237(3)
Conclusions
240(3)
Solving Graph Matching with EDAs Using a Permutation-Based Representation
243(26)
E. Bengoetxea
P. Larranaga
I. Bloch
A. Perchant
Introduction
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)
I. Inza
P. Larranaga
B. Sierra
Introduction
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)
I. Inza
P. Larranaga
B. Sierra
Introduction
295(1)
Related work
296(3)
Learning weights by Bayesian and Gaussian networks
299(3)
Experimental comparison
302(6)
Summary and future work
308(5)
Rule Induction by Estimation of Distribution Algorithms
313(10)
B. Sierra
E.A. Jimenez
I. Inza
P. Larranaga
J. Muruzabal
Introduction
313(1)
A review of Classifier Systems
314(1)
An approach to rule induction by means of EDAs
315(3)
Empirical comparison
318(2)
Conclusions and future work
320(3)
Partial Abductive Inference in Bayesian Networks: An Empirical Comparison Between GAs and EDAs
323(20)
L.M. de Campos
J.A. Gamez
P. Larranaga
S. Moral
T. Romero
Introduction
324(1)
Query types in probabilistic expert systems
324(2)
Solving queries
326(1)
Tackling the problem with Genetic Algorithms
327(3)
Tackling the problem with Estimation of Distribution Algorithms
330(1)
Experimental evaluation
331(7)
Concluding remarks
338(5)
Comparing K-Means, GAs and EDAs in Partitional Clustering
343(18)
J. Roure
P. Larranaga
R. Sanguesa
Introduction
343(2)
Partitional clustering
345(1)
Iterative algorithms
345(2)
Genetic Algorithms in partitional clustering
347(4)
Estimation of Distribution Algorithms in partitional clustering
351(1)
Experimental results
352(3)
Conclusions
355(6)
Adjusting Weights in Artificial Neural Networks using Evolutionary Algorithms
361(18)
C. Cotta
E. Alba
R. Sagarna
P. Larranaga
Introduction
362(1)
An evolutionary approach to ANN training
363(5)
Experimental results
368(5)
Conclusions
373(6)
Index 379

An electronic version of this book is available through VitalSource.

This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.

By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.

Digital License

You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.

More details can be found here.

A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.

Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.

Please view the compatibility matrix prior to purchase.