Evolving high-posterior self-organizing maps

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Bayesian inference for neural networks has received a good deal of attention in recent years. Unlike standard methods, the bayesian approach provides the analyst with the richness (and complexity) of a probability distribution over the space of network weights (and possibly other quantities of interest). These posterior distributions prompt an optimization problem that may be suitable for evolutionary algorithms. This possibility is obviously of foremost interest when no alternative global functions are available for optimization. Some preliminary results related to one of such cases, namely, the self-organizing map, are presented in this paper. Specifically, a familiar "steady-state" diffusion genetic algorithm is described and tested. © Springer-Verlag Berlin Heidelberg 2001.

Cite

CITATION STYLE

APA

Muruzábal, J. (2001). Evolving high-posterior self-organizing maps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2084 LNCS, pp. 701–708). Springer Verlag. https://doi.org/10.1007/3-540-45720-8_84

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free