Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ESANN
2000

favoriteEmaildiscussreport

116views Neural Networks» more ESANN 2000»

Self-Organisation in the SOM with a finite number of possible inputs

13 years 6 months ago

Self-Organisation in the SOM with a finite number of possible inputs

Download www.dice.ucl.ac.be

Abstract. Given a one dimensional SOM with a monotonically decreasing neighbourhood and an input distribution which is not Lebesque continuous, a set of su cient conditions and a Theorem are stated which ensure probability one organisation of the neuron weights. This leads to a rule for choosing the number of neurons and width of the neighbourhood to improve the chances of reaching an organised state in a practical implementation of the SOM.

John A. Flanagan

Real-time Traffic

Dimensional Som | ESANN 2000 | ESANN 2007 | Neuron Weights | Su Cient Conditions |

claim paper

Related Content

» A SelfOrganising Map Approach for Clustering of XML Documents

» Theoretical Properties of Projection Based Multilayer Perceptrons with Functional Inputs

» Mechanical Criteria for the Preparation of Finite Element Models

» Modelbased Predictive Control of Hybrid Systems A Probabilistic Neuralnetwork Approach to ...

» The 2Adic CM Method for Genus 2 Curves with Application to Cryptography

» Advances in moving horizon estimation for nonlinear systems

» Flow Line Systems with Possibilistic Data a System with Waiting Time in Line Uncertain

» Timedependent affine triangulation of spatiotemporal data

» Synthia Synthesis of Interacting Automata Targeting LUTbased FPGAs

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2000
Where	ESANN
Authors	John A. Flanagan

Comments (0)