Download presentation

Presentation is loading. Please wait.

Published byAlejandro Sweeney Modified over 4 years ago

1
Neural Networks: An Overview

2
There are many different kinds of Neural Network they include to name a few: The Back Propagating Networks Kohonen (Self-Organising) Networks Hopfield Networks The Boltzmann Machine This project has used a Kohonen Network. I shall explain the properties of such a network and why it is best for a small scale project such as this. All Neural Networks use the concept of Neurons which are gradually trained to give a more appropriate response to input.

3
The inputs are added together and this result is used to generate an output for the neuron. The inputs are generally weighted so that some inputs to the neuron may have a greater affect than others. Kohonen (Self-Organising) Networks Neurons have inputs and outputs. This project has used a Kohonen Network. I shall explain the properties of such a network and why it is best for a small scale project such as this. w2w2 w3w3 w1w1 A neuron of such as this one is called an Ada ptive Li near E lement (or Adaline) and may be found own its own … or may be found as part of a larger neural network where the output of a neuron may be the input for the next layer. U x3x3 x2x2 x1x1 What is a Kohonen Network?So what is a Neuron?

4
What is a Kohonen Network? Kohonen (Self-Organising) Networks A Kohonen network uses these basic principles however in a Kohonen network there is only one layer of neurons which are arranged in a 2D lattice. There is an input layer with inputs which feed into every neuron. x1x1 x2x2

5
What is a Kohonen Network? Kohonen (Self-Organising) Networks A Kohonen network uses these basic principles however in a Kohonen network there is only one layer of neurons which are arranged in a 2D lattice. There is an input layer with inputs which feed into every neuron. x1x1 x2x2 Each neuron evaluates the sum of the weighted inputs and uses this as its own output. This is the Euclidian distance of the neuron from the input pattern. Individual neuron output = ( x i – w ik ) 2 (for all i) Where w ik is the weight between input i and neuron k. The neuron with the smallest Euclidian distance is the one which best represents the input pattern and is known as the winner. The key to the neural network are the weights as it is they that dictate which neuron will win when the network is presented with a particular input pattern. How does training work?

6
Kohonen (Self-Organising) Networks All the weights in the network are initialised to small random values. An input pattern is presented to the network and the winning neuron is found. The weights to the winning node are updated using the following equation. w ik (t+ 1 ) = w ik (t) + G (t) ( x i (t) – w ik (t) ) The updated weight between input i and neuron k The gain term The original weight between input i and neuron k Input i This is referred to as course mapping and fine mapping. This promotes large changes away from the initial state of the network but smaller changes later when the network is some way through training. The gain term is a value between 0 and 1 which starts high and as more patterns are presented to the network is decreased. The use of a Neighborhood during training.

7
x1x1 x2x2 How does training work? Kohonen (Self-Organising) Networks Usually the weights of more neurons than the winner are changed. Once the winner has been identified a neighbourhood of a predefined shape and size is drawn around it.

8
All the neurons in the neighbourhood have their weights updated to better represent the input pattern. This promotes clustering of similar results. The neighbourhood size starts very large (typically the entire network) and is decreased during training in a similar way to the gain term. The use of a Neighborhood during training. How does training work? Kohonen (Self-Organising) Networks Usually the weights of more neurons than the winner are changed. Once the winner has been identified a neighbourhood of a predefined shape and size is drawn around it. A real output lattice will typically have hundreds of neurons.

9
How does training work? Kohonen (Self-Organising) Networks A real output lattice will typically have hundreds of neurons. This self organisation gives the network its name and leads to the lattice of nodes often being referred to as a self organising matrix. Over time the lattice of neurons will organise its self into areas of neurons which respond more highly to certain input patterns. Then all that is left is to present some input patterns to the network with known real world values (such as PCO 2 ) so that the defined areas of the lattice can be found for the individual problem and to give the areas real world values. Now when an input pattern is presented to the network the winning neuron should be in or close to a defined area so a value can be assigned. 302.1 295.6 254.3 320.8 The PCO 2 problem on a Kohonen network

10
The PCO 2 problem on a Kohonen network The inputs The network has been mainly programmed in Fortran and is made up of many console programs each with a particular function to perform on the network. Where ever possible the programs are arbitrary and so such properties as the number of input in an input pattern can be set for each network. The latter networks have had 5 inputs in each pattern, these are: 2 for month, 1 latitude, 1 longitudeand 1 sea surface temperature. The aim of this project is to program, implement and test a Kohonen network designed to predict PCO 2 levels at the surface of the ocean. These where used as they where thought to have the greatest affect on the PCO 2 concentration. To encourage the network to distinguish between months far apart and close in the calendar and to give a greater emphasis on the month input it was included twice in each pattern. However one was an input based on the Sine of the month and one on the Cosine making the month cyclical. Lattice size

11
The PCO 2 problem on a Kohonen network Lattice size The aim of this project is to program, implement and test a Kohonen network designed to predict PCO 2 levels at the surface of the ocean. Typically a square lattice size of 70x70 neurons was used. Of the 4900 neurons in such a lattice only 18.06% of them will be given exact PCO2 values to report when they are found to be the winner. If an unclassified neuron wins then a function must be employed to find the most appropriate PCO2 value. As the network must find the output of every neuron in the lattice to find the winner the size of the lattice greatly affects the time the network takes to train or run. Lattice sizeClassedAprMayJunJulAugSepOctNovAverage 175x175 (30625)6.13%30.584.814.752.782.122.732.162.126.5080 70x70 (4900)18.06%35.684.746.933.332.523.132.242.227.6000 28x28 (784)46.68%31.826.166.573.752.624.272.362.317.4833 11x11 (121)86.78%11.548.8610.704.622.915.004.072.826.3161 4x4 (16)100.00%30.4913.2214.195.5811.4310.9816.523.5913.2505 Using data as model-11.5415.8415.6910.5711.539.4111.774.3111.3331 All data is restricted to the north Atlantic drift area. This is a table of Χ where Χ 2 =Σ (model-data) 2 Number of Data points been tested. To illustrate the properties of lattice sizes several sizes have PCO 2 data in the North Atlantic drift area from a neural network

12
The PCO 2 problem on a Kohonen network PCO 2 data in the North Atlantic drift area from a neural network Using Levitus data (which gives a uniform grid of latitude and longitude with temperature values for any month) a map of PCO2 values can be constructed. This was done with MatLab. Each point on the maps has an inside colour set by the PCO 2 value given by the network and an outside colour set by the data the network was trained on, this gives a visual grade of how well the network predicts the PCO 2 levels. The network which created these maps had a lattice size of 70x70 Created by a 70x70 lattice

13
Created by a 175x175 lattice

14
Created by a 28x28 lattice

15
Created by a 11x11 lattice

16
The PCO 2 problem on a Kohonen network Created by a 4x4 lattice Training method

17
The training program looks for a file which tells it how to change these properties of the network. Usually the gain is stepped down while the neighbourhood size gets smaller smoothly. As mentioned before the gain and the neighbourhood size change during the training process. The PCO 2 problem on a Kohonen network Training method 3000000 65.00 65.00 100.00 30.00 3000000 40.00 40.00 30.00 20.00 6000000 20.00 10.00 20.00 16.00 The number of runs. This is the number of times a random input pattern is chosen and presented to the network. Gain. This is expressed as a percentage. The gain goes from the first of these to the second over the number of runs. Mostly it is fixed. Neighbourhood diameter. This is expressed as a percent of the lattice width. The size goes from the first value to the second smoothly over the number of runs. So two more tests where performed this time changing the training method. The file used in training the last networks was as follows. Long Train 3000000 80.00 80.00 100.00 75.00 3000000 65.00 65.00 75.00 60.00 3000000 52.00 52.00 60.00 50.00 3000000 40.00 40.00 50.00 33.00 6000000 30.00 20.00 33.00 20.00 6000000 20.00 10.00 20.00 16.00

18
These are designed to do the same as original training method but with more or less runs i.e. the patterns are presented to the network more or less times. The PCO 2 problem on a Kohonen network Training method Long Train 3000000 80.00 80.00 100.00 75.00 3000000 65.00 65.00 75.00 60.00 3000000 52.00 52.00 60.00 50.00 3000000 40.00 40.00 50.00 33.00 6000000 30.00 20.00 33.00 20.00 6000000 20.00 10.00 20.00 16.00 Quick Train 1000000 65.00 65.00 100.00 35.00 500000 40.00 40.00 35.00 25.00 1500000 20.00 20.00 25.00 18.00 The networks both had a 70x70 output lattice so a comparison with the 70x70 size network trained with the original method is valid. ClassedAprMayJunJulAugSepOctNovAverage Long18.00%34.834.806.083.452.373.372.072.267.4038 Original18.06%35.684.746.933.332.523.132.242.227.6000 Quick19.84%18.384.304.993.132.383.242.142.225.0963 This is a table of Χ where Χ 2 =Σ (model-data) 2 Number of Data points

19
Created by a 70x70 lattice using the Long method

20
Created by a 70x70 lattice using the Orig- inal method

21
Created by a 70x70 lattice using the Quick method

Similar presentations

OK

2011 FRANKLIN COMMUNITY SURVEY YOUTH RISK BEHAVIOR GRADES 9-12 STUDENTS=332.

2011 FRANKLIN COMMUNITY SURVEY YOUTH RISK BEHAVIOR GRADES 9-12 STUDENTS=332.

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Nokia acquired by microsoft ppt online Ppt on market friendly state to retire Head mounted display ppt on ipad Ppt on game theory band Ppt on principles of peace building institute of africa Ppt on diversity in living organisms class 9 Ppt on the book the secret Free ppt on layers of atmosphere Ppt on indian textile industries inc Ppt on event handling in javascript output