Sciweavers

329 search results - page 5 / 66
» Robustness Analysis of the Neural Gas Learning Algorithm
Sort
View
ICIAP
2005
ACM
14 years 7 months ago
A Neural Adaptive Algorithm for Feature Selection and Classification of High Dimensionality Data
In this paper, we propose a novel method which involves neural adaptive techniques for identifying salient features and for classifying high dimensionality data. In particular a ne...
Elisabetta Binaghi, Ignazio Gallo, Mirco Boschetti...
GECCO
2006
Springer
208views Optimization» more  GECCO 2006»
13 years 11 months ago
Comparing evolutionary and temporal difference methods in a reinforcement learning domain
Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving reinforcement learning (RL) problems. However, since few rigorous empirical com...
Matthew E. Taylor, Shimon Whiteson, Peter Stone
ICANN
2010
Springer
13 years 7 months ago
Tumble Tree - Reducing Complexity of the Growing Cells Approach
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
Hendrik Annuth, Christian-A. Bohn
ICANN
2003
Springer
14 years 20 days ago
Unsupervised Learning of a Kinematic Arm Model
Abstract. An abstract recurrent neural network trained by an unsupervised method is applied to the kinematic control of a robot arm. The network is a novel extension of the Neural ...
Heiko Hoffmann, Ralf Möller
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
13 years 11 months ago
Time Complexity of genetic algorithms on exponentially scaled problems
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
Fernando G. Lobo, David E. Goldberg, Martin Pelika...