|
|
|
|
| LEADER |
02901nmm a2200397 u 4500 |
| 001 |
EB000375447 |
| 003 |
EBX01000000000000000228499 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
130626 ||| eng |
| 020 |
|
|
|a 9783540323730
|
| 100 |
1 |
|
|a Pelikan, Martin
|
| 245 |
0 |
0 |
|a Hierarchical Bayesian Optimization Algorithm
|h Elektronische Ressource
|b Toward a New Generation of Evolutionary Algorithms
|c by Martin Pelikan
|
| 250 |
|
|
|a 1st ed. 2005
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2005, 2005
|
| 300 |
|
|
|a XVIII, 166 p
|b online resource
|
| 505 |
0 |
|
|a From Genetic Variation to Probabilistic Modeling -- Probabilistic Model-Building Genetic Algorithms -- Bayesian Optimization Algorithm -- Scalability Analysis -- The Challenge of Hierarchical Difficulty -- Hierarchical Bayesian Optimization Algorithm -- Hierarchical BOA in the Real World
|
| 653 |
|
|
|a Programming Techniques
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Engineering mathematics
|
| 653 |
|
|
|a Computer programming
|
| 653 |
|
|
|a Artificial Intelligence
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Artificial intelligence
|
| 653 |
|
|
|a Engineering / Data processing
|
| 653 |
|
|
|a Applications of Mathematics
|
| 653 |
|
|
|a Theory of Computation
|
| 653 |
|
|
|a Mathematics
|
| 653 |
|
|
|a Mathematical and Computational Engineering Applications
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Studies in Fuzziness and Soft Computing
|
| 028 |
5 |
0 |
|a 10.1007/b10910
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/b10910?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 520 |
|
|
|a This book provides a framework for the design of competent optimization techniques by combining advanced evolutionary algorithms with state-of-the-art machine learning techniques. The book focuses on two algorithms that replace traditional variation operators of evolutionary algorithms by learning and sampling Bayesian networks: the Bayesian optimization algorithm (BOA) and the hierarchical BOA (hBOA). BOA and hBOA are theoretically and empirically shown to provide robust and scalable solution for broad classes of nearly decomposable and hierarchical problems. A theoretical model is developed that estimates the scalability and adequate parameter settings for BOA and hBOA. The performance of BOA and hBOA is analyzed on a number of artificial problems of bounded difficulty designed to test BOA and hBOA on the boundary of their design envelope. The algorithms are also extensively tested on two interesting classes of real-world problems: MAXSAT and Ising spin glasses with periodic boundary conditions in two and three dimensions. Experimental results validate the theoretical model and confirm that BOA and hBOA provide robust and scalable solution for nearly decomposable and hierarchical problems with only little problem-specific information
|