TEST - Catálogo BURRF
   

Hierarchical Bayesian Optimization Algorithm : Toward a new Generation of Evolutionary Algorithms / by Martin Pelikan.

Por: Colaborador(es): Tipo de material: TextoTextoSeries Studies in Fuzziness and Soft Computing ; 170Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005Descripción: xviii, 166 páginas recurso en líneaTipo de contenido:
  • texto
Tipo de medio:
  • computadora
Tipo de portador:
  • recurso en línea
ISBN:
  • 9783540323730
Formatos físicos adicionales: Edición impresa:: Sin títuloClasificación LoC:
  • TA329-348
Recursos en línea:
Contenidos:
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.
Resumen: 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.
Valoración
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

Springer eBooks

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.

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.

Para consulta fuera de la UANL se requiere clave de acceso remoto.

Universidad Autónoma de Nuevo León
Secretaría de Extensión y Cultura - Dirección de Bibliotecas @
Soportado en Koha