Hierarchical Bayesian Optimization Algorithm: Toward a New Generation of Evolutionary Algorithms (Studies in Fuzziness and Soft Computing, 170)

Pelikan, Martin

ISBN 10: 3540237747 / ISBN 13: 9783540237747

Editore: Springer, 2005

Riguardo questo articolo

Ex-library book with typical stickers and stampings. Priority Mail is available on this item. No international shipping.

Codice articolo D091125AGmug173999

Dati bibliografici

• Titolo: Hierarchical Bayesian Optimization Algorithm: Toward a New Generation of Evolutionary Algorithms (Studies in Fuzziness and Soft Computing, 170)
• Editore: Springer
• Data di pubblicazione: 2005
• Lingua: Inglese
• ISBN 10: 3540237747
• ISBN 13: 9783540237747
• Rilegatura: hardcover
• Condizione: Good
• Peso: 14 once

Descrizione articolo

Riassunto

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 primary focus of the book is 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). They provide a scalable solution to a broad class of problems. The book provides an overview of evolutionary algorithms that use probabilistic models to guide their search, motivates and describes BOA and hBOA in a way accessible to a wide audience, and presents numerous results confirming that they are revolutionary approaches to black-box optimization.

Dalla quarta di copertina

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.