William Sayers

2009
Milestone 3

05025397

Genetic Algorithms and Neural Networks

Genetic Algorithms and Neural Networks
William Sayers (05025397)
Supervised by: Colin W. Morris (BSc, MSc)
Backpropagation neural networks are usually trained using some iterative method derived from a mathematical analysis of the operation of the network. This technique is time consuming and requires understanding of the mathematical principles involved. This project will investigate the application of genetic algorithms to replace the "normal" training of the network. This involves setting up some candidate networks and then picking the best of these. The best of the population are then combined in some way to produce a new population of candidate networks. This procedure is continued until a satisfactory network is obtained.

William Keith Paul Sayers225 Page 1 of Faculty of Advanced Technology 22/04/2009

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3

Contents
Contents ............................................................................................................................ 2 1 - Introduction ............................................................................................................... 10 2 - Research .................................................................................................................... 10 2.1 - Neural Networks ................................................................................................. 10 2.1.1 - The Biological Neuron................................................................................. 10 Figure 1 - A human neuron ............................................................................................ 10 2.1.2 - The Artificial Neuron................................................................................... 11 Figure 2 - An artificial neuron ........................................................................................ 12 Equation 1 - Summation of the inputs and weights ........................................................ 12 Figure 3 - The sigmoid function shape ........................................................................... 13 2.2 - The History of Neural Networks ........................................................................ 13 2.3 - Advantages and Disadvantages of Neural Networks ......................................... 14 2.3.1 - Advantages................................................................................................... 14 2.3.2 - Disadvantages .............................................................................................. 15 2.4 - Current Applications of Neural Networks .......................................................... 17 2.4.1 - Neural Networks in Medicine ...................................................................... 17 2.4.2 - Neural Networks in Business ....................................................................... 18 2.4.3 - Object Trajectories....................................................................................... 19 2.4.4 - Robot Control .............................................................................................. 19 2.5 - Back-propagation ............................................................................................... 20 2.5.1 - Back-propagation overview ......................................................................... 20 Page 2 of 225

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3 2.5.2 - Back-propagation in depth ........................................................................... 20 2.5.3 - Back-propagation library ............................................................................. 22 2.6 - The FANN neural network library (Nissen, FANN) .......................................... 22 2.7 - Genetic Algorithms ............................................................................................ 22 2.7.1 - History of Genetic Algorithms .................................................................... 23 2.7.2 - Advantages and Disadvantages of Genetic Algorithms .............................. 24 Figure 4 - local optimum (units are undefined in this case). .......................................... 27 2.8 - Training Neural Networks with Genetic Algorithms ......................................... 28 2.8.1 - Determining Weight Values with Genetic Algorithms................................ 28 2.8.2 - Representation of a Neural Network within a Genetic Algrithm ................ 28 2.8.3 - Using Genetic Algorithms to Determine Neural Network Structure ........... 29 Figure 5 - A feed-forward neural network ..................................................................... 30 2.9 - Cascade Correlation............................................................................................ 32 2.10 - C# User Interface Programming ....................................................................... 37 2.11 - Writing C++/CLI Wrappers for Unmanaged C++ code................................... 37 2.12 - Application of Research ................................................................................... 38 3 - Design ....................................................................................................................... 38 3.1 - Program Requirements ....................................................................................... 39 3.2 - Design of the Class Structure ............................................................................. 39 3.3 - Linking C# code to managed dll’s...................................................................... 40 3.4 - Design of the User Interface ............................................................................... 40 Page 3 of 225

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3 3.4.1 - Main Form ................................................................................................... 40 Figure 9 – Network and output tab design (Main form) ................................................ 41 Figure 10 - Mean squared error tab design (Main form) ................................................ 42 Figure 11 - Dataset tab design (Main form) ................................................................... 42 3.4.2 - New Network Wizard .................................................................................. 43 Figure 12 - Design of the training algorithm tab (Wizard form) .................................... 43 Figure 13 - Design of the network settings tab (Wizard form) ...................................... 44 Figure 14 - Dataset selection tab design (Wizard form)................................................. 44 3.4.3 - Working Form ............................................................................................. 44 Figure 15 - Working form design (Working form) ........................................................ 45 3.4.4 - About Form .................................................................................................. 45 Figure 16 - About form design (About form) ................................................................. 45 Figure 17 - Dataset display design (About form) ........................................................... 46 Figure 18 - Licenses display design (About form) ......................................................... 46 4 - Implementation ......................................................................................................... 46 4.1 - User Interface Implementation ........................................................................... 47 4.1.1 - Main Form ................................................................................................... 47 Figure 19 - Network and Output tab............................................................................... 47 Figure 20 - Mean squared error graph tab ..................................................................... 48 Figure 21 - The dataset tab ............................................................................................. 49 4.1.2 - New Neural Network Wizard ...................................................................... 50 Figure 22 - Learning Algorithm tab ............................................................................... 50 Figure 23 - Network Settings tab.................................................................................... 51

Page 4 of 225

............. 55 4......................................................................... 61 Figure 30 .............Mean squared error upon last training test (XOR) ..............1..................................................... 56 4.....1 ...Cascade Correlation ......................1................................................................................................Back-propagation ..............4 ..............3 ................Working Form ...............1........................................................................................................................ 54 4........... 58 5....2 ..... 54 4....Keeping the User Interface Active whilst Processing is Occurring......... Datasets view ..................................... 59 5...........................................2 ......................................About form... 53 Figure 27 ..... 52 Figure 26 ....Number of iterations to achieve target (XOR) ..Testing Data ..................Neural Network Implementation ...............................................................3 ......5 .. 54 4................ 61 Figure 29 ...........................2...........1...................................................................1.......... 61 Figure 31 .............About form........Back-propagation and Cascade Correlation Implementation ........ 59 5................ 57 4.......................................................................... main view ....................XOR ................1............ 52 Figure 25 .......................................................1 .......................The mean squared error at testing (XOR).......................................About form...............Dataset tab ..........................................................................Working form ... 51 4........................... Licenses view . 54 Figure 28 ....Passing Information between Forms ...............1 .......Graphs ........................3 ...................................................................4 ..........1........William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Figure 24 ........................6 ................................................. 56 4.................. 60 5...................Genetic Algorithm Implementation .......................................1........ 58 5.............4 ...............Data Parser Implementation ..............About Form ......Genetic Algorithms ..................................................................... 62 Page 5 of 225 ...................... 57 5 .......

....1 ...3......................................... 63 5..William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 5......... 65 5.......................Comparisons .......................................................................... 64 Figure 33..................................1 ...........................4 ...Back-propagation and Genetic Algorithms ..........Back-propagation .............1...................Back-propagation .........2 .........................Virus Classification ...2..............Genetic Algorithms ........Number of iterations to achieve target (Iris data) ................................ 64 Figure 34.........1........Graphs .......1 . 68 6......2... 66 5.................................................................................3.....2 .......................XOR ..............2 .................................................................................Mean squared error at testing (Viruses).............................Genetic Algorithms .................. 64 Figure 32 .Graphs ....................................................................................3 .....The mean squared error at testing (Iris data) ...............................................1 ........................... 68 6............... 69 Page 6 of 225 .........................Mean squared error upon last training test (Iris data) .....Fishers Iris Data ...............3 ................................Number of iterations to achieve target (Viruses) ........................................Cascade Correlation . 67 Figure 36 ...............3 ............Virus Classification..............4 ................................. 63 5...........Cascade Correlation .... 68 6 ................................................Fishers Iris data........................ 66 5..................... 67 Figure 37 ...........................3. 68 6...............2 ....................................1........................................... 66 5...................................................................................................... 69 6...................................................................... 69 6..............2..2 ............................................................................................................ 65 5....3 ..... 63 5............................................................Cascade Correlation and Genetic Algorithms ......................................... 63 5...........2...................... 67 Figure 35 ...........................Mean squared error upon last training test (Viruses)..3.......................

........ 209 9.................. 174 9.....1......................................Datasets............................................................................1 ..................................................................Possible Improvements ......................................................1 ................................................................................How many of the original objectives were achieved? ...................................... 109 9......................................2 ............................................2..........................................Possible User Interface Improvements .................................................Fishers Iris Data ............... 73 9 ............ 69 6..............................................................XOR .................................................................UML Class Diagram..................................3 ........... 73 8...............................................................DLL Wrapper for FANN functions .................................. 70 7 .......................Source code ................... 70 7...Model .Virus Classification.... 207 9.............................William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 6........................... 158 9................................ 210 10 ....... 71 8 ........................................................................................ 74 9.........................View ............................................................................Controller .............................. 74 9............5 .................................................................................................Possible Training Algorithm Improvements ........2.Libraries Researched ....4 ........2 ...1....2 ..............4 .............Appendices ...................Bibliography......1...........Objectives ...............................................................................3 ..........3 ............................................3 ... 204 9.................2 ...................1 .....................................................2....... 214 Page 7 of 225 ................................... 75 9..................... 70 6...Testing conclusions ..................................1 ................................. 211 11 .....................Works Cited ...... 72 8.................... 69 6......................................Evaluation ..........1 .....................................................................1.......................................

.............Table of Equations ..................3 .............Tables ................................Table of Figures ............................ 217 12...........2 ........ 217 12......................Diary..................................................................................................... 222 Page 8 of 225 ............William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 12 ............................................................. 220 13 .............................................................................................................. 219 12...................Table of tables .........1 ..................................................................

.............. Page 9 of 225 ....... the work described within this project is the result of the investigation carried out by myself.......................... ………………………………. has been submitted in candidature for any other award other than this being presently studied.................William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 STATEMENT OF ORIGINALITY SCHOOL OF COMPUTING DEGREE SCHEME IN COMPUTING LEVEL THREE PROJECT This is to certify that....................... Any material taken from published texts or computerised sources have been fully referenced................... Student Name (Printed) Student Signature Registered Scheme of Study Date of Signing ……………………………….............. and I fully realise the consequences of plagiarising any of these sources.. nor any part of it............. except where specific reference is made. ………………………………. ………………………………...... and that neither this project.

Neural Networks Neural networks are networks of small-specialised units that sum the products of their inputs and the weights on those inputs. compare and contrast three common learning algorithms that are applicable to neural networks.Introduction The purpose of this report is to bring to a conclusion my final year project on neural networks and genetic algorithms.1. Although they are simple in concept.1 .The Biological Neuron The human brain is composed of many millions of nerve cells called “Neurons”. 2. Figure 1 . on the course “Computer Games Development”. This report encompasses design.Research 2.A human neuron Page 10 of 225 . Neurons do not make decisions alone.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 1 . development and final prototyping of the program developed for this project.1 . they can produce immensely complex results. the report will investigate. but in combination with a network of other neurons within the brain. In addition. 2 .

Axon branches can connect to other types of cells also. (Barber. 1. Concerning inputs from the dendrites. This action potential extends down the axon to the cells at the end of the axon branches (often synapses connecting to other neuronal cells. Axon branches connect to synapses to form the neural networks within the brain. in order to allow the brain to control cells external to the brain. In the case of the axon branches connecting to synapses that are part of a second neuron. a summing function.1. 2004). the nucleus of the neuron cell processes them and produces an output. Page 11 of 225 . AI: Neural Network for Beginners pt.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 A neuron is composed of a cell body. in this gap between neurons chemical reactions take place that will inhibit or excite the signal. a synaptic gap occurs between the axon branch and the synapse.The Artificial Neuron In order to construct an artificial neuron we need a way of representing the same model in data structures and algorithms. a number of weights associated with those inputs. as mentioned above).2 . the nucleus will generate an “action potential”. If the inputs from the dendrites to the neuron nucleus when summed are past a certain threshold. (Bourg & Seeman. 2006) 2. an activation function and a method for representing an output – either to another artificial neuron in the next layer. or to another part of the program. with extensions called “Dendrites” which are the neuronal inputs and a single extension called an “Axon” which is the output for that neuron. The usual method for approaching this is to have a number of inputs. The axon and dendrites both split before terminating into “Axon branches” and “Synapses”.

The activation function accepts this stored value. a differentiable function of some kind (such as a sigmoid function) which will output values between zero and one depending on the value of the inputs is another possibility.Summation of the inputs and weights The next stage depends on the activation function chosen. Alternatively. Page 12 of 225 . or one (activated) if the summed products are above a certain value. A stepping function can be used which will output zero (or non-activated) if the summed products are below a certain value.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Figure 2 .An artificial neuron The system devised with these components is as follows. real number. ℎ = × ℎ Equation 1 . The product of the data item and its associated weighting is then stored before the summation of all the data items and associated weights occurs. A specific input accepts a data item (usually a binary digit. or integer).

In this example “y” is the function output and “t” is the function input. contributed to the ideas that underpinned early neural network research.2 . (Bourg & Seeman.6 0. Page 13 of 225 . 2004). AI: Neural Network for Beginners pt. Frank Rosenblatt developed the perceptron model then. (Barber.2 0 -6 -4 -2 0 2 4 6 Figure 3 .2 1 0.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 1. McCulloch and Pitts formulated the first neural network model which featured digital neurons but the neurons had no capability to learn (McCulloch & Pitts. however he was unable to come up with a reliable mathematically accurate mechanism for allowing multilayer perceptrons to learn (Rosenblatt. as defined in the graph above.4 0.The sigmoid function shape = 1 1+ Equation 2 . in 1958. 1. 2006) 2. 1943). William James and others. 2004). the work of 19th century psychologists such as Freud.A sigmoid function (Bourg & Seeman.8 0.The History of Neural Networks The foundation of neural network research are in psychology. 1958).

Back-propagation allows for the training of multilayer perceptrons and in particular.1 . where “n” is an undefined number.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Two layer perceptrons were the subject of several experiments to determine their usage and effectiveness. (Blum. 1992). The next major advancement in neural networks was not until 1974. 1982)). when Werbos (Werbos. A good example of this is that neural networks have been implemented to run on architecture originally designed for processing three dimensional computer graphics.3 .Advantages Neural networks make possible or practical many things that with conventional solutions would be extremely difficult. used on this architecture they become an extremely fast as well as flexible tool. 1974) discovered the back-propagation algorithm (independently rediscovered by Parker in 1982 (Parker. One of the benefits of neural networks when compared with other problem solving techniques in that they are inherently parallel and thus can run very effectively and efficiently on parallel hardware. 2. of “n” nodes. The individual neurons in a neural network have no time dependencies on each other and each can therefore be run on a separate processor (or as separate threads on a single processor) if desired without causing the problems often associated with such parallelism. perceptrons with “n” hidden layers. taking Page 14 of 225 . Parker discovered it independently in 1982 whilst performing graduate work at Stanford University in the United States of America and called it “learning logic”.Advantages and Disadvantages of Neural Networks 2.3. Werbos discovered the algorithm whilst working on his doctoral thesis in statistics and called it “dynamic feedback”.

William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 advantage of the massively parallel architecture of this hardware and the programmable sections of the graphics pipeline (vector and fragment shaders) to produce extremely fast neural networks (Davis. 5 Build a system that incorporates what we have learned. Neural networks can excel at determining what data in a particular set is relevant. where explaining why you have arrived at a particular diagnosis is an important part of the process. 2001).3. 2 Formulate a statistical model. This is a large disadvantage in areas such as medical diagnosis. We can simply present the neural network with all the data as opposed to following the circuitous and overly complex (by comparison) statistical approach demonstrated in “Table 1 .The statistical approach to deciding relevant data Another advantage of neural networks is that noisy data is not a real problem for them to learn to interpret. to attempt to provide a more robust post-training network. 1 Decide on relevant data. Page 15 of 225 . When using a neural network there's no need to establish before attempting problem solving which data is relevant. 3 Run the formulated model.2 . 4 Analyze the results. Table 1 .Disadvantages One disadvantage to neural networks can be that it is very difficult for a human being to analyse a trained neural network and describe why it may come up with one answer over another. noisy data is utilised during training upon occasion. 2. in fact. as irrelevant data will simply end up weighted so that it has zero or close to zero actual effect on the solution produced by the network.The statistical approach to deciding relevant data”.

the network had trained itself to recognise whether the sky was cloudy or not. Fifty pictures of each set were set aside and the neural network trained with the remaining one hundred images with and without tanks. requires largely heuristic construction and preparation. The US military then tested the neural network with a further set of one hundred images. for obvious purposes. there is no formal methodology with which to choose the architecture. The training times on neural networks can also be a disadvantage. although the length of time the problem would take to solve without employing a neural network must be taken into account when deciding how much of a disadvantage.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Once a neural network’s training is complete it is hard to tell why it is coming up with a particular solution. They collected one hundred images with a concealed tank. or even to verify the quality of the training. only to find that on this round of testing. then a further one hundred images without. A tool used to solve heuristic problems. with and without tanks. the US military wanted to use a neural network to analyse images and determine whether they contained a concealed tank. A classic example is that in the 1980s. asked to differentiate between the two sets of pictures. Page 16 of 225 . All the photographs with tanks were from a cloudy day and all the images without. a sunny day. they tested the network with the remaining fifty images that the neural network had not seen before and the neural network correctly identified most of the tanks. After the neural network’s training was complete. Eventually the original data set was re-examined. Therefore. When using neural networks is that. the network came up with apparently random answers. it can also be hard to tell how well (or how badly) trained a neural network is. train the neural network.

The real strength of neural networks. or it does exacerbate the problem with the time spent training the neural network.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Another possible criticism is that neural networks are extremely dependant on the quality and content of the original training data set. the more accurate and in line with expectations and desires. in the opinion of the author. Data sets for training neural networks generally separate into two sub-sets. Testing may then take place with the “testing” set to determine accuracy with unseen data. the usual best approach is to simply feed them as much data as can be obtained. 2.Neural Networks in Medicine There is a large amount of research now covering the applications of neural networks in medicine. One of the main research areas is using neural networks to recognise diseases/conditions via scans. Fortunately since neural networks are (as has been mentioned above) good at ignoring irrelevant data. This is generalisation and it is far more useful than it at first appears and similar from a very high-level perspective to how the human brain and brains in general function. This drawback is however one that is generally universal to computing (and many other areas) often referred to as “GIGO” or “Garbage in. covering as many relevant situations as possible. Page 17 of 225 .4. The more time spent training the neural network on quality data sets. lies in their ability for generalisation. Neural networks make it more apparent however because (as in the previous US Military example) it can be difficult sometimes to decide what constitutes good data.1 . the eventual result will be. Garbage out”. this has to be done within reason however.Current Applications of Neural Networks 2. “training” and “testing”.4 . The network training first takes place using the appropriate “training” set.

being good at analysing patterns and predicting future trends.Neural Networks in Business Neural networks.4. a clear problem with this approach is that when using a neural network it would be difficult to tell how a neural network reached its conclusion. 1997) Page 18 of 225 . can fit very well into most business situations. In the 1980s. merely a variety of scans covering all possible permutations of the disease or condition. for example the human cardio-vascular system. research on using neural networks to diagnose diseases took place.2 . You can also use the technology to model parts of the human biological system in order to better understand it. and assessing borrowers have all incorporated neural networks as an integral part of the system.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 This is particularly suitable work for neural networks because you do not need perfect examples of how to recognise the diseases and conditions. The main reasons for using a neural network to model the human cardio-vascular system are that a neural network is capable of adjusting itself to be relevant to a particular individual and also to adapt by itself to changes in that individual. 1997) 2. (Stergiou & Dimitrios. However. mortgage screening. Credit scoring. (Stergiou & Dimitrios. A back-propagation neural net is integrated with the airline marketing tactician which monitored and recommended on booking for each flight. Businesses have used neural networks in the past for applications such as assisting the marketing control of airline seat allocations in the AMT (Airline Marketing Tactician). thus supplying information more or less directly linked to the airlines main income.

3 . (relatively speaking) involving the following steps (Robot Control. 1999) 2. A neural network allows the robotic arms to be very flexible in their operation and perform self-adjustments as time goes by. The position. Calculate the joint angles required for the arm to be in the appropriate position. When a robot arm is one hundred percent accurate that is a simple task. 2008): • • • Determine the target coordinates relative to the robot.4. (Marshall & Srikanth. When controlling manipulators a neural net must deal with four major problems (Robot Control.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 2. compensating automatically for wear and tear on Page 19 of 225 .Object Trajectories Predicting the trajectory of an object in real time is another area where neural networks have been utilised. 2008): • • • • Forward Kinematics Inverse Kinematics Dynamics Trajectory generation The ultimate goal of course is to position the “effecter” (I.4 .e. a robotic hand or any other similar manipulator) in the appropriate position to grasp or otherwise manipulate an object or part of an object.Robot Control Controlling manipulators (such as robotic arms in a car manufacturing plant) is usually how robotics and neural networks connect. Adjust the arm to the appropriate joint angles and close the effecter. velocity and acceleration of the object being estimated in those implementations by several neural networks using several of the most recent measurements of the object coordinates.4.

5. The advantage of using a function like this is that it allows us to differentiate how close we came to the correct result. allowing us to apply our learning algorithm.3. The sigmoid function is in the source code at 9. A commonly used function is the sigmoid function as described in section 2.Back-propagation 2.1 . This is far preferable to having to perform lengthy and expensive re-calibrations on any regular basis (Robot Control.Back-propagation in depth In a single layer neural network (or with a single node) the perceptron rule is applicable.2 . Page 20 of 225 . This rule essentially describes adjusting the weight using the difference between the expected and actual outputs. training by back-propagation involves the steps: • • • • • Present a set of training data Compare the network’s output to the desired output at each output neuron and calculate the error. 2008).cs” lines 130-133.Back-propagation overview In essence. Adjust the weight of the output neurons to lessen the error.5 . In order to use a back-propagation training algorithm you must have a non-linear activation function for your artificial neuron.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 themselves. the disadvantage of a differentiable function is that it is by the use of these functions that local optima become apparent in the search space. based on the strength of the weights connecting them to the output neurons. 2. Adjust the weight of the neurons to minimise the responsibility.2 -The Artificial Neuron.1.1 -“Network.1. Assign responsibility to each of the neurons in the previous level.5. 2.

The other two values “di and yi” are the actual and desired outputs. 2002) Calculating the hidden layer deltas is a little more complicated. such as the sigmoid function (see 2. ℎ : = [1 − ] .Altered delta calculation rule for the output layer (Matthews. respectively. = 1− Equation 4 . Back-propagation for the Uninitiated.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 ∆ = ℎ = − . Back-propagation for the Uninitiated. 2002) In this equation “w” and “x” are as before. Provided you are using a differentiable function. Back-propagation for the Uninitiated. Page 21 of 225 . The sigmoid function differentiates very neatly. “n” is the learning rate of the neural network.Altered perceptron learning rule (Matthews. 2002) However. Back-propagation for the Uninitiated. the output layer nodes training function can be written as: = 1− − Equation 6 . 2002): ∆ = ℎ = − Equation 5 .differentiated sigmoid function (Matthews. this rule has no positive effect in a multi-layer neural network. Back-propagation for the Uninitiated. as the effect that the change in the weight will have on the rest of the network is a missing factor. 2002) Therefore. The effect that the change will have on the following neurons in the network is an extra factor. the following alteration to the perceptron learning rule would serve our purposes (Matthews.2 -The Artificial Neuron) an alteration can be made to the perceptron learning rule allowing this difficulty to be overcome. Assuming the sigmoid activation function is in use.1. Equation 3 – The delta rule (Matthews.

6 .3 . 1859) Page 22 of 225 . against which to compare the genetic algorithm trained neural network. it is fast.3 -Libraries Researched) for other libraries investigated) implements a back-propagation solution and this library will be used in the project to implement a feed-forward back-propagation neural network.Genetic Algorithms Genetic algorithms attempt to copy natural laws to a certain extent in order to apply a random search pattern to a defined search space.The FANN neural network library (Nissen. open-source (allowing me to alter it if I needed too. FANN) The FANN library (see (9. The FANN library was decided upon for several reasons. although as it turned out I did not). to calculate the delta for a hidden layer requires the deltas for the following layers. By using similar techniques to natural selection. Back-propagation for the Uninitiated. Most organisms evolve by means of sexual reproduction and natural selection (Darwin. in order to apply this learning mechanism you start at the output of the network and work your way towards the inputs. it is possible to “breed” solutions to problems. 1859) very neatly avoids one of the larger problems involved in software design: how to specify in advance all the possible permutations of the original problem and how the program should react to those permutations.Altered delta calculation rule for the hidden layer(s) (Matthews. 2.5.Back-propagation library 2. in a language that can be linked to C# fairly easily and it also supports cascade neural networks. easy to implement.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Equation 7 . Therefore. Natural selection (Darwin.7 . 2002) As demonstrated above. 2. saving me finding a separate library.

genetic Page 23 of 225 .7. although this technique involved no crossover. this application was largely theoretical. At first. swapping genetic material. Mutation plays a part in this as well. Also in 1975. mostly designed to help evolutionary biologists’ model aspects of natural evolution. In 1965 one Ingo Rechenberg. During the process chromosomes line up together and then cross over partway along their length. many researchers had independently developed evolution-inspired algorithms for function optimisation and machine learning but did not get much follow up to their work. during this process. selection and crossover. across a range of subjects. occasionally causing the genetic information. including noisy and discontinuous data. This could result in either an effective or defective solution.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Sexual reproduction ensures mixing and recombination of genes. built on papers both by himself and by other researchers. This book presents the concepts of adaptive digital systems using mutation.1 . by the author John Holland. then of the technical University of Berlin introduced a technique he named evolution strategy. to alter slightly in a random way. or indeed multiple genomes in a population.History of Genetic Algorithms Genetic algorithms first appeared on computers in the late 1950’s and early 1960’s. By the early 1980s. this mixing leads to much faster evolution than if off-spring simply copied the genetic material as it is in the parents. a dissertation by Kenneth De Jong established the potential of genetic algorithms by showing that they perform well on a wide variety of data. 2. the publication of the book “Adaptation in Natural and Artificial Systems” occurred. In 1975. simulating processes of biological evolution. however. but this variety helps to prevent stagnation in the gene pool. By 1962. genetic algorithms were becoming more widely used.

proceeding with other more likely candidates. a genetic algorithm is implicitly evaluating a much larger group of individuals. Genetic algorithms effectively explore many different branches of the tree at once and when a certain branch turns out to be non-optimal.7. 2004). abandon that search. can be used to fairly accurately predict national trends. Many other algorithms are largely serial and can only explore a search-tree so far in any one direction before abandoning all progress and starting again from the beginning.2. This is “Schema Theorem” and allows a genetic algorithm to move towards the searchspace with the most promising individuals in a timely fashion and then select the best member of that group (Marczyk. they are very well suited as a means of exploring search spaces too large to be effectively searched in a reasonable amount of time by other.7.Advantages The primary advantage of genetic algorithms is their inherent parallelism. The real advantage of parallelism however is that by evaluating the relatively small search-space that it does.2 . or further up the hierarchy. (Marczyk. in the same way that the average response of a relatively small percentage of the population of any given country.Advantages and Disadvantages of Genetic Algorithms 2. This leads to the exploration of a large proportion of the search space.1 . with processing power exponentially dedicated to better areas as the exploration progresses.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 algorithms soon moved into commercial territory and nowadays help solve many problems in many different areas. more conventional. methods. Thanks to the parallelism that is a genetic algorithms main advantage. 2004) 2. These are “non-linear” Page 24 of 225 .

Genetic algorithms have no prior knowledge about the problem they are trying to solve. crossover allows promising solutions to share their success and mutation allows random changes in the local search space of a given solution. the random nature of the various starting points of the initial population and the other methods they employ. 2004). Selection allows the pruning of the least promising searches. In infinite or very large search spaces. A good example of this is the concept Page 25 of 225 . each searching their own space for the best solution. Without crossover. it is hard to know whether we have reached the global optimum. due to their strength in navigating large search spaces (Marczyk. In a linear problem. they produce random changes to their candidates and then use the objective function to determine whether those changes are positive or negative overall. A third advantage of genetic algorithms is that they do not tend to be easily trapped by local optima. This allows them to discover solutions that other algorithms may have over-looked. they tend towards non-linearity where altering one component's fitness positively may make other components less fit and cause a ripple effect across the whole system. or never contained in their search space in the first place. due again to the parallelism of their approach.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 problems. each component’s fitness is individual and any improvement to individual component's fitness is necessarily an improvement to the whole. such as crossover and mutation. or merely very good local optima. However. Many real life problems are not like this. selection and mutation a genetic algorithm is metaphorically similar to a large number of parallel depth first algorithms. This non-linearity results in a huge increase in the search space. making genetic algorithms an effective way to search them. One of the largest strengths of genetic algorithms can at first glance appear to be their largest weakness. genetic algorithms tend to give good results compared to other search strategies.

the global optima is at the far right. there is no slope leading to it. 2004). or real-valued numbers. the system will never converge towards a suitable solution. Likewise. therefore no gradual increase can lead you to it. If the mutation is too high. Generally.2. then genetic algorithms (and most other search techniques) are no better than a random search for finding the solution. 2004). etc. if the solutions to various problems are in areas of the search space that the fitness function would not consider likely. Page 26 of 225 .William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 of negative feedback. Another method is to use genetic programming. with each number representing some distinct part of the solution (Marczyk. rediscovered by genetic algorithms. For example in the diagram below. or adjust them. A second disadvantage of genetic algorithms is that the fitness function is crucial to the development of a suitable solution for the problem. 2004). the genetic algorithm may end up solving an entirely different problem from the originally intended one. however if it is too low. genetic algorithms use strings of binary. integer.2 . a comparatively smaller segment of the search space will be covered and the eventual solution may take longer to reach or never be reached as a result. A third issue is setting the correct mutation rate. but denied a patent for several years because it ran counter to established beliefs (Marczyk. if the size of the population is too low. population size. the investigation may cover too little of the search space to find the optimum solution (Marczyk.Disadvantages One of the disadvantages of a genetic algorithm is the necessity of representing the problem the genetic algorithm is trying to solve. A further problem is that fitness functions can be deceptive. where the actual code of the program forms the genomes in the genetic algorithm and it can swap portions in or out. in a form that the genetic algorithm can use.7. 2. however that is only one point. If you have a poorly written fitness function.

Finally.local optimum (units are undefined in this case). 2004). unless by random chance it discovered the point with the most optimum solution. including sigma scaling and Boltzmann selection (Mitchell. local optima in the centre of the diagram. There are various methods for solving this. 900 800 700 600 500 400 300 200 100 0 0 2 4 6 8 10 12 Figure 4 . A further problem is premature convergence: this occurs when a mutation early in the process produces a large leap in the fitness of that particular genome. but altogether easier to find. which will then reproduce abundantly. This is because analytical solutions usually produce more accurate results faster than a genetic algorithm (or any heuristic method) is capable of (Marczyk. lowering the diversity of the population and resulting in genetic algorithms possibly falling into the local optima that the mutation represents. In this example a properly constructed genetic algorithm would be likely to settle on the marginally less optimal. 1996).William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 you either have the solution or you don’t. Page 27 of 225 . where analytical solutions exist they should be take precedence over genetic algorithms.

8 . 1995). In addition. the only information genetic algorithms require to train a neural network is an objective function (as described in 2. to test the appropriateness of a given genome.2 . a neural network representation within a genetic algorithm is a concatenation of all the weighs in the neural network. since you are merely increasing the size of the genomes being worked with.Training Neural Networks with Genetic Algorithms Training neural networks is a form of problem solving. not altering them besides that in any way. 2.Representation of a Neural Network within a Genetic Algrithm As a rule.Determining Weight Values with Genetic Algorithms Genetic algorithms (as described in 2. Genetic algorithms also have the benefit that they do not place any restrictions whatsoever on the architecture of the neural network. however.8. 1992). Page 28 of 225 . however the method of choice for training neural networks is usually back propagation (see 2.1 . 2. The error surfaces associated with these problems tend to be highly variable and contain many local optima. these are not a complete solution (Blum.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 2.5 -Back-propagation) which is a gradient descent algorithm and as such can be easily trapped in local optima (Branke.7 -Genetic Algorithms). There are methods to try to avoid this problem when using back propagation.7 -Genetic Algorithms) are good at avoiding being stuck on local optima due to their searching several regions of search space simultaneously. such as adding a “momentum” to the algorithm.8. to try to help it move beyond local optima. involving finding the optimum values for a set of real numbers (connection weights) which will produce the least error in the results from the neural network.

Using Genetic Algorithms to Determine Neural Network Structure As well as using a genetic algorithm to evolve the weight set for a fixed-structure neural network. outputs to inputs. Page 29 of 225 . but is less likely to do so for genes close together.8. it is also possible to use a genetic algorithm to evolve a structure for a neural network. Standard genetic algorithms use binary strings. one or two hidden layers of an indeterminate number of nodes and one output layer. a nodes input weights and the nodes of a layer. One of the most important decisions when deciding how to represent a neural network within a genome is whether to use binary strings or real number strings. 1995).3 . These are all connected.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Crossover can disrupt genes far apart. can lead to very large strings (thousands of bits) (Branke. to form a feed forward network. Because of this it is helpful to keep functional units close together (I.e. 2. The average neural network has an input layer. side by side). place a neurons input and output weights. The problem at hand dictates the input and output layer structures. however representing a large number of real valued numbers as a binary string.

the neural network will never learn to solve the problem (or come close enough to suggest a solution). a neural network topology to deal with that problem. a neural networks generalisation is its main strength and therefore you do not wish to lose it. the neural network will learn fast but will generate too specific a solution and will not generalize between similar inputs. If neural network architecture is too simplistic for the problem at hand. However. if the neural network architecture is too complex. As mentioned in section 1.0. Page 30 of 225 .A feed-forward neural network This architecture is then altered (number of nodes in each hidden layer.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Figure 5 . given a specific problem. there is currently no method by which to establish. There is also no method to check how optimal your solution is (Branke. number of hidden layers) by trial and error and intuition to establish a neural network that performs well for the problem at hand. On the other hand. 1995). this is not necessarily the most efficient form for a network for any given problem and the trial and error method is an inefficient method for determining the correct architecture for an optimally performing neural network for the problem at hand. Although network architecture plays such a large role in network performance.

3. thus eliminating the searching of meaningless space and by definition. 1995).Representing neural network structure Representing the structure of a neural network within a genetic algorithm is not as straightforward as representing the weight values of a neural network within a genetic algorithm. being able to contain the most optimum solution for the problem at hand.8. There are two methods for representing neural network topologies within a genetic algorithm. Page 31 of 225 .William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 2. thus meaning that in order to remove a node completely. 1995). the network is divided into areas and for each area the number of nodes and the density of connections to other nodes is determined (Branke. the genetic algorithm represents the neural network by means of its connections. In direct encoding. a representation is required which can accommodate all networks that will work for the problem but none that will not. In cases where a genetic algorithm determines the number of hidden layers and the number of nodes per hidden layer and the network itself is interconnected fully. In one version of high level encoding of a neural network. the strong. whereas high-level encodings group together connections and/or nodes. or high-level encoding (Branke. you must remove all connections to or from that node completely. indirect. direct. Back propagation learning rate is also a parameter for one of these areas. Ideally.1 . Low-level encodings specify each connection individually. an exception is possible. or low-level encoding and the weak.

and the moving target problem (Fahlman & Lebiere. The algorithm attempts to solve the issues associated with back-propagation that produce slow learning. This section largely drawn from information in: “Curved trajectory prediction using a self-organizing neural network” (Branke.2 neural networks that are too large will solve a problem fast but will not generalize well and therefore their usefulness is limited severely. Neural networks that are too small on the other hand. 1991). it is impossible to know whether these large and complex networks may be the most suitable way to solve the problem at hand. This can lead to human bias entering the system and affecting the outcome. This could be useful. These mapping methods are therefore more suitable for small networks or networks with a small number of connections. Page 32 of 225 . These are the Step-size problem.9 . a balance between speed of learning and generalisation exhibited in the trained network is necessary. Therefore.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 One of the reasons why alternatives to low-level encoding arose is the exponential rise in the number of connections. will not ever succeed in learning the problem. 2.Cascade Correlation The cascade learning architecture is a method by which the training algorithm builds the neural network as it proceeds. 1995). As mentioned in section 5. A problem with high level encoding is that regular networks are favoured but not every network is equally probable. as the size of the neural network increases. which is obviously undesirable. The Cascade-Correlation Learning Architecture. by limiting the potential size of the networks evolved and preventing the generation of overly large and complex networks but on the other hand.

The definition of 's' given that 'o' is the network output at which the error is measured. or sometimes the quick prop rule (Fahlman. 1988). 'p' is the training pattern. The Cascade-Correlation Learning Architecture.2 -Back-propagation in depth). either an extra node is added. the partial derivative of "s" with respect to each of the candidate unit’s incoming weights "wi" is a necessity. or if the networks output is of sufficient quality the training is ended. The “candidate” nodes take the neural net inputs.5. 1988). = −` −` . with a value of one. An Empirical Study of Learning Speed in BackPropagation Networks. the residual output error at “o” (Fahlman & Lebiere. The connection between each input and output is via an adjustable weight. with the aim of getting as close to a solution as possible. It then trains the adjustable weights using the perceptron rule (as described in 2. the initiation of a number of “candidate” units takes place and trained using either the perceptron rule (2. If a trigger occurs for the addition of a unit. 'v' is the candidate unit's value. the quantities ‘`v ’ and ‘`Eo’ are the values of v and Eo averaged over all patterns (Fahlman & Lebiere. The output units may use either a linear or differentiable activation function.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 The system begins with a basic neural network of inputs and outputs (numbers of each dictated by the task as usual) and no hidden layer. plus the outputs of any previously created units. In order to maximise "s". Equation 8 . 1991). the candidate unit’s value. An Empirical Study of Learning Speed in Back-Propagation Networks. After a number of training cycles pass with no substantial improvement (the precise number being determined by a user-supplied “patience” parameter). There is also a bias input. Page 33 of 225 . and “Eo”. and attempt to maximise “s” the sum overall output units “o” of the magnitude of the correlation between “v”. The Cascade-Correlation Learning Architecture.2 -Back-propagation in depth) or the quick prop rule (Fahlman.5. 1991).

Page 34 of 225 . The training iterations for these adjustable weights in the main network then continue. or the completed training epochs reaches a maximum level. = . −` ′ . Equation 10 . Expansion and differentiation of this calculation can then take place.The partial derivative of ’s’ (Fahlman & Lebiere. ‘f'p’ is the derivative for pattern 'p' of the candidate unit's activation function with respect to the sum of it’s inputs and ‘Ii. a gradient descent to maximize "s" can take place.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Equation 9 . The Cascade-Correlation Learning Architecture.p’ is the input the candidate receives from unit ‘i’ for pattern ‘p’.The partial derivative of ‘s’ with respect to each of the candidates incoming weights ‘wi’. After these computations are complete. . The connection of the best of the candidates to the neural network as it stands takes place. Once the correlation on a candidate has reached an acceptable level. and the inputs for that node are frozen. where ‘oo’ is the sign of the correlation between the candidates value output ‘o’. Adjustable weights link the outputs for this node and all the output nodes inputs. 1991).

1991) Cascade-Correlation 1991).The second state of a cascade correlation neural network. 1991) Cascade-Correlation 1991). The Cascade Correlation Learning Architecture.The initial state of a cascade correlation neural network.William Sayers 05025397 Genetic Algorithms and Neural Networks Neural Milestone 3 Figure 6 . The square econd connections are locked weights (Fahlman & Lebiere. A first node has been added. Page 35 of 225 . Figure 7 . The Cascade Correlation Learning Architecture. The circular connections are adjustable weights (Fahlman & Lebiere.

1991).The third state of a cascade correlation neural network. The Cascade-Correlation Learning Architecture.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Figure 8 . Page 36 of 225 . with two nodes added (Fahlman & Lebiere.

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3

2.10 - C# User Interface Programming
C# uses the Winforms API to create user interfaces. It allows you to “draw” objects on a form in a visual manner to design your layout and then access and alter properties and subproperties of those objects in your programming code. A separate thread for each Window in Winforms exists, in order to facilitate performance on modern multi-core machines, although it does make it more difficult to move data between the forms. A method using “delegate functions” (similar to “function pointers” in C++) and “events” (Lysle, 2007) is the method I will use. Another challenge is making the neural network training independent of the user interface, in order to avoid the interface freezing whilst training a neural network. The solution I plan for this is to use the background worker object provided with C#, which allows you to assign a delegate function to be your background task, and will trigger events upon completion, for which event handlers will be executed (Microsoft, BackgroundWorker Class, 2009). Making a C# user interface interact with C++/CLI dll’s simply involves adding a reference to the dll in your project, via the Visual Studio® user interface.

2.11 - Writing C++/CLI Wrappers for Unmanaged C++ code
The cleanest method of connecting a native C++ or C dll or piece of code to a managed C# interface is via a C++/CLI bridge class. The VC++ compiled can swap between managed and unmanaged code on the fly whilst compiling and allows you to have both managed and unmanaged code (in C++) as part of the same project. Thus, a managed class can communicate with the unmanaged class (performing appropriate marshalling of the non-primitive data types (Microsoft, Using C++ Interop (Implicit PInvoke), 2009)) and the C# code can then access it directly.

Page 37 of 225

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3 Although it is possible for a C# program to interact with an un-managed dll directly, this method is less error-prone and more likely to be robust and stable, as well as making for cleaner code.

2.12 - Application of Research
The research presented here will help to produce the deliverables for milestone two and milestone three of my final year project: I plan to combine C# for the user interface and C++ for the neural network back-ends in order to create an efficient, powerful and fast solution. Section 2.11 -Writing C++/CLI Wrappers for Unmanaged C++ code, covers the combination of C# and C++ so I will not bother to cover it here, I plan to use the DLL method, with one DLL combining managed and unmanaged C++ linked into my C #user interface code. The user interface will then have methods to adjust parameters such as the genetic algorithms population size, number of generations, etc. In order to test and see what kind of genetic algorithm learns and develops fastest. It will also allow you to specify the number of back-propagation iterations. The use of this application will be in evaluating the difference in performance between a genetic algorithm, back-propagation algorithm and cascade correlation algorithm as neural network training algorithms.

3 - Design
The purpose of this application will be to allow the user to run a back-propagation trained neural network, or a genetic algorithm trained neural network and present the results of the network in such a fashion as to allow analysis and comparison of the training methods and their suitability in different situations.

Page 38 of 225

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3

3.1 - Program Requirements
The program must be able to: • • • • • • Run a genetic algorithm on a feed forward fully interconnected neural network to train the network. Run a back propagation algorithm on a similar network to train the network. Run a cascade algorithm on a similar network to train the network. Allow the user to set appropriate variables (see 3.4.2 -New Network Wizard) to adjust the execution of the learning algorithm selected for the neural network. Allow the user to select which learning algorithm they wish to use. Display the results of running that algorithm on a neural network in a meaningful fashion.

3.2 - Design of the Class Structure
Before I discovered a simple to program and effective design, I tried and discarded two designs. I eventually used the third design and it is that third design documented here. The two prior designs to this involved representing neural networks via objects and compositions of objects in vectors, which lead to flexible, but slow and overly complex code upon experimentation. The final solution, the solution documented here, is a far simpler one (in terms of the neural network representation, it is far more detailed in the other areas than the initial designs were). This solution loosely follows a model, view, controller architecture. The solution enables easy replacement of sections of code as long as the interfaces and outputs remain the same. For more information on the class structure, see section 9.2 -UML Class Diagram.

Page 39 of 225

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3

3.3 - Linking C# code to managed dll’s
Linking C# code and managed dll’s is a simple process (in Visual Studio) as explained in (2.11 -Writing C++/CLI Wrappers for Unmanaged C++ code) of selecting the references section in the C# project in question and adding the dll you wish to refer too. Then you can simply add a “using” directive to use the dll namespace and create, destroy, and use the classes within as if they were native C# classes. This can be seen in (9.1.2.6 “Algorithms\BackProp.cs”) and (9.1.2.4 -“Algorithms\CascadeCorrelation.cs”) with the “using FANN_Wrapper;” directive. This is superior to the direct C# to unmanaged code linking that used in milestone two, since it makes for cleaner and thus more easily maintainable code and the code is more robust in this fashion. The robustness comes from the fact that C++/CLI is far better at interacting with unmanaged C++ code than C# is. Indeed – they can even be in the same source file and compiled into one object. Therefore, by using a C++/CLI wrapper to interface to the unmanaged C++ and then interacting with the C++/CLI wrapper/s errors are less likely to arise.

3.4 - Design of the User Interface
The construction of the user interface utilised the Winforms based tools in visual studio 2008 (see 2.10 -C# User Interface Programming). I also used the ZedGraph control (ZedGraph) to display the graph of my results.

3.4.1 - Main Form
The main form is the crux of the application (as is default in C# Winforms programming) and if the main form is closed, all other forms and classes are disposed and the application terminates.

Page 40 of 225

2 -New Network Wizard) a method to train the current network and a method to test that training. Page 41 of 225 .Network and Output tab This tab needs a method by which to initialise the adding of a new network (3. Three buttons will therefore be present.1 .Mean Squared Error Graph tab The mean squared error graph tab is a simple tab.1. along with two displays.4. Figure 9 – Network and output tab design (Main form) 3.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 3. One display will show network details and one display will show the training and testing output. which simply needs to display the graph of the mean squared error over the current epoch/generation.2 .1.4.4.

Dataset tab design (Main form) Page 42 of 225 . Figure 11 .Dataset tab This tab needs two display sections. to show the training data and to show the testing data.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Figure 10 .4.Mean squared error tab design (Main form) 3.3 .1.

1 .4. Page 43 of 225 . The user can progress through the steps via the “previous” and “next” buttons or via the tabs at the top in whatever order you choose. 3.7 Genetic Algorithms.4. It allows you to move in a logical progression through the set up process of a new neural network and associated training algorithm.5 -Back-propagation.9 -Cascade Correlation). Verification of all data takes place before the form passes control back to the main form and triggers a main form event with a parameter that takes a specially constructed class to transfer the data from the wizard. out of three choices previously mentioned (2.New Network Wizard The new network wizard is the form that appears when the user selects the creation of a new network.Network Settings tab This tab allows you to set appropriate settings for the network and training algorithm you have selected in 3. the default is genetic algorithm).2.4.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 3.4.Design of the training algorithm tab (Wizard form) 3. 2. 2.Learning Algorithm tab On the learning algorithm tab you select the learning algorithm for the neural network you are creating.2 .1 -Learning Algorithm tab (if no algorithm has yet been selected.2. Figure 12 .2.2 .

Figure 14 .4.Design of the network settings tab (Wizard form) 3.3 .3 .William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Figure 13 . or to choose custom data sets from your hard disk for training and testing data (appropriately formatted in the FANN style).Working Form The working form is merely a small display shown as a dialog (lock out access to displaying form) which shows whilst a neural network is training. Page 44 of 225 .Dataset selection tab design (Wizard form) 3.Dataset tab The dataset tab allows you either to select from two pre-setup datasets. both to protect the main form from data inputs that may cause training problems and to provide a visual indicator of work taking place.2.4.

Clicking the datasets button or the licenses button displays the appropriate information.Working form design (Working form) 3.4 . displays licensing information and displays information on the pre selected datasets.4.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Figure 15 . clicking the same button again hides that information.1 . Page 45 of 225 .4. Figure 16 .4.About Form The about form displays information about the application (author.Datasets display Clicking the data sets button displays a tabbed interface. one tab with XOR information and one tab with Fishers Iris Data information.About form design (About form) 3. project supervisor. project description).

Licenses display design (About form) 4 .Dataset display design (About form) 3.Implementation The implementation is largely in C#.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Figure 17 . Figure 18 .Licenses display Clicking the licenses button displays a small information panel with selection methods. it will display the appropriate license.4.4. with small portions in C++/CLI and the back-end FANN (Nissen. depending on your selection. Page 46 of 225 . FANN) library written in C and linked as a static library to the managed FANN_Wrapper dynamic link library.2 .

4. mostly via the visual design tools found in visual studio 2008. 4.1 .1.Network and Output tab Figure 19 .1.Main Form The main forms code is in section 9.2 -“FrmMain.1 .User Interface Implementation The implementation of the user interface is mainly in C#.cs”.1.1.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 4.Network and Output tab Page 47 of 225 .1 .1.

2 .1.1.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 4.Mean Squared Error Graph tab Figure 20 .Mean squared error graph tab Page 48 of 225 .

1.Dataset tab Figure 21 .William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 4.1.The dataset tab Page 49 of 225 .3 .

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3

4.1.2 - New Neural Network Wizard
4.1.2.1 - Learning Algorithm tab

Figure 22 - Learning Algorithm tab

Page 50 of 225

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3

4.1.2.2 - Network Settings tab

Figure 23 - Network Settings tab

4.1.2.3 - Dataset tab

Figure 24 - Dataset tab

Page 51 of 225

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3

4.1.3 - About Form

Figure 25 - About form, main view

Page 52 of 225

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3

4.1.3.1 - Datasets View

Figure 26 - About form, Datasets view

Page 53 of 225

About form.Working Form Figure 28 .3.5 .1.Passing Information between Forms Passing the data between the wizard form and the main form takes place as previously described (2.2 .10 -C# User Interface Programming) via events and delegate functions. Page 54 of 225 .1.Licenses View Figure 27 .1.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 4.4 . Licenses view 4.Working form 4.

2009).1.2 -“FrmMain.cs” lines 120-129). when instantiated. The declaration and association of a delegate and an event takes place in the form that needs to generate an event (9.3 -“Wiz1.1.2 “FrmMain. In the event handler in the main form.1. the processing of the class sent from the Wizard form takes place (see 9.Keeping the User Interface Active whilst Processing is Occurring The user interface delegates the processing to a background worker class.1. The trigger of a new event takes place in the Wizard form when you are on the last tab and the user clicks “next” (see 9.1.cs”.1.1.cs”. Page 55 of 225 . lines 306-353. (See 9. Then the runworkerasync function executes and then shows the working form.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 An event is a method of notifying a listening object that something has occurred.1. This leads to a user interface that is much more accessible (Microsoft.1. lines 29 – 31).1. are associated with a delegate function to respond to that event (Lysle. The declaration of a new event handler in the main form takes place prior to displaying the new neural network wizard form (see 9.cs”.1. 4. lines 266-281).cs” lines 70-119). BackgroundWorker Class.3 -“Wiz1.2 -“FrmMain. The two-event handling functions are at 9.6 . 2007).1.cs”. Events.1.2 -“FrmMain.1 -“NetworkUpdatedEventHandler”).1. Firstly.1. the background worker class is instantiated and supplied with the event handler references functions (see 9.cs” lines 145-163).1.1.2 -“FrmMain. The “NetworkUpdatedEventArgs” class is a storage class for passing data (see 9. lines 29-44).

2. but had issues with memory leaks and was slow.NET sort methods in the sorting part of the genetic algorithm).cs” lines 32-44).Genetic Algorithm Implementation Although the original design was to implement genetic algorithms in C++.3.1.2 -“GANetwork.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 4.2 -“GANetwork.NET built in functionality (see 9.5 “Algorithms\GeneticAlgorithm.cs that links into the .cs” lines 176204).1 .2 .1.2. FANN) which is a C programming language based neural network library.5 -“Algorithms\GeneticAlgorithm.1. and didn’t suffer from the memory leaks (being managed code) so that’s the version that exists in the application today (see 9. The compilation of the FANN library is static.cs” for the C# implementation) The main points to note in the code as it stands are: • The crossover (single-point) and mutation (random increment or decrement) implementations (see 9.1. when the C++ implementation of genetic algorithms that I wrote functioned. I decided to try re-implementing it in C#.cs” lines 51-126) 4. it was both faster than the C++ implementation (due mostly to my use of build in . Once this implementation was complete.1. The neural network specific functionality added to the network model in the network specialisation class GANetwork (see 9.2. after having used C# extensively in the UI I felt more confident about the performance loss and the use of the programming language itself. and the Dll linked to this to allow access to the functionality.3.3 Page 56 of 225 .4.Back-propagation and Cascade Correlation Implementation The FANN library implements both cascade correlation and back propagation (Nissen. • • The sorting implementation in GANetwork. Therefore. There is an unmanaged C++ wrapper (9.

layers. The inputs and weights are structures so that the coordinates for an input.2. From there. 9. number of inputs.h”. In the constructor (lines 41 – 77).1 -“Network.1. 4.1 -“FANN_Wrapper. the weights. via references to these objects passed down via the hierarchy (references are passed to avoid the necessity of passing entire strings down the hierarchy).cpp”) for the Cbased FANN functions in the DLL and a C++/CLI wrapper (9.h”.3. Page 57 of 225 . which using the data from the heading (number of epochs of data. Three jagged arrays are utilised.2 -“DatasetParser.4.1.1.1. 9. which store respectively.cpp”. into arrays of strings.1.2 -“FANN_Wrapper. followed an object-based structure (network. and the outputs.cs”) parses data directly from the rich text boxes that they’re displayed upon on the main form.4 . 9. 4.4. the separation of the textual inputs takes place. In the initialisation routines (lines 28-124).cs”). the inputs.cpp”) for the unmanaged C++ classes. C# accesses the C++/CLI class directly. these arrays form parameters for the other functions.1.4.1.4.6 -“UnManaged_FANN_CasC.Neural Network Implementation Although two previous attempts made at programming a neural network. which allows it to manipulate the FANN functions in the static library through this class.3 . number of outputs) separates the data into two-dimensional arrays suitable to be passed to other functions.h”. and nodes) the eventual implementation turned out to be basic yet effective (9.4 “UnManaged_FANN_BackProp. via a number of designated separator characters. will also be the coordinates for its corresponding weight (lines 17-19). the initialisation of all the arrays to their correct sizes takes place and then the initialisation of the weights to a random double between zero and one.4.Data Parser Implementation The data parser (9.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 “UnManaged_FANN_BackProp. 9.5 -“UnManaged_FANN_CasC.

recording took place for analysis.1 . the dataset is too small to split. to run the output layer. I tested the neural network implementation by creating a neural network with structure 2. All nodes determine their outputs using the sigmoid function (lines 130-133).02 for Fishers iris data and the virus classification data. five times for Virus classification and Fishers iris data).William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 The main functionality of the neural network class can be found in the “internal” region (lines 126-235).Testing Data Testing took place several times for each algorithm and dataset (see 9. 5. Then entered the weights from the neural network program (by means of using the visual studio debugger to check variable values) into the spreadsheet and checked that the outputs coincided. 3. The genetic algorithm and back-propagation neural networks each had four hidden nodes for each dataset. and hidden layer which are all called by the public “run()” function (lines 241-270). As the program presented the data in each case.01 for XOR and 0. so repetition is instead used. 5 .XOR In the XOR dataset. input layer. there are three functions. The target error was 0. Page 58 of 225 .4 -Datasets) (ten times for XOR. 1. and creating a neural network with a similar structure on an excel spreadsheet.

009962559 0.009157809 Table 2 .00988863 0.009162436 0.00998032 0.009248076 0.00987211 0.0099765 0.00998027 0.009157809 Testing MSqE (GA) 0.009888967 0.Genetic Algorithm testing data (XOR) 5.009969323 Testing MSqE (BP) 0.009829335 0.5 Result MSqE (BP) 0.006150786 0.009829335 0.2 .009375132 0.00988649 0.009566951 0.1 . the mean squared error from the network result and the testing mean squared error are different despite the data being the same.00992081 0.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 5.009885499 Table 3 .009962559 0.00957518 0.00999069 0.00998959 0.009566951 0.Back-propagation testing data (XOR) Page 59 of 225 .5 Result MSqE (GA) 0.00991907 0.006150786 0.00999799 0.00997699 0.00995716 0.1.009375132 0.00957518 0.009162436 0.0098402 0.1.00989974 0.00992291 0.00881867 0.00983181 0.00990161 0.Back-propagation In the back-propagation testing data. because of floating point inaccuracies converting between double precision floating-point numbers in my code and single precision in the FANN code.Genetic Algorithms Iterations (GA) 591 407 500 466 499 534 675 557 357 939 552.009248076 0.009888967 0.0099113 0.00990403 0.00881867 0. Iterations (BP) 345 287 319 327 301 323 421 315 362 325 332.

but in the case of cascade training.43545E-13 Table 4 . the network is trained more after that point (output weight training). At each node addition.00863005 0.00585159 0.00992534 0. Nodes (CC) 2 2 2 2 2 2 2 2 2 2 2 Result MSqE (CC) 0.22E-13 1.83E-13 2.008039565 Testing MSqE (CC) 7.78E-14 1.00656719 0.00573252 0.02E-13 1.0086449 0.00855044 0. which is when the program records the mean squared error.18E-13 7.99E-13 1.3 .1. the call back function triggers.00960884 0.02E-13 2.86E-14 1.14E-14 2.Cascade Correlation testing data (XOR) Page 60 of 225 .00889787 0.Cascade Correlation In the cascade correlation data.00798691 0. the testing result differs quite widely from the network result.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 5.32E-13 2.

1.Graphs 1000 900 800 700 600 500 400 300 200 100 0 0 5 10 15 Iterations (GA) Iterations (BP) Nodes (CC) Figure 29 .Number of iterations to achieve target (XOR) 0.4 .004 0.Mean squared error upon last training test (XOR) Page 61 of 225 .01 0.012 0.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 5.006 0.002 0 0 5 10 15 Result MSqE (GA) Result MSqE (BP) Result MSqE (CC) Figure 30 .008 0.

012 0.01 0.The mean squared error at testing (XOR) Page 62 of 225 .002 0 0 5 10 15 Testing MSqE (GA) Testing MSqE (BP) Testing MSqE (CC) Figure 31 .004 0.006 0.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 0.008 0.

019775896 0.2.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 5.019775896 0.Back-propagation testing data (Iris data) 5.0195853 0.0143806 0.0196297 0.019751257 0.0189456 0.Cascade correlation testing data (Iris data) Page 63 of 225 .0199918 0.2.Genetic Algorithms Iterations (GA) 1928 1834 1277 2835 8716 3318 Mean squared error (GA) 0.0199916 0.0140669 0.0143778 0.014116 0.Genetic algorithm testing data (Iris data) 5.2 .0160925 Table 7 .019751257 0.018789438 0.0158679 0.0198416 0.0199999 0.3 .0199972 0.Fishers Iris data 5.0199719 0.Back-propagation Iterations (BP) 434 529 474 391 527 471 Mean squared error (BP) 0.1 .01950238 Testing mean squared error (CC) 0.014144 0.01998996 Testing mean squared error (BP) 0.019719802 0.0141406 0.019763877 0.0199892 0.01956255614 Table 5 .0141935 Table 6 .0164964 0.Cascade Correlation Nodes (CC) 2 2 2 2 2 2 Mean squared error (CC) 0.0193595 0.019763877 0.018789438 0.2 .01956255614 Testing mean squared error (GA) 0.2.0139982 0.019719802 0.

019 0.0198 0.Graphs 10000 9000 8000 7000 6000 5000 4000 3000 2000 1000 0 0 2 4 6 Iterations (GA) Iterations (BP) Nodes (CC) Figure 32 .William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 5.2.Number of iterations to achieve target (Iris data) 0.0202 0.0188 0.0186 0 2 4 6 Mean squared error (GA) Mean squared error (BP) Mean squared error (CC) Figure 33.0192 0.0194 0.02 0.4 .0196 0.Mean squared error upon last training test (Iris data) Page 64 of 225 .

There are 18 measurements on each virus. The dataset is in order: • • • • Hordeviruses x3 Tobraviruses x6 Tobamoviruses x39 Furoviruses x13 Page 65 of 225 .015 0.02 Testing mean squared error (GA) Testing mean squared error (BP) Testing mean squared error (CC) 0.01 0.The mean squared error at testing (Iris data) 5. tomato. which are the number of amino acid residues per molecule of coat protein.025 0.3 .005 0 0 2 4 6 Figure 34. and others. cucumber.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 0.Virus Classification This dataset covers 61 viruses affecting several crops including tobacco.

017043 0.0105845 0.017723052 0.0393106 0.019743 0.Back-propagation Iterations (BP) 3275 10922 2800 3744 6295 5407.01983722 Mean Squared Error testing (BP) 0.0190612094 Mean Squared Error testing (GA) 0.2 Mean Squared Error training (BP) 0.8 Mean Squared Error training (GA) 0.019927361 0.0391179 0.019861371 0.0194383 0.0196959 0.Cascade Correlation Nodes (CC) 1 2 1 2 1 1.0347797 0.0195173 0.00979968 0.017723052 0.2 .0199621 0.1 .3.01870197 0.0190612094 Table 8 .0350318 0.03833646 Table 9 .0434423 0.0185152 0.01870197 0.Cascade Correlation testing data (Viruses) Page 66 of 225 .016183342 Mean Squared Error testing (CC) 0.019927361 0.0111416 0.019092293 0.0165979 0.0197935 0.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 5.Genetic Algorithms testing data (Viruses) 5.00640291 0.00980208 0.3 .Back-propagation testing data (Viruses) 5.Genetic Algorithms Iterations (GA) 1818 1421 896 11676 1068 3375.0199916 0.3.4 Mean Squared Error training (CC) 0.019861371 0.3.019092293 0.011585152 Table 10 .

02 Mean Squared Error training (GA) Mean Squared Error training (BP) Mean Squared Error training (CC) 0.Mean squared error upon last training test (Viruses) Page 67 of 225 .Number of iterations to achieve target (Viruses) 0.4 .01 0.025 0.3.015 0.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 5.Graphs 14000 12000 10000 8000 6000 4000 2000 0 0 2 4 6 Iterations (GA) Iterations (BP) Nodes (CC) Figure 35 .005 0 0 2 4 6 Figure 36 .

XOR As regards to the XOR problem.05 0. The back-propagation implementation seems to be slightly faster in real-time but this is possibly attributable to managed code inefficiencies versus unmanaged code. Genetic algorithm solutions are slightly more accurate. Genetic algorithms take around five hundred iterations on average to produce a workable solution when aiming for a mean squared error of below 0.1.Mean squared error at testing (Viruses) 6 .01. Page 68 of 225 .1 .045 0.03 0. versus backpropagations 333 iterations on average.01 0.005 0 0 2 4 6 Mean Squared Error testing (GA) Mean Squared Error testing (BP) Mean Squared Error testing (CC) Figure 37 .Comparisons 6. or possible inefficiencies in my programming.04 0. genetic algorithms and back-propagation offer similar performance in solving the problem.035 0.Back-propagation and Genetic Algorithms 6. but to a negligible degree in this scenario.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 0.1 .02 0.015 0.025 0.

With an average of 3318 generations for genetic algorithms versus 471 epochs for back-propagation this became clear.Cascade Correlation and Genetic Algorithms 6. FANN)) this is around 300 epochs to solve the problem.XOR This problem was solved more effectively by the Cascade algorithm than by genetic algorithms.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 6. 6.2. 6. Page 69 of 225 .8 generations versus 5407.Fishers Iris Data Genetic algorithms clearly found this a difficult problem to solve as opposed to backpropagation. on this data set cascade training came to a satisfactory solution faster and more accurately than genetic algorithms.Virus Classification The solution of this problem was more effective by genetic algorithms than by backpropagation. The cascade algorithm also achieves a higher degree of accuracy.Fishers Iris Data Again.2 .2 .2. The back-propagation generated networks were also more accurate overall (in fact on this particular problem analysed the testing data more effectively than the training data). The genetic algorithm solutions also held their effectiveness through to the testing data with extreme consistency. genetic algorithms taking 550 generations on average to solve the problem to a suitable accuracy. with an average of 3375. whereas the back-propagation solutions lost effectiveness on the training data.1.1. At a maximum of 150 epochs per node added (the default (Nissen. whilst the cascade algorithm used 2 nodes to solve the problems.2 epochs for backpropagation.2 .3 . 6.1 .

With more time.3 .William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 6.2. 7 . however. 6. genetic algorithms fall down as a solution. Compared to cascade correlation however. although there are further investigations I would like to continue with given more time (and may continue with in my own time). They are roughly as effective as back-propagation training and although back-propagation is faster for the most part. I feel the project has been a success.Virus Classification With this data set cascade training again came to a satisfactory solution faster and more accurately than genetic algorithms did on the same data.Evaluation Overall. with the information presented and discussed here. Page 70 of 225 .Testing conclusions Genetic algorithms are a valuable and effective means of training neural networks. solutions developed using genetic algorithms tend to hold their effectiveness through to the data set effectively. more in-depth testing using more varied datasets a clearer comparison and possibly drawbacks associated with cascade training may become evident. the unavoidable conclusion is that cascade training is the most effective of the three training methods examined.3 .

1 . The only objective that I feel could be improved upon is the final objective. Build a user-interface for the aforementioned application allowing for easy alteration of appropriate variables. “Identify the most effective ways of training neural networks using genetic algorithms. and that allows manual adjustment of relevant variables. and in which cases these methods are suitable. as well as previous research. Build an application that is capable of training a neural network with a genetic algorithm and with a backpropagation system.” With more time more advanced tests could be undertaken using larger data sets. evaluate training methods for neural networks. Page 71 of 225 . and in which cases these methods are suitable. Identify the most effective ways of training neural networks using genetic algorithms.5 -Objectives): Research the fields of genetic algorithms and neural networks.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 7.How many of the original objectives were achieved? The original objectives were as follows (9. Research current information on training neural networks using genetic algorithms. leading to a more solid conclusion and more information on the various strengths and weaknesses of the various learning algorithms examined. Using above application.

Possible Improvements More advanced testing would be the biggest improvement that more time would make possible.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 8 . Page 72 of 225 . Testing both with and without scaling and utilising different scaling methods. Some forms of testing that would be possible are: • • • • • Testing with datasets with larger numbers of inputs Testing with large datasets that attempt to train the network to distinguish between small differences in data. Testing with datasets that would take large amounts of time to train. Due to small conflicts between managed and unmanaged memory. Improve memory management. These could be resolved fairly simply (I believe) by implementing the iDispose interface in my managed code to allow it to be destroyed upon demand instead of waiting for the garbage collector. the program occasionally causes an exception (most specifically when creating cascade or back-propagation networks in quick succession).

experimenting with multiple point crossover and other crossover forms.2 . Page 73 of 225 . for the reasons stated above. • Implement the cascade training algorithm in C# instead of C++. as well as implementing roulette wheel selection. 8. (the new network wizard and the working form) lock out the rest of the program.Possible User Interface Improvements The main improvements to the user interface that I would make if I had more time are: • • Increased number of variable options presented to the user (with appropriate defaults set).1 . is worth the possibility of reduced performance. Contrary to my opinion before undertaking extensive usage of C# I now believe the reduced development time. Implement the back-propagation algorithm in C# instead of C++. • • Attempt to improve the speed of the genetic algorithm. allowing more to be undertaken successfully. Making the forms shown as dialogs. I would experiment with the following training algorithm improvements: • Improve the genetic algorithms crossover and mutation algorithms.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 8.Possible Training Algorithm Improvements With more time. Having the back-propagation algorithm in C# similar to the genetic algorithm would also allow a more “apples to apples” comparison. but still minimize instead of blocking other computer programs.

The earlier attempts at genetic algorithm and neural network implementations are not included. I have not included it in the source code listing. Page 74 of 225 . and neither is the code for the prototype constructed in milestone two. so that this listing contains only code I have personally written for the project.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 9 . Although there was another section of the program compiled from source (the FANN library).Source code The source code in this section is organised first by which part of the application it represents and then by what source file it originally resided in. This section also contains only the final draft of the code. which this code is partially based upon. The code contains line numbering for pinpointing the precise lines in question within the body-text when crossreferencing.1 .Appendices 9.

Linq.1.1 .Collections. private bool _CC_ITerr.View 9.Generic. private int _CC_Reports. private double _CC_LearningRate. System. System.1. //Dataset identifier private int _TrDataSet.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 9. private int _CC_MaxNeurons. System.“NetworkUpdatedEventHandler” 00000001 00000002 00000003 00000004 00000005 00000006 00000007 00000008 00000009 00000010 00000011 00000012 00000013 00000014 00000015 00000016 00000017 00000018 00000019 00000020 00000021 00000022 00000023 00000024 00000025 00000026 using using using using System.Text. namespace _05025397.Controller.1.1 . //Cascade Correlation private double _CC_Terr. Page 75 of 225 .EventArgs { #region data /********************\ |* DATA *| \********************/ //Training Algorithm Identifier private int trainingalg.Classes { public class NetworkUpdateEventArgs : System.

double CCTerr. private int _GA_Mutation. private double _GA_Terr. Page 76 of 225 . private int _GA_GenLimit. double CCLearningRate. private bool _GA_ITerr. private int _BP_Reports. private double _BP_LearningRate. private double _BP_Terr. //BackProp private int _BP_EpochLimit. int GAPopSize. int CCReports.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000027 00000028 00000029 00000030 00000031 00000032 00000033 00000034 00000035 00000036 00000037 00000038 00000039 00000040 00000041 00000042 00000043 00000044 00000045 00000046 00000047 00000048 00000049 00000050 00000051 00000052 00000053 00000054 00000055 00000056 //Genetic Algorithm private int _GA_PopSize. bool CCITerr. private bool _BP_ITerr. private int _GA_HiddenL. private int _BP_HiddenL. private int _GA_Crossover. private int _GA_Reports. #endregion #region constructor /********************\ |* CONSTRUCTOR *| \********************/ //Constructor to accept all necessary data public NetworkUpdateEventArgs (int Algorithm. int CCMaxNeurons.

int BPEpochLimit. _GA_Reports = GAReports. int BPHiddenL. _GA_ITerr = GAITerr. double BPTerr. _GA_GenLimit = GAGenLimit. int GAHiddenL. _GA_Crossover = GACrossOver. _CC_LearningRate = CCLearningRate. //Backpropagation Algorithm _BP_EpochLimit = BPEpochLimit. Page 77 of 225 .William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000057 00000058 00000059 00000060 00000061 00000062 00000063 00000064 00000065 00000066 00000067 00000068 00000069 00000070 00000071 00000072 00000073 00000074 00000075 00000076 00000077 00000078 00000079 00000080 00000081 00000082 00000083 00000084 00000085 00000086 int GAGenLimit. _CC_Reports = CCReports. bool BPITerr. //Cascade Correlation _CC_Terr = CCTerr. bool GAITerr. int TrData_Set) { //Algorithm trainingalg = Algorithm. _GA_Mutation = GAMutation. _CC_MaxNeurons = CCMaxNeurons. double BPLearningRate. double GATerr. _CC_ITerr = CCITerr. int BPReports. int GACrossOver. _GA_Terr = GATerr. //Genetic Algorithm _GA_PopSize = GAPopSize. _GA_HiddenL = GAHiddenL. int GAReports. int GAMutation.

_TrDataSet = TrData_Set. } } public bool CC_ITerr { get { return _CC_ITerr.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000087 00000088 00000089 00000090 00000091 00000092 00000093 00000094 00000095 00000096 00000097 00000098 00000099 00000100 00000101 00000102 00000103 00000104 00000105 00000106 00000107 00000108 00000109 00000110 00000111 00000112 00000113 00000114 00000115 00000116 _BP_HiddenL = BPHiddenL. } } public int CC_Reports { get { return _CC_Reports. _BP_LearningRate = BPLearningRate. } } public double CC_LearningRate { get { return _CC_LearningRate. _BP_Reports = BPReports. _BP_Terr = BPTerr. } #endregion #region getters/setters #region cascade_correlation //Cascade Correlation public double CC_Terr { get { return _CC_Terr. } } public int GA_GenLimit Page 78 of 225 . } } public int CC_MaxNeurons { get { return _CC_MaxNeurons. _BP_ITerr = BPITerr. } } #endregion #region genetic_algorithms //Genetic Algorithm public int GA_PopSize { get { return _GA_PopSize.

} } #endregion #region back_propagation //Back propagation public int BP_EpochLimit { get { return _BP_EpochLimit. } } public double GA_Terr { get { return _GA_Terr. } } #endregion Page 79 of 225 .William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000117 00000118 00000119 00000120 00000121 00000122 00000123 00000124 00000125 00000126 00000127 00000128 00000129 00000130 00000131 00000132 00000133 00000134 00000135 00000136 00000137 00000138 00000139 00000140 00000141 00000142 00000143 00000144 00000145 00000146 { get { return _GA_GenLimit. } } public int GA_Mutation { get { return _GA_Mutation. } } public double BP_LearningRate { get { return _BP_LearningRate. } } public bool GA_ITerr { get { return _GA_ITerr. } } public int BP_HiddenL { get { return _BP_HiddenL. } } public int GA_Crossover { get { return _GA_Crossover. } } public bool BP_ITerr { get { return _BP_ITerr. } } public int BP_Reports { get { return _BP_Reports. } } public int GA_HiddenL { get { return _GA_HiddenL. } } public int GA_Reports { get { return _GA_Reports. } } public double BP_Terr { get { return _BP_Terr.

“FrmMain.Drawing. System.1. System.Text. using ZedGraph.Windows. System. System.cs” 00000001 00000002 00000003 00000004 00000005 00000006 00000007 00000008 00000009 00000010 00000011 00000012 00000013 00000014 00000015 00000016 00000017 using using using using using using using using using System. } } public int TrainingAlgorithm { get { return trainingalg.ComponentModel. } } #endregion } 9.Controller { public partial class FrmMain : Form Page 80 of 225 . System.Collections. System.Data. System.Forms.2 .Linq.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000147 00000148 00000149 00000150 00000151 00000152 00000153 00000154 00000155 00000156 00000157 } #endregion #region external //General public int TrDataSet { get { return _TrDataSet.1. System.IO. namespace _05025397. using _05025397.Generic.

DoWork += new DoWorkEventHandler(bw_DoWork).Resources.TrainingAlgorithm network.Algorithms.Working workingdialog = new Controller.icon. //Background thread static BackgroundWorker bw = new BackgroundWorker(). //Working dialog Controller. bw.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000018 00000019 00000020 00000021 00000022 00000023 00000024 00000025 00000026 00000027 00000028 00000029 00000030 00000031 00000032 00000033 00000034 00000035 00000036 00000037 00000038 00000039 00000040 00000041 00000042 00000043 00000044 00000045 00000046 00000047 { #region data /********************\ |* DATA *| \********************/ //The neuralnetwork Controller. bw. } #endregion #region internal_functions /********************\ Page 81 of 225 . this. #endregion #region constructor /********************\ |* CONSTRUCTOR *| \********************/ public FrmMain() { InitializeComponent().Working().Icon = Properties.RunWorkerCompleted += new RunWorkerCompletedEventHandler(bw_RunWorkerCompleted).

GraphPane.Circle).Red.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000048 00000049 00000050 00000051 00000052 00000053 00000054 00000055 00000056 00000057 00000058 00000059 00000060 00000061 00000062 00000063 00000064 00000065 00000066 00000067 00000068 00000069 00000070 00000071 00000072 00000073 00000074 00000075 00000076 00000077 |* INTERNAL *| \********************/ private void plotgraphsMSE(PointPairList MSE) { this.Title.TrainingAlgorithm == 0) { Page 82 of 225 . } private void updatenetwork(object sender.IsVisible = false.AddCurve("".Text = "Iteration".NetworkUpdateEventArgs e) { LoadDataset(e. GraphPane MSEpane = this.AxisChange().Clear(). MSEpane. try { if (e. MSEpane.YAxis. this.Text = "MSE".zedGraphControl1. // Hide the legend MSEpane.Title. Classes. MSE.XAxis.Title. Color. //Titles MSEpane.Legend.zedGraphControl1. MSEpane.GraphPane.TrDataSet). SymbolType.CurveList.Text = "Mean Squared Error".zedGraphControl1.

e. e. txtTrainData.BP_HiddenL.Algorithms.CC_ITerr. e. e.Algorithms.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000078 00000079 00000080 00000081 00000082 00000083 00000084 00000085 00000086 00000087 00000088 00000089 00000090 00000091 00000092 00000093 00000094 00000095 00000096 00000097 00000098 00000099 00000100 00000101 00000102 00000103 00000104 00000105 00000106 00000107 network = new Controller. e.GA_Terr.GA_ITerr.GA_HiddenL.GA_Mutation.GA_Reports. e. e.TrainingAlgorithm == 2) { network = new Controller. e. } if (e.CC_Terr. e.BP_LearningRate.BP_ITerr. } } catch { Page 83 of 225 . txtTrainData. e.CascadeCorrelation (e.BP_Reports.BackProp (e.TrainingAlgorithm == 1) { network = new Controller.GA_Crossover.CC_Reports. txtTrainData.BP_Terr.CC_MaxNeurons. e. e.CC_LearningRate. txtTestData). e. e. e.GA_GenLimit.GeneticAlgorithm (e. txtTestData).Algorithms. e. } if (e.BP_EpochLimit. txtTestData).GA_PopSize.

XORtest. } } private void new_network() { Controller.OK.Text = network.Wiz1 wizard = new Controller. Application. txtTestData.ShowDialog(). } private void LoadDataset(int Data_set) { switch (Data_set) { case (int)Dataset. wizard.Resources.XORtrain.Wiz1().Resources.Text = Properties.XOR: txtTrainData. } if (network != null) { txtNetSettings. MessageBoxIcon.NetworkUpdated += new Controller. MessageBoxButtons.Exit(). Page 84 of 225 .William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000108 00000109 00000110 00000111 00000112 00000113 00000114 00000115 00000116 00000117 00000118 00000119 00000120 00000121 00000122 00000123 00000124 00000125 00000126 00000127 00000128 00000129 00000130 00000131 00000132 00000133 00000134 00000135 00000136 00000137 MessageBox.Text = Properties.Wiz1. "Error".Error).Show("Error creating new network".NetworkUpdateHandler(updatenetwork).network_details(). wizard.

break.\\".FISHER: txtTrainData. string testpath = SelectTextFile(". string train = "". case (int)Dataset.Resources.Text = Properties. } } private void LoadCustomDataSet() { string trainpath = SelectTextFile(".FISHERtest. txtTestData. "Error!". "Select Training Data").\\". string test = "". break. case (int)Dataset.Error).Resources. "Select Testing Data").William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000138 00000139 00000140 00000141 00000142 00000143 00000144 00000145 00000146 00000147 00000148 00000149 00000150 00000151 00000152 00000153 00000154 00000155 00000156 00000157 00000158 00000159 00000160 00000161 00000162 00000163 00000164 00000165 00000166 00000167 break. MessageBoxIcon.Show("Error: Problem loading training data".OK. } catch { MessageBox. try { train = LoadTxtFile(trainpath). } Page 85 of 225 .CUSTOM: LoadCustomDataSet().FISHERtrain.Text = Properties. MessageBoxButtons.

Show("Error: Problem loading testing data". try { File = new FileStream(path.ReadToEnd().OK.Text = test. StreamReader Reader = null. } txtTestData. } private string LoadTxtFile(string path) { string data = "". data = Reader. txtTrainData.Text = train.Open. } catch { MessageBox. MessageBoxIcon. Reader = new StreamReader(File).William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000168 00000169 00000170 00000171 00000172 00000173 00000174 00000175 00000176 00000177 00000178 00000179 00000180 00000181 00000182 00000183 00000184 00000185 00000186 00000187 00000188 00000189 00000190 00000191 00000192 00000193 00000194 00000195 00000196 00000197 try { test = LoadTxtFile(testpath). MessageBoxButtons. "Error!".OK. } catch { MessageBox.Error). MessageBoxIcon.Show("Error reading selected file: " + path.Error). FileAccess.Read). Page 86 of 225 . MessageBoxButtons. FileMode. FileStream File = null. "Error!".

dialog. if (File != null) File. } #endregion #region menu_items /********************\ |* MENU ITEMS *| \********************/ Page 87 of 225 . dialog. dialog. } private string SelectTextFile(string initialDirectory.OK) ? dialog.Close(). } return data.txt)|*.ShowDialog() == DialogResult.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000198 00000199 00000200 00000201 00000202 00000203 00000204 00000205 00000206 00000207 00000208 00000209 00000210 00000211 00000212 00000213 00000214 00000215 00000216 00000217 00000218 00000219 00000220 00000221 00000222 00000223 00000224 00000225 00000226 00000227 data = "". return (dialog.txt|All files (*.Close().Filter = "txt files (*.FileName : null.Title = title.*)|*.InitialDirectory = initialDirectory. } finally { if (Reader != null) Reader.*". string title) { OpenFileDialog dialog = new OpenFileDialog().

EventArgs e) { new_network(). EventArgs e) { this. } private void exitToolStripMenuItem_Click(object sender.Close(). } private void runToolStripMenuItem_Click(object sender. } } } private void aboutToolStripMenuItem1_Click(object sender. } #endregion #region buttons Page 88 of 225 .Show().William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000228 00000229 00000230 00000231 00000232 00000233 00000234 00000235 00000236 00000237 00000238 00000239 00000240 00000241 00000242 00000243 00000244 00000245 00000246 00000247 00000248 00000249 00000250 00000251 00000252 00000253 00000254 00000255 00000256 00000257 private void newNetworkToolStripMenuItem_Click(object sender.Test(). EventArgs e) { if (network != null) { if (network. About.Trained != false) { network. EventArgs e) { FrmAbout About = new FrmAbout().

} } } } private void btnTest_Click(object sender. if (!bw. } private void btnTrain_Click(object sender. EventArgs e) { if (network != null) { if (network.Trained) { bw.RunWorkerAsync(). EventArgs e) { new_network().Trained) Page 89 of 225 .ShowDialog().William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000258 00000259 00000260 00000261 00000262 00000263 00000264 00000265 00000266 00000267 00000268 00000269 00000270 00000271 00000272 00000273 00000274 00000275 00000276 00000277 00000278 00000279 00000280 00000281 00000282 00000283 00000284 00000285 00000286 00000287 /********************\ |* BUTTONS *| \********************/ private void btnNew_Click(object sender. workingdialog.IsBusy) { if (network != null) { if (!network. EventArgs e) { //Shouldn't be busy if the user managed to click this //but just make 100% certain.

if (success) { txtOutput.Tested) { bool success = network.Refresh(). } Page 90 of 225 . } } } } } #endregion #region bg_worker /********************\ |* BG WORKER *| \********************/ private void bw_DoWork(object sender. txtOutput.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000288 00000289 00000290 00000291 00000292 00000293 00000294 00000295 00000296 00000297 00000298 00000299 00000300 00000301 00000302 00000303 00000304 00000305 00000306 00000307 00000308 00000309 00000310 00000311 00000312 00000313 00000314 00000315 00000316 00000317 { if (!network.Test().ScrollToCaret().ReportData.Text = network. txtOutput.Text. txtOutput.Length.SelectionStart = txtOutput.Clear(). txtOutput.Train(). DoWorkEventArgs e) { bool success = true. if (network != null) { success = network.

MessageBoxButtons.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000318 00000319 00000320 00000321 00000322 00000323 00000324 00000325 00000326 00000327 00000328 00000329 00000330 00000331 00000332 00000333 00000334 00000335 00000336 00000337 00000338 00000339 00000340 00000341 00000342 00000343 00000344 00000345 00000346 00000347 e. MessageBoxIcon.OK. plotgraphsMSE(network.Error. } Page 91 of 225 . "Error training network!".Length.ReportData.Error).getGraphData()). "Error".Result = success. MessageBoxIcon.Show("Error training network!". if (success) { txtOutput.Clear(). txtOutput.Show("Error during network train: " + e.Result. txtOutput.Error != null) { MessageBox.Error).Text. } success = (bool) e.OK. MessageBoxButtons. txtOutput.SelectionStart = txtOutput.ToString().Text = network. //Check for errors if (e.ScrollToCaret(). } else { MessageBox. RunWorkerCompletedEventArgs e) { bool success. } private void bw_RunWorkerCompleted(object sender.

Drawing.Collections. } #endregion } 9. System.Linq.1. Page 92 of 225 . System. EventArgs e) { //Run the new neural net wizard new_network().Data.3 .cs” 00000001 00000002 00000003 00000004 00000005 00000006 using using using using using using System. System.Generic.1. } #endregion #region misc /********************\ |* MISC *| \********************/ private void FrmMain_Shown(object sender.Hide(). System.ComponentModel.“Wiz1. System.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000348 00000349 00000350 00000351 00000352 00000353 00000354 00000355 00000356 00000357 00000358 00000359 00000360 00000361 00000362 00000363 00000364 00000365 00000366 } //Remove the dialog locking out the main form //and showing that we're currently working workingdialog.

#endregion public partial class Wiz1 : Form { #region data /********************\ |* DATA *| \********************/ public delegate void NetworkUpdateHandler(object sender. BP. private int Trainset.Forms. CC }. namespace _05025397.NetworkUpdateEventArgs e).Text. Classes.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000007 00000008 00000009 00000010 00000011 00000012 00000013 00000014 00000015 00000016 00000017 00000018 00000019 00000020 00000021 00000022 00000023 00000024 00000025 00000026 00000027 00000028 00000029 00000030 00000031 00000032 00000033 00000034 00000035 00000036 using System. private int algorithm. enum Dataset { XOR. FISHER.Controller { #region enums /********************\ |* ENUMS *| \********************/ enum Training { GA. using System. using _05025397. public event NetworkUpdateHandler NetworkUpdated.Windows. CUSTOM }. Page 93 of 225 .

this.icon. EventArgs e) { this.Close(). } private void rBtnBackprop_CheckedChanged(object sender. EventArgs e) Page 94 of 225 .XOR. Trainset = (int)Dataset.Resources. algorithm = (int)Training.GA. } #endregion #region control_events /********************\ |* CONTROL EVENTS *| \********************/ #region buttons /********************\ |* BUTTONS *| \********************/ private void btnCancel_Click(object sender.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000037 00000038 00000039 00000040 00000041 00000042 00000043 00000044 00000045 00000046 00000047 00000048 00000049 00000050 00000051 00000052 00000053 00000054 00000055 00000056 00000057 00000058 00000059 00000060 00000061 00000062 00000063 00000064 00000065 00000066 #endregion data #region constructor /********************\ |* CONSTRUCTOR *| \********************/ public Wiz1() { InitializeComponent().Icon = Properties.

Page 95 of 225 . panBackprop. panGeneticAlgorithm. lblCC.Visible = false.BP.Visible = true.Visible = false.IMAGECascadeCorrelation. algorithm = (int)Training.Visible = false.Properties.Visible = true. panCC. panBackprop.Checked == true) { picAlg.Checked == true) { picAlg.Image = _05025397. lblGA.Resources. } } private void rBtnCascadeCorrelation_CheckedChanged(object sender.Image = _05025397.Visible = false. EventArgs e) { if (rBtnCascadeCorrelation.Resources.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000067 00000068 00000069 00000070 00000071 00000072 00000073 00000074 00000075 00000076 00000077 00000078 00000079 00000080 00000081 00000082 00000083 00000084 00000085 00000086 00000087 00000088 00000089 00000090 00000091 00000092 00000093 00000094 00000095 00000096 { if (rBtnBackprop.Visible = false. lblBP. lblGA. lblBP. panGeneticAlgorithm.Visible = true.Visible = false. algorithm = (int)Training.CC.IMAGEBackProp. lblCC. panCC.Visible = true.Visible = false.Properties.Visible = false.

panBackprop. panCC. } } private void btnNext_Click(object sender.Visible = false. EventArgs e) { if (rBtnGeneticAlgorithm.Properties.Image = _05025397.Checked == true) { picAlg.SelectTab(tabControl1. lblBP. panGeneticAlgorithm.Visible = true.Visible = false. algorithm = (int)Training.GA.IMAGEGeneticAlgorithm. EventArgs e) { Page 96 of 225 .William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000097 00000098 00000099 00000100 00000101 00000102 00000103 00000104 00000105 00000106 00000107 00000108 00000109 00000110 00000111 00000112 00000113 00000114 00000115 00000116 00000117 00000118 00000119 00000120 00000121 00000122 00000123 00000124 00000125 00000126 } } private void rBtnGeneticAlgorithm_CheckedChanged(object sender.Visible = false. } } private void btnBack_Click(object sender.Resources.SelectedIndex > 0) { tabControl1. EventArgs e) { if (tabControl1.Visible = true. lblGA.Visible = false.1). lblCC.SelectedIndex .

1) { tabControl1. CC_ITerr. txtBP_HiddenNodes. txtBP_LearnRate.Text.Text.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000127 00000128 00000129 00000130 00000131 00000132 00000133 00000134 00000135 00000136 00000137 00000138 00000139 00000140 00000141 00000142 00000143 00000144 00000145 00000146 00000147 00000148 00000149 00000150 00000151 00000152 00000153 00000154 00000155 00000156 if (tabControl1.Text.Checked.GA_Mutation. chkGA_IgnoreTarget.Text. check. if (check.Text. check. txtGA_ProbM.SelectTab(tabControl1. txtCC_MaxNeurons. txtBP_Report. txtBP_EpochLimit.CC_Reports. check.SelectedIndex + 1). txtCC_LearningRate.BP_HiddenL. txtCC_Report. Page 97 of 225 .BP_EpochLimit.GA_Reports.TrainingAlgorithm. check.Text.GA_PopSize.Text. txtCC_TargetError. check.Text.Text.CC_ITerr.Verified) { Classes. txtGA_Report. Trainset). check. txtGA_HiddenNodes. check.CC_Terr. check.Text. check. check. check.GA_HiddenL.SelectedIndex < tabControl1.Checked.GA_Terr. txtGA_ProbX. check.Text.NetworkUpdateEventArgs (check. txtGA_MaxGen. chkBP_IgnoreTarget. check.TabCount .Text. txtGA_Terr.NetworkUpdateEventArgs args = new Classes. } else { VerifyData check = new VerifyData (algorithm.Checked.Text. check. txtGA_PopSize.GA_GenLimit.CC_MaxNeurons.Text.Text. txtBP_Terr.GA_Crossover.GA_ITerr.Text.CC_LearningRate. check.

Checked) { picDataset.TrDataSet). this.Resources. check.Properties. EventArgs e) Page 98 of 225 . check. EventArgs e) { if (chkDatasetFisher.Exclamation).William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000157 00000158 00000159 00000160 00000161 00000162 00000163 00000164 00000165 00000166 00000167 00000168 00000169 00000170 00000171 00000172 00000173 00000174 00000175 00000176 00000177 00000178 00000179 00000180 00000181 00000182 00000183 00000184 00000185 00000186 check. check.OK.BP_LearningRate.Show("Error Checking Data: Data could not be verified".IMAGEIrisFlowers. MessageBoxButtons.Dispose(). check. MessageBoxIcon.BP_Reports. } else { MessageBox.BP_ITerr.Image = _05025397. "Error Checking Data". } } } #endregion #region checkboxes /********************\ |* CHECKBOXES *| \********************/ private void chkDatasetFisher_CheckedChanged(object sender.BP_Terr. args).FISHER. NetworkUpdated(this. Trainset = (int)Dataset. } } private void chkDatasetXOR_CheckedChanged(object sender.

Resources.Image = _05025397.SelectedIndex == 1) { if (panCC.Focus().Checked) { picDataset. EventArgs e) { if (chkDatasetCustom. } } #endregion #region misc /********************\ |* MISC *| \********************/ private void tabControl1_SelectedIndexChanged(object sender.IMAGEQuestionMark. EventArgs e) { if (tabControl1.Image = _05025397.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000187 00000188 00000189 00000190 00000191 00000192 00000193 00000194 00000195 00000196 00000197 00000198 00000199 00000200 00000201 00000202 00000203 00000204 00000205 00000206 00000207 00000208 00000209 00000210 00000211 00000212 00000213 00000214 00000215 00000216 { if (chkDatasetXOR.Properties. Trainset = (int)Dataset.IMAGEXOR.Properties. } } private void chkDatasetCustom_CheckedChanged(object sender.XOR.CUSTOM.Checked) { picDataset. } Page 99 of 225 . Trainset = (int)Dataset.Visible == true) { txtCC_TargetError.Resources.

} if (panGeneticAlgorithm. } } } private void Wiz1_Load(object sender.Focus().Visible == true) { txtBP_EpochLimit. } #endregion #endregion } Page 100 of 225 .SelectTab(0).icon. tabControl1.Focus().Icon = Properties.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000217 00000218 00000219 00000220 00000221 00000222 00000223 00000224 00000225 00000226 00000227 00000228 00000229 00000230 00000231 00000232 00000233 00000234 00000235 00000236 } if (panBackprop. EventArgs e) { this.Resources.Visible == true) { txtGA_PopSize.

Windows. System.Forms. System.1. System.4 .Drawing. EventArgs e) { Page 101 of 225 . System.“FrmAbout.Data.Linq. System.Generic. System.Text.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 9.ComponentModel.Controller { public partial class FrmAbout : Form { #region constructor /********************\ |* CONSTRUCTOR *| \********************/ public FrmAbout() { InitializeComponent(). System.cs” 00000001 00000002 00000003 00000004 00000005 00000006 00000007 00000008 00000009 00000010 00000011 00000012 00000013 00000014 00000015 00000016 00000017 00000018 00000019 00000020 00000021 00000022 00000023 00000024 00000025 00000026 00000027 00000028 00000029 using using using using using using using using System.Collections. } #endregion #region form /********************\ |* FORM *| \********************/ private void FrmAbout_Load(object sender.1. namespace _05025397.

Information). MessageBoxIcon. LinkLabelLinkClickedEventArgs e) Page 102 of 225 .Resources. } #endregion #region linklabels /********************\ |* LINKLABELS *| \********************/ private void linkLabel1_LinkClicked(object sender.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000030 00000031 00000032 00000033 00000034 00000035 00000036 00000037 00000038 00000039 00000040 00000041 00000042 00000043 00000044 00000045 00000046 00000047 00000048 00000049 00000050 00000051 00000052 00000053 00000054 00000055 00000056 00000057 00000058 00000059 this. try { // Navigate to a URL. System. label5.icon. } } private void linkLabel4_LinkClicked(object sender.Icon = Properties.Start("mailto:" + linkLabel1.".Resources. MessageBoxButtons.Text = Application. this.Show("No e-mail program defined.Diagnostics.ProductVersion. textBox5. LinkLabelLinkClickedEventArgs e) { // Specify that the link was visited.Process.LinkVisited = true.Text = Properties.linkLabel1. } catch { MessageBox.LICENCE_LGPL21.Text).OK. "Undefined Application".

OK. "Error". LinkLabelLinkClickedEventArgs e) { try { System.Process.Diagnostics.Show("Error opening link. MessageBoxButtons.Text). LinkLabelLinkClickedEventArgs e) Page 103 of 225 .Diagnostics. MessageBoxIcon.Start (linkLabel5. } } private void linkLabel6_LinkClicked(object sender.Start (linkLabel4.".Error). } catch { MessageBox.". MessageBoxButtons.OK. "Error". } } private void linkLabel5_LinkClicked(object sender. MessageBoxIcon.Show("Error opening link.Error).William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000060 00000061 00000062 00000063 00000064 00000065 00000066 00000067 00000068 00000069 00000070 00000071 00000072 00000073 00000074 00000075 00000076 00000077 00000078 00000079 00000080 00000081 00000082 00000083 00000084 00000085 00000086 00000087 00000088 00000089 { try { System.Text). } catch { MessageBox.Process.

MessageBoxButtons.Start ("http://www.uk"). MessageBoxButtons. } catch { MessageBox.Process. "Error".Diagnostics.". } catch { MessageBox.Error).Error). } } private void linkLabel2_LinkClicked(object sender. } } private void linkLabel7_LinkClicked(object sender. "Error".Text).".OK. MessageBoxIcon.Show("Error opening link.Diagnostics.Start (linkLabel6. MessageBoxIcon.co. LinkLabelLinkClickedEventArgs e) Page 104 of 225 .snikks.Process.OK.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000090 00000091 00000092 00000093 00000094 00000095 00000096 00000097 00000098 00000099 00000100 00000101 00000102 00000103 00000104 00000105 00000106 00000107 00000108 00000109 00000110 00000111 00000112 00000113 00000114 00000115 00000116 00000117 00000118 00000119 { try { System. LinkLabelLinkClickedEventArgs e) { try { System.Show("Error opening link.

} else Page 105 of 225 .html").Visible != true) { groupBox1.Visible = false. tabControl1. groupBox2.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000120 00000121 00000122 00000123 00000124 00000125 00000126 00000127 00000128 00000129 00000130 00000131 00000132 00000133 00000134 00000135 00000136 00000137 00000138 00000139 00000140 00000141 00000142 00000143 00000144 00000145 00000146 00000147 00000148 00000149 { try { System.Visible = false. pictureBox1. } } #endregion #region buttons /********************\ |* BUTTONS *| \********************/ private void btnDatasets_Click(object sender.1.Show("Error opening link. MessageBoxIcon. "Error".Visible = false.Start ("http://www.OK.Visible = true.Process. } catch { MessageBox.".gnu.org/licenses/old-licenses/lgpl-2.Error). EventArgs e) { if (tabControl1. MessageBoxButtons.Diagnostics.

Dispose(). } true.Visible pictureBox1. pictureBox1.Visible = tabControl1.Visible = true. EventArgs e) { this. false. tabControl1. EventArgs e) { if (groupBox2. = true.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000150 00000151 00000152 00000153 00000154 00000155 00000156 00000157 00000158 00000159 00000160 00000161 00000162 00000163 00000164 00000165 00000166 00000167 00000168 00000169 00000170 00000171 00000172 00000173 00000174 00000175 00000176 00000177 00000178 00000179 { groupBox1.Visible = false. Page 106 of 225 .Visible = false. groupBox1.Visible = true.Visible } } private void btnLicences_Click(object sender. = false.Visible = false. } else { groupBox1.Visible != true) { groupBox2. pictureBox1.Visible = groupBox2.Visible = false.Visible = true.Visible = false. tabControl1. groupBox2. } } private void btnOkay_Click(object sender.

Text = Properties.LICENCE_LGPL21. EventArgs e) { if (radioButton3. } #endregion } Page 107 of 225 . } private void radioButton2_CheckedChanged(object sender.LICENCE_LGPL30.Resources.Resources. EventArgs e) { if (radioButton1. EventArgs e) { if (radioButton2.Text = Properties. } private void radioButton3_CheckedChanged(object sender.Checked == true) textBox5.Checked == true) textBox5.Text = Properties.Checked == true) textBox5.Resources.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000180 00000181 00000182 00000183 00000184 00000185 00000186 00000187 00000188 00000189 00000190 00000191 00000192 00000193 00000194 00000195 00000196 00000197 00000198 00000199 00000200 00000201 00000202 00000203 00000204 00000205 } #endregion #region radiobuttons /********************\ |* RADIOBUTTONS *| \********************/ private void radioButton1_CheckedChanged(object sender.LICENCE_GPL30.

Forms.Icon = Properties.Text. System. System. namespace _05025397.Play(). System.icon.1. System. this.cs” 00000001 00000002 00000003 00000004 00000005 00000006 00000007 00000008 00000009 00000010 00000011 00000012 00000013 00000014 00000015 00000016 00000017 00000018 00000019 00000020 00000021 00000022 00000023 00000024 00000025 00000026 00000027 00000028 00000029 using using using using using using using using System. } private void Working_Click(object sender.Controller { public partial class Working : Form { #region functions /********************\ |* FUNCTIONS *| \********************/ public Working() { InitializeComponent().Resources.Windows. System.Collections.1.“Working. } #endregion } Page 108 of 225 .Media. System. System.Generic.Linq.ComponentModel.Drawing.5 .Data. EventArgs e) { System.SystemSounds.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 9.Beep.

William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000030 } 9. System.cs” 00000001 00000002 00000003 00000004 00000005 00000006 00000007 00000008 00000009 00000010 00000011 00000012 00000013 00000014 00000015 00000016 00000017 00000018 00000019 00000020 00000021 00000022 00000023 00000024 00000025 using using using using using System.“VerifyData. System.Text.Forms.Windows.Collections.Linq.2.1.1 . //Training Algorithm Identifier //1 = genetic algorith //2 = backprop //3 = cascade correlation private int trainingalg.Controller 9.Generic. System. //Dataset identifer //0 = XOR Page 109 of 225 .1.2 . System. namespace _05025397.Controller { public class VerifyData { #region data /********************\ |* DATA *| \********************/ //Dataverified variable private bool verified.

private int _GA_Crossover. private int _GA_Reports. private int _CC_Reports. private int _CC_MaxNeurons. private bool _GA_ITerr.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000026 00000027 00000028 00000029 00000030 00000031 00000032 00000033 00000034 00000035 00000036 00000037 00000038 00000039 00000040 00000041 00000042 00000043 00000044 00000045 00000046 00000047 00000048 00000049 00000050 00000051 00000052 00000053 00000054 00000055 //1 = FISHERS IRIS DATA //2 = CUSTOM private int _TDataSet. private double _BP_Terr. private bool _CC_ITerr. private int _BP_Reports. //BackProp private int _BP_EpochLimit. //Cascade Correlation private double _CC_Terr. private double _GA_Terr. //Genetic Algorithm private int _GA_PopSize. private int _GA_HiddenL. private double _CC_LearningRate. private int _GA_GenLimit. private int _GA_Mutation. private double _BP_LearningRate. private bool _BP_ITerr. #endregion Page 110 of 225 . private int _BP_HiddenL.

//DataSet _TDataSet = TData_Set. string GAPopSize. string BPLearningRate.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000056 00000057 00000058 00000059 00000060 00000061 00000062 00000063 00000064 00000065 00000066 00000067 00000068 00000069 00000070 00000071 00000072 00000073 00000074 00000075 00000076 00000077 00000078 00000079 00000080 00000081 00000082 00000083 00000084 00000085 #region constructor /********************\ |* CONSTRUCTOR *| \********************/ public VerifyData (int Algorithm. string GACrossOver. string BPHiddenL. string BPEpochLimit. string GAMutation. bool GAITerr. string BPTerr. string GAReports. if (_TDataSet != (int)Dataset. int TData_Set) { //Initially set to true. string CCLearningRate. string GATerr. string BPReports.XOR && _TDataSet != Page 111 of 225 . string CCTerr. string GAGenLimit. bool BPITerr. //Algorithm trainingalg = Algorithm. string GAHiddenL. string CCMaxNeurons. bool CCITerr. will be changed to //false if any data verification errors occur verified = true. string CCReports.

} } } Page 112 of 225 .ToInt32(CCReports). _CC_ITerr = CCITerr.FISHER && _TDataSet != (int)Dataset.ToSingle(CCLearningRate). "Parsing Error".Error). _CC_Reports = Convert. if (verified) { if (trainingalg == 2) { try { //Cascade correlation _CC_Terr = Convert. _CC_MaxNeurons = Convert. _CC_LearningRate = Convert.OK. MessageBoxIcon.ToSingle(CCTerr).CUSTOM) verified = false. MessageBoxButtons.Show ("Parsing Error: Please check supplied cascade" + "correlation data values".ToInt32(CCMaxNeurons). } catch (FormatException) { MessageBox. verified = false.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000086 00000087 00000088 00000089 00000090 00000091 00000092 00000093 00000094 00000095 00000096 00000097 00000098 00000099 00000100 00000101 00000102 00000103 00000104 00000105 00000106 00000107 00000108 00000109 00000110 00000111 00000112 00000113 00000114 00000115 (int)Dataset.

"Parsing Error".ToInt32(GAMutation). MessageBoxButtons.Show ("Parsing Error: Please check supplied" +" genetic algorithm data values".OK. _GA_Terr = Convert. _GA_GenLimit = Convert. _GA_ITerr = GAITerr. _GA_Crossover = Convert. _GA_Mutation = Convert.ToInt32(GAHiddenL).ToInt32(GAReports).ToSingle(GATerr).ToInt32(GAPopSize). } catch (FormatException) { MessageBox. verified = false. MessageBoxIcon. _GA_Reports = Convert. } } } if (verified) Page 113 of 225 .Error). _GA_HiddenL = Convert.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000116 00000117 00000118 00000119 00000120 00000121 00000122 00000123 00000124 00000125 00000126 00000127 00000128 00000129 00000130 00000131 00000132 00000133 00000134 00000135 00000136 00000137 00000138 00000139 00000140 00000141 00000142 00000143 00000144 00000145 if (verified) { if (trainingalg == 0) { try { //Genetic algorithm _GA_PopSize = Convert.ToInt32(GACrossOver).ToInt32(GAGenLimit).

MessageBoxIcon. _BP_LearningRate = Convert. MessageBoxButtons.ToInt32(BPEpochLimit). verified = false. _BP_ITerr = BPITerr. "Parsing Error".ToDouble(BPLearningRate). _BP_Terr = Convert. } } } if (verified) { verified = checkforsanity().ToDouble(BPTerr).William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000146 00000147 00000148 00000149 00000150 00000151 00000152 00000153 00000154 00000155 00000156 00000157 00000158 00000159 00000160 00000161 00000162 00000163 00000164 00000165 00000166 00000167 00000168 00000169 00000170 00000171 00000172 00000173 00000174 00000175 { if (trainingalg == 1) { try { //Back-propagation _BP_EpochLimit = Convert.ToInt32(BPReports).Show ("Parsing Error: Please check " + "supplied back propagation data values". _BP_HiddenL = Convert. } Page 114 of 225 .OK.Error).ToInt32(BPHiddenL). _BP_Reports = Convert. } catch (FormatException) { MessageBox.

William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000176 00000177 00000178 00000179 00000180 00000181 00000182 00000183 00000184 00000185 00000186 00000187 00000188 00000189 00000190 00000191 00000192 00000193 00000194 00000195 00000196 00000197 00000198 00000199 00000200 00000201 00000202 00000203 00000204 00000205 } #endregion #region internal /********************\ |* INTERNAL *| \********************/ private bool checkGAsanity() { bool sanity = true. if (_GA_GenLimit < 1) sanity = false. } if (_GA_Mutation < 0 || _GA_Mutation > 100) { sanity = false. } if (_GA_Terr < 0 || _GA_Terr > 1) sanity = false. if (_GA_Crossover < 0 || _GA_Crossover > 100) { sanity = false. if (_GA_PopSize < 3) sanity = false. Page 115 of 225 .

Page 116 of 225 . return sanity. "Sanity Check Fail".Show ("Sanity Check Fail: Please check supplied " + "genetic algorithm data values".William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000206 00000207 00000208 00000209 00000210 00000211 00000212 00000213 00000214 00000215 00000216 00000217 00000218 00000219 00000220 00000221 00000222 00000223 00000224 00000225 00000226 00000227 00000228 00000229 00000230 00000231 00000232 00000233 00000234 00000235 if (_GA_Reports < 1 || _GA_Reports > _GA_GenLimit) sanity = false. if (!sanity) MessageBox. MessageBoxIcon.OK.Error). if (_GA_HiddenL < 1) sanity = false. if (_BP_EpochLimit < 1) sanity = false. MessageBoxButtons. if (_BP_HiddenL < 1) sanity = false. if (_BP_Reports < 1 || _BP_Reports > _BP_EpochLimit) sanity = false. } private bool checkBPsanity() { bool sanity = true.

} private bool checkCCsanity() { bool sanity = true.Error). if (_CC_Terr < 0 || _CC_Terr > 1) sanity = false.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000236 00000237 00000238 00000239 00000240 00000241 00000242 00000243 00000244 00000245 00000246 00000247 00000248 00000249 00000250 00000251 00000252 00000253 00000254 00000255 00000256 00000257 00000258 00000259 00000260 00000261 00000262 00000263 00000264 00000265 if (_BP_Terr < 0 || _BP_Terr > 1) sanity = false. if (!sanity) MessageBox. MessageBoxButtons. return sanity.OK. MessageBoxIcon. if (_CC_MaxNeurons < 1) sanity = false.Show ("Sanity Check Fail: Please check supplied " + "back propagation data values". "Sanity Check Fail". if (_BP_LearningRate < 0 || _BP_LearningRate > 1) sanity = false. Page 117 of 225 . if (_CC_Reports < 1 || _CC_Reports > _CC_MaxNeurons) sanity = false.

William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000266 00000267 00000268 00000269 00000270 00000271 00000272 00000273 00000274 00000275 00000276 00000277 00000278 00000279 00000280 00000281 00000282 00000283 00000284 00000285 00000286 00000287 00000288 00000289 00000290 00000291 00000292 00000293 00000294 00000295 if (_CC_LearningRate < 0 || _CC_LearningRate > 1) sanity = false.however I don't want to prevent any flexibility. MessageBoxIcon. if (trainingalg < 0 || trainingalg > 2) Page 118 of 225 . return sanity. "Sanity Check Fail". sanity = true.OK. MessageBoxButtons. if (!sanity) MessageBox. if they're greater than 1 but less than 100 scale them appropriately. only //halt any values from proceeding that are so wrong they could cause //serious errors later down the line. We're also doing some very minor processing of the probability values. // // // // // bool Basically we're making sure the data is clean before it goes anywhere near a DLL.Show ("Sanity Check Fail: Please check supplied " + "cascade correlation data values". } private bool checkforsanity() { //Some of the values that are allowed through here would not produce //good results .Error).

} if (trainingalg == 1) { sanity = checkBPsanity(). } Page 119 of 225 . MessageBoxIcon.OK.Error). } if (trainingalg == 2) { sanity = checkCCsanity(). "Sanity Check Fail". MessageBox. } } return sanity.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000296 00000297 00000298 00000299 00000300 00000301 00000302 00000303 00000304 00000305 00000306 00000307 00000308 00000309 00000310 00000311 00000312 00000313 00000314 00000315 00000316 00000317 00000318 00000319 00000320 00000321 00000322 00000323 00000324 00000325 { sanity = false. MessageBoxButtons.Show ("Sanity Check Fail: Training Algorithm not " + "selected or selected incorrectly". } if (sanity) { if (trainingalg == 0) { sanity = checkGAsanity().

} } public int GA_Crossover { get { return _GA_Crossover. } } public int CC_Reports { get { return _CC_Reports. } } public bool CC_ITerr { get { return _CC_ITerr. } } public double CC_LearningRate { get { return _CC_LearningRate. } } public int GA_Mutation Page 120 of 225 . } } public int CC_MaxNeurons { get { return _CC_MaxNeurons.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000326 00000327 00000328 00000329 00000330 00000331 00000332 00000333 00000334 00000335 00000336 00000337 00000338 00000339 00000340 00000341 00000342 00000343 00000344 00000345 00000346 00000347 00000348 00000349 00000350 00000351 00000352 00000353 00000354 00000355 #endregion #region getters/setters /********************\ |* EXTERNAL *| \********************/ #region cascade_correlation //Cascade Correlation public double CC_Terr { get { return _CC_Terr. } } #endregion #region genetic_algorithm //Genetic Algorithm public int GA_PopSize { get { return _GA_PopSize. } } public int GA_GenLimit { get { return _GA_GenLimit.

} } public double BP_LearningRate { get { return _BP_LearningRate. } } public int BP_Reports { get { return _BP_Reports. } } public bool BP_ITerr { get { return _BP_ITerr. } } #region back_propagation //Back propagation public int BP_EpochLimit { get { return _BP_EpochLimit. } } #endregion #endregion #region external //Verification Page 121 of 225 .William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000356 00000357 00000358 00000359 00000360 00000361 00000362 00000363 00000364 00000365 00000366 00000367 00000368 00000369 00000370 00000371 00000372 00000373 00000374 00000375 00000376 00000377 00000378 00000379 00000380 00000381 00000382 00000383 00000384 00000385 { get { return public double GA_Terr { get { return public int GA_Reports { get { return public int GA_HiddenL { get { return public bool GA_ITerr { get { return #endregion _GA_Mutation. } } public double BP_Terr { get { return _BP_Terr. } } _GA_ITerr. } } public int BP_HiddenL { get { return _BP_HiddenL. } } _GA_Terr. } } _GA_Reports. } } _GA_HiddenL.

} } #endregion } Page 122 of 225 . } } //Dataset public int TrDataSet { get { return _TDataSet.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000386 00000387 00000388 00000389 00000390 00000391 00000392 00000393 00000394 00000395 00000396 00000397 00000398 } public bool Verified { get { return verified. } } //TrainingAlgorithm public int TrainingAlgorithm { get { return trainingalg.

private ArrayList aldata. namespace _05025397.Controller { public class DatasetParser { #region data /********************\ |* DATA *| \********************/ private bool _Verified.Forms.2 . private ArrayList trinputs.Text.Windows.Linq.Generic. System.2. private ArrayList teoutputs. System. private string[] data. private string[] test. private ArrayList troutputs.cs” 00000001 00000002 00000003 00000004 00000005 00000006 00000007 00000008 00000009 00000010 00000011 00000012 00000013 00000014 00000015 00000016 00000017 00000018 00000019 00000020 00000021 00000022 00000023 00000024 00000025 00000026 00000027 00000028 00000029 using using using using using using System.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 9. private ArrayList teinputs.1. private ArrayList altest.“DatasetParser.Collections. System. System.Collections. System. Page 123 of 225 .

//Strip carriage returns and trim txtData.Text = txtData.Text. ' '. teinputs = new ArrayList(). '.Text = txtData. char[] delimiterChars = { '\n'. '\r'.Trim(). ""). #endregion #region constructor /********************\ |* CONSTRUCTOR *| \********************/ public DatasetParser(RichTextBox txtData.Trim(). RichTextBox txtTest) { //Data init bool Verified = true. private double Ninputs. Page 124 of 225 . teoutputs = new ArrayList().Text. altest = new ArrayList(). troutputs = new ArrayList().Replace("\r".Text = txtTest.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000030 00000031 00000032 00000033 00000034 00000035 00000036 00000037 00000038 00000039 00000040 00000041 00000042 00000043 00000044 00000045 00000046 00000047 00000048 00000049 00000050 00000051 00000052 00000053 00000054 00000055 00000056 00000057 00000058 00000059 //private Scaler scale. "").Text.Text = txtTest. aldata = new ArrayList(). txtTest.'. txtTest. txtData.Text. '.' }. '\t'. private double Noutputs. trinputs = new ArrayList().Replace("\r". private double Niterations.

i++) Page 125 of 225 .ToDouble(data[1]).ToDouble(data[2]).Convert.Length. test = txtTest. Noutputs = System.Split(delimiterChars). //parse the data into appropriately //structured arrays Verified = parseTrainingData(). i < data. //Get the number of iterations.Convert. try { for (int i = 3. number of inputs //and number of outputs Niterations = System. Ninputs = System.Text. } #endregion #region internal_functions /********************\ |* INTERNAL *| \********************/ private bool parseTrainingData() { bool success = true. Verified = parseTestingData(). _Verified = Verified.Text.ToDouble(data[0]).Convert.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000060 00000061 00000062 00000063 00000064 00000065 00000066 00000067 00000068 00000069 00000070 00000071 00000072 00000073 00000074 00000075 00000076 00000077 00000078 00000079 00000080 00000081 00000082 00000083 00000084 00000085 00000086 00000087 00000088 00000089 //Split at the chars specified above data = txtData.Split(delimiterChars).

j++) { troutputs.Show("Error parsing training data".OK. MessageBoxIcon. success = false.Convert. } } } catch { MessageBox.Error). aldata.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000090 00000091 00000092 00000093 00000094 00000095 00000096 00000097 00000098 00000099 00000100 00000101 00000102 00000103 00000104 00000105 00000106 00000107 00000108 00000109 00000110 00000111 00000112 00000113 00000114 00000115 00000116 00000117 00000118 00000119 { aldata. MessageBoxButtons.RemoveAt(0). "Error".ToDouble(data[i])). Page 126 of 225 . } while (aldata.Add(aldata[0]).Add(aldata[0]). aldata.Add(System. } private bool parseTestingData() { bool success = true. j < Noutputs. } for (int j = 0.RemoveAt(0). i++) { trinputs. i < Ninputs.Count > 0) { for (int i = 0. } return success.

Length. } return success. } } } catch { MessageBox.Convert. i < Ninputs.RemoveAt(0). i < data.Add(altest[0]). i++) { altest.Show("Error parsing testing data". } while (altest. i++) { teinputs.Add(altest[0]). j < Noutputs.ToDouble(data[i])). } Page 127 of 225 . altest. MessageBoxButtons.RemoveAt(0). } for (int j = 0.Error).OK.Add(System.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000120 00000121 00000122 00000123 00000124 00000125 00000126 00000127 00000128 00000129 00000130 00000131 00000132 00000133 00000134 00000135 00000136 00000137 00000138 00000139 00000140 00000141 00000142 00000143 00000144 00000145 00000146 00000147 00000148 00000149 try { for (int i = 3. "Error". MessageBoxIcon. success = false. altest.Count > 0) { for (int i = 0. j++) { teoutputs.

i++) trinputdata[i] = new double[(int) Ninputs]. out double[][] troutputdata) { trinputdata = new double[trinputs. l = 0. i++) troutputdata[i] = new double[(int) Noutputs].Count / (int) Noutputs][]. for (int j = 0. iter = Niterations. j < trinputs.Count / (int)Ninputs). for (int i = 0. l++) { for (int k = 0. for (int i = 0.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000150 00000151 00000152 00000153 00000154 00000155 00000156 00000157 00000158 00000159 00000160 00000161 00000162 00000163 00000164 00000165 00000166 00000167 00000168 00000169 00000170 00000171 00000172 00000173 00000174 00000175 00000176 00000177 00000178 00000179 #endregion #region external_functions /********************\ |* EXTERNAL *| \********************/ public void GetStructure(out double iter.Count / (int) Ninputs][].Count. i < (trinputs. } public void GetTrainingData (out double[][] trinputdata. troutputdata = new double[troutputs. i < (troutputs. k++) { Page 128 of 225 . k < Ninputs. j+=(int) Ninputs. out double Nout) { Ninp = Ninputs. Nout = Noutputs. out double Ninp.Count / (int)Noutputs).

k]. i++) teoutputdata[i] = new double[(int)Noutputs].Count / (int)Ninputs][]. k < Ninputs. out double[][] teoutputdata) { teinputdata = new double[teinputs. l++) { for (int k = 0. k++) { troutputdata[l][k] = (double)troutputs[j + k].Count / (int)Noutputs][]. j += (int)Ninputs. k < Noutputs. l = 0.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000180 00000181 00000182 00000183 00000184 00000185 00000186 00000187 00000188 00000189 00000190 00000191 00000192 00000193 00000194 00000195 00000196 00000197 00000198 00000199 00000200 00000201 00000202 00000203 00000204 00000205 00000206 00000207 00000208 00000209 trinputdata[l][k] = (double) trinputs[j + } } for (int j = 0. i++) teinputdata[i] = new double[(int)Ninputs].Count / (int)Noutputs). for (int i = 0. l++) { for (int k = 0. Page 129 of 225 .Count / (int)Ninputs). i < (teinputs.Count. } } } public void GetTestingData (out double[][] teinputdata. l = 0. i < (teoutputs. k++) { teinputdata[l][k] = (double)teinputs[j + k]. j += (int)Noutputs. j < troutputs. teoutputdata = new double[teoutputs. j < teinputs. for (int i = 0. for (int j = 0.Count.

Count. k++) { teoutputdata[l][k] = (double)teoutputs[j + k]. teoutputdata = teoutputs. j < teoutputs.3 . l = 0. } } } public void GetTestingDataAL (out ArrayList teinputdata. k < Noutputs.1.“Algorithms\TrainingAlgorithm.2.cs” 00000001 using System. j += (int)Noutputs. out ArrayList teoutputdata) { teinputdata = teinputs.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000210 00000211 00000212 00000213 00000214 00000215 00000216 00000217 00000218 00000219 00000220 00000221 00000222 00000223 00000224 00000225 00000226 00000227 00000228 00000229 00000230 00000231 00000232 00000233 00000234 00000235 00000236 } } } for (int j = 0. l++) { for (int k = 0. } public bool Verified { get { return _Verified. } } #endregion } 9. Page 130 of 225 .

ZedGraph. protected PointPairList BestErrList. Page 131 of 225 . private int _IterMax. System. private string _ReportData. private int _ReportInterval. System. protected bool _ITerr.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000002 00000003 00000004 00000005 00000006 00000007 00000008 00000009 00000010 00000011 00000012 00000013 00000014 00000015 00000016 00000017 00000018 00000019 00000020 00000021 00000022 00000023 00000024 00000025 00000026 00000027 00000028 00000029 00000030 00000031 using using using using using using System. _05025397.Forms.Linq.Generic. protected bool _Tested. protected int CurIt.Controller. System.Collections. protected bool _Trained. namespace _05025397.Algorithms { public abstract class TrainingAlgorithm { #region data /********************\ |* DATA *| \********************/ private double _TargetError.Text.Windows.

#endregion #region constructor /********************\ |* CONSTRUCTOR *| \********************/ public TrainingAlgorithm(double Target_Error. } #endregion Page 132 of 225 . int Reports.00. txtTest). so the //network will loop to completion. if (_ITerr) _TargetError = -1. _ReportInterval = Reports. BestErrList = new PointPairList(). getdata = new DatasetParser(txtData. RichTextBox txtData. int Iter_Max. _ITerr = ITerr. RichTextBox txtTest.0 //this is impossible to reach. _IterMax = Iter_Max. bool ITerr) { _TargetError = Target_Error. //If the ignore target error is true //then set the target error to -1. protected DatasetParser getdata.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000032 00000033 00000034 00000035 00000036 00000037 00000038 00000039 00000040 00000041 00000042 00000043 00000044 00000045 00000046 00000047 00000048 00000049 00000050 00000051 00000052 00000053 00000054 00000055 00000056 00000057 00000058 00000059 00000060 00000061 protected Random Rand = new Random().

public abstract bool Test(). } } Page 133 of 225 . } get { return _TargetError. public abstract string network_details(). } public double TargetError { set { _TargetError = value.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000062 00000063 00000064 00000065 00000066 00000067 00000068 00000069 00000070 00000071 00000072 00000073 00000074 00000075 00000076 00000077 00000078 00000079 00000080 00000081 00000082 00000083 00000084 00000085 00000086 00000087 00000088 00000089 00000090 00000091 #region internal /********************\ |* INTERNAL *| \********************/ protected void Report(string output) { _ReportData += output. public PointPairList getGraphData() { return BestErrList. } #endregion #region external /********************\ |* EXTERNAL *| \********************/ public abstract bool Train().

William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000092 00000093 00000094 00000095 00000096 00000097 00000098 00000099 00000100 00000101 00000102 00000103 00000104 00000105 00000106 00000107 00000108 00000109 00000110 00000111 00000112 00000113 00000114 00000115 00000116 00000117 00000118 00000119 } public int ReportInterval { get { return _ReportInterval. } } public string ReportData { get { return _ReportData. } set { _Trained = value. } } #endregion } Page 134 of 225 . } } public bool Trained { get { return _Trained. } } public int IterMax { get { return _IterMax. } } public bool Tested { get { return _Tested.

System.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 9. System.Collections. #endregion #region constructor Page 135 of 225 . System.Linq. ZedGraph. _05025397. System. FANN_Cascade CCNet. FANN_Wrapper.Controller. System.IO.Algorithms { public class CascadeCorrelation : TrainingAlgorithm { #region data /********************\ |* DATA *| \********************/ private double _InputL. private double _LearnRate.Forms. private double _OutputL.“Algorithms\CascadeCorrelation.Windows.1.Text.Collections. System.cs” 00000001 00000002 00000003 00000004 00000005 00000006 00000007 00000008 00000009 00000010 00000011 00000012 00000013 00000014 00000015 00000016 00000017 00000018 00000019 00000020 00000021 00000022 00000023 00000024 00000025 00000026 00000027 00000028 00000029 using using using using using using using using using using System.4 .2. namespace _05025397.Generic.

base. int Iter_Max. Reports.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000030 00000031 00000032 00000033 00000034 00000035 00000036 00000037 00000038 00000039 00000040 00000041 00000042 00000043 00000044 00000045 00000046 00000047 00000048 00000049 00000050 00000051 00000052 00000053 00000054 00000055 00000056 00000057 00000058 00000059 /********************\ |* CONSTRUCTOR *| \********************/ public CascadeCorrelation(double LearnRate. base. double iterations. int Reports. (int)_OutputL. txtTest). ITerr) { _LearnRate = LearnRate. out _OutputL). base.ReportInterval.GetStructure(out iterations. txtData. txtTest. getdata. RichTextBox txtData.IterMax). _LearnRate. CCNet = new FANN_Cascade((int)_InputL. saveDllData(txtData. RichTextBox te) { Page 136 of 225 .TargetError. bool ITerr. double TargetError. RichTextBox txtTest) : base(TargetError. Iter_Max. } #endregion #region internal_functions /********************\ |* INTERNAL *| \********************/ private void saveDllData(RichTextBox tr. out _InputL.

output. (int)_OutputL)).Close(). tw.Text). } #endregion #region external_functions /********************\ |* EXTERNAL *| \********************/ public override string network_details() { StringBuilder output = new StringBuilder().William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000060 00000061 00000062 00000063 00000064 00000065 00000066 00000067 00000068 00000069 00000070 00000071 00000072 00000073 00000074 00000075 00000076 00000077 00000078 00000079 00000080 00000081 00000082 00000083 00000084 00000085 00000086 00000087 00000088 00000089 TextWriter tw = new StreamWriter("dlltrdata.Write(te.Append( string. (int)_InputL)). tw. output. tw = new StreamWriter("dlltedata.dat").Append( Page 137 of 225 .Text).00000}".Write(tr. _LearnRate)).dat"). tw. output.Format ("\nLearning Rate: {0:0.Close(). tw.Append( string.Format ("\t\t\t\t\tOutput Layer: {0:d}". output.Format ("Network Details: \n Input Layer: {0:d}".Append( string.

William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000090 00000091 00000092 00000093 00000094 00000095 00000096 00000097 00000098 00000099 00000100 00000101 00000102 00000103 00000104 00000105 00000106 00000107 00000108 00000109 00000110 00000111 00000112 00000113 00000114 00000115 00000116 00000117 00000118 00000119 string. try { success = CCNet. base.IterMax)).Format ("\nReport every {0:d} generations. output. base.Append( string. } public override bool Train() { bool success = true._tr_output).". output. output.ToString().Train(). Report(CCNet. return output. base.00000}".Format ("\t\tMaximum Nodes: {0:d}".Append( string.Format ("\t\t\t\t\t\tIgnore target error " + "(process all iterations): {0}".Format ("\t\t\tTarget Error: {0:0.Append( string. _ITerr)). } catch { Page 138 of 225 .ReportInterval)).TargetError)).

OK. } success = getGraphDataFromDll(). MessageBoxIcon. } public bool getGraphDataFromDll() { bool success = true. for (int i = 0. try { double[] besterrlist = CCNet. "Error".Show("Error running Cascade training!".Length.Add((double)i. } Page 139 of 225 . MessageBoxButtons.Error).OK. } } catch { MessageBox. i++) { base. besterrlist[i]). success = false.BestErrList. return success._Trained = success. success = false. MessageBoxIcon.besterrorlist.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000120 00000121 00000122 00000123 00000124 00000125 00000126 00000127 00000128 00000129 00000130 00000131 00000132 00000133 00000134 00000135 00000136 00000137 00000138 00000139 00000140 00000141 00000142 00000143 00000144 00000145 00000146 00000147 00000148 00000149 MessageBox.Show("Error getting graph data from DLL". base. MessageBoxButtons.Error). i < besterrlist. "Error".

Error). try { success = CCNet. Report(CCNet. } #endregion } Page 140 of 225 . MessageBoxIcon. return success._te_output).Show("Error running Cascade testing!".OK. "Error". MessageBoxButtons.Test(). success = false.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000150 00000151 00000152 00000153 00000154 00000155 00000156 00000157 00000158 00000159 00000160 00000161 00000162 00000163 00000164 00000165 00000166 00000167 00000168 00000169 00000170 00000171 00000172 00000173 } return success. } base. } catch { MessageBox._Tested = success. } public override bool Test() { bool success = true.

_05025397.Collections.Algorithms { public class GeneticAlgorithm : TrainingAlgorithm { #region data /********************\ |* DATA *| \********************/ //GA Data private int _PopSize. System. System.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 9. System. ZedGraph. private int _Mutation.cs” 00000001 00000002 00000003 00000004 00000005 00000006 00000007 00000008 00000009 00000010 00000011 00000012 00000013 00000014 00000015 00000016 00000017 00000018 00000019 00000020 00000021 00000022 00000023 00000024 00000025 00000026 00000027 00000028 00000029 using using using using using using using using System.Forms. private double _OutputL. private int _HiddenL.Collections.Windows. namespace _05025397. private int _Crossover.5 . //Network Data private double _InputL.Text.“Algorithms\GeneticAlgorithm.Linq. System.Controller.1.Generic.2. //Population Page 141 of 225 . System.

out _InputL. RichTextBox txtData. txtData. txtTest. RichTextBox txtTest) : base(TargetError. out _OutputL).GetStructure(out iterations. _Mutation = Mutation. i < _PopSize. getdata. Reports. Iter_Max. #endregion #region constructor /********************\ |* CONSTRUCTOR *| \********************/ public GeneticAlgorithm(int PopSize. for (int i = 0. int Reports. int Crossover. ITerr) { _PopSize = PopSize. //Init Network params double iterations. i++) { Population.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000030 00000031 00000032 00000033 00000034 00000035 00000036 00000037 00000038 00000039 00000040 00000041 00000042 00000043 00000044 00000045 00000046 00000047 00000048 00000049 00000050 00000051 00000052 00000053 00000054 00000055 00000056 00000057 00000058 00000059 ArrayList Population. double TargetError. _Crossover = Crossover. int HiddenL. //Create new population references Population = new ArrayList(_PopSize). _HiddenL = HiddenL. bool ITerr. int Iter_Max. int Mutation.Add Page 142 of 225 .

getdata. Rand. results).GetScaledTrainingData(out inputs. for (int i = 0.Next())).IterMax. out results). } } #endregion #region internal_functions /********************\ |* INTERNAL *| \********************/ private bool run() { bool success = true. j++) { ((Model. Page 143 of 225 .GANetwork) Population[j]). j < _PopSize. double[][] results. success = sort_fitnesses(). _HiddenL. } //Sort the functions according to fitness now. double[][] inputs. i < base. (int)_OutputL.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000060 00000061 00000062 00000063 00000064 00000065 00000066 00000067 00000068 00000069 00000070 00000071 00000072 00000073 00000074 00000075 00000076 00000077 00000078 00000079 00000080 00000081 00000082 00000083 00000084 00000085 00000086 00000087 00000088 00000089 (new Model. i++) { //Get the msqe for (int j = 0.GANetwork( (int)_InputL.getMsQE(inputs.

William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000090 00000091 00000092 00000093 00000094 00000095 00000096 00000097 00000098 00000099 00000100 00000101 00000102 00000103 00000104 00000105 00000106 00000107 00000108 00000109 00000110 00000111 00000112 00000113 00000114 00000115 00000116 00000117 00000118 00000119 //Report if we're at a report iteration //Also update the besterrlist (for graphing) if (base. } private bool sort_fitnesses() { Page 144 of 225 .Add ((double)i.BestErrList.CurIt++.\n"). } base.GANetwork)Population[0]). break. ((Model.CurIt = 0.GANetwork)Population[0]). base.Report("Best error at iteration [ " + i + " ] was " + ((Model.MSqE <= base.MSqE).").TargetError) { Report("\nNetwork matching or improving upon target error"+ "found at iteration [ " + i + " ].GANetwork)Population[0]). base. //Check for having reached the target if (((Model. } success = build_generation().CurIt == ReportInterval) { base. } return success.MSqE + ".

William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000120 00000121 00000122 00000123 00000124 00000125 00000126 00000127 00000128 00000129 00000130 00000131 00000132 00000133 00000134 00000135 00000136 00000137 00000138 00000139 00000140 00000141 00000142 00000143 00000144 00000145 00000146 00000147 00000148 00000149 bool success = true. } catch { MessageBox. double[] weightarray1. } return success. try { Population. //It selects two points from the start of the population //Then applies crossover if necessary (based on probability) Page 145 of 225 .OK. MessageBoxIcon.Error).1). selection2. success = false. } private bool build_generation() { bool success = true. double[] weightarray2. for (int i = (_PopSize .Sort(). "Error". MessageBoxButtons. i--) { //This algorithm is altered from previous versions. int selection1.Show("Error sorting population". i > (int)(_PopSize / 2). double[] weightarray_f.

if (Rand.Next(100) < _Crossover) { //Choose a random position in the weight array //to be our crossover point Page 146 of 225 .William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000150 00000151 00000152 00000153 00000154 00000155 00000156 00000157 00000158 00000159 00000160 00000161 00000162 00000163 00000164 00000165 00000166 00000167 00000168 00000169 00000170 00000171 00000172 00000173 00000174 00000175 00000176 00000177 00000178 00000179 //applies mutation if necessary (same again) //then if neither mutation or Xover have been applied //chooses position 1 or 2.getWeights(). } try { weightarray_f = new double[weightarray1.Length]. and //so on. the least fit) with this new string. weightarray2 = ((Model.getWeights(). success = false. selection2 = Rand. all the way to the middle of the population. selection1 = Rand.".OK. //Then it replaces the last position in the population //(ie.Next((int)_PopSize / 2).Show("Error: 2D weight array length unequal.Length) { MessageBox.Length != weightarray2. weightarray1 = ((Model. "Error".Next((int)_PopSize / 2).Error).GANetwork)Population[selection1]).GANetwork)Population[selection1]). MessageBoxButtons. MessageBoxIcon. //Just a quick error check if (weightarray1. //Next iteration it replaces the next to last.

Next(100) < _Mutation) { //Jiggle the weights in the array //up or down by 0.1)).Length .Next(1. } } //Set the weights of the current member of the //population we're on ((Model.GANetwork)Population[i]). (weightarray1.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000180 00000181 00000182 00000183 00000184 00000185 00000186 00000187 00000188 00000189 00000190 00000191 00000192 00000193 00000194 00000195 00000196 00000197 00000198 00000199 00000200 00000201 00000202 00000203 00000204 00000205 00000206 00000207 00000208 00000209 int XPos = Rand. } else { weightarray_f[j] = weightarray2[j]. j < weightarray_f. j < weightarray1.NextDouble() .Length. j++) { weightarray_f[j] += Rand.setWeights(weightarray_f).5 for (int j = 0.Length. } Page 147 of 225 .0. } } } if (Rand.5. //Simple single point crossover of the weights for (int j = 0. j++) { if (j < XPos) { weightarray_f[j] = weightarray1[j].

} } return success. output.Append( string.Format("Network Details: \n Population: {0:d}". success = false. output. _PopSize)). _Mutation)).Append( string. MessageBoxIcon. output. "Error".Format("\t\t\tMutation Probability: {0:d}".Append( string. output.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000210 00000211 00000212 00000213 00000214 00000215 00000216 00000217 00000218 00000219 00000220 00000221 00000222 00000223 00000224 00000225 00000226 00000227 00000228 00000229 00000230 00000231 00000232 00000233 00000234 00000235 00000236 00000237 00000238 00000239 catch { MessageBox. } #endregion #region external_functions /********************\ |* EXTERNAL *| \********************/ public override string network_details() { //Add stringbuilder for efficiency here StringBuilder output = new StringBuilder(). MessageBoxButtons.Append( Page 148 of 225 .Error). _Crossover)).Format("\t\t\tCrossover Probability: {0:d}".OK.Show("Error building new generation".

base. return output.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000240 00000241 00000242 00000243 00000244 00000245 00000246 00000247 00000248 00000249 00000250 00000251 00000252 00000253 00000254 00000255 00000256 00000257 00000258 00000259 00000260 00000261 00000262 00000263 00000264 00000265 00000266 00000267 00000268 00000269 string.Format("\nHidden layer: {0:d}"._Trained = success.Append( string.TargetError)). success = run(). _ITerr)). output.Format("\t\t\tTarget Error: {0:0. output.Append( string.00000}". output.Append( string. output.ToString(). base.IterMax)). } public override bool Train() { bool success = true. _HiddenL)).Append( string.". return success.Format("\nReport every {0:d} generations.Format("\t\t\t\t\t\t\tIgnore target error (process all iterations): {0}".Format("\t\t\tMaximum Generation: {0:d}". } public override bool Test() Page 149 of 225 . base. base.ReportInterval)).

double[] netoutput. i < tstinput. j < tstinput[i]. j++) { output. j++) { output. getdata.Append("\nOutput achieved was:"). for (int j = 0. for (int j = 0.Append("\n\n\t\t\t~~Network Testing~~").Append(string. } output.Length. netoutput[j])).Run(tstinput[i]). i++) { ((Model. output.Format(" [{0:g}] ". Page 150 of 225 . out tstoutput).Length.Format(" [{0:g}] ". tstinput[i][j])).GANetwork)Population[0]). j < netoutput.Length. output.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000270 00000271 00000272 00000273 00000274 00000275 00000276 00000277 00000278 00000279 00000280 00000281 00000282 00000283 00000284 00000285 00000286 00000287 00000288 00000289 00000290 00000291 00000292 00000293 00000294 00000295 00000296 00000297 00000298 00000299 { bool success = true.GetOutput().Append("\nWith inputs:"). try { for (int i = 0.GetScaledTestingData(out tstinput.Append(string. double[][] tstoutput. netoutput = ((Model. double[][] tstinput.GANetwork)Population[0]). StringBuilder output = new StringBuilder().

for (int j = 0.Report(output. return success. } catch { MessageBox. base.Format(" [{0:g}] ". output.Format ("{0:g}".Length.".getMsQE(tstinput. MessageBoxButtons. (double) ((Model.GANetwork)Population[0]).William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000300 00000301 00000302 00000303 00000304 00000305 00000306 00000307 00000308 00000309 00000310 00000311 00000312 00000313 00000314 00000315 00000316 00000317 00000318 00000319 00000320 00000321 00000322 00000323 00000324 00000325 00000326 00000327 00000328 } } output.Show("Error Running Test.OK.Append( string.tstoutput). "Error".Append(string. MessageBoxIcon. ((Model. tstoutput[i][j])).Append("\nOutput Desired was:"). } base.GANetwork)Population[0]). success = false. } #endregion } Page 151 of 225 .Append("\nMean Squared Error with these inputs and outputs is:"). } } output._Tested = success. j++) { output.ToString()). j < tstoutput[i].MSqE)).Error).

1.Algorithms { public class BackProp : TrainingAlgorithm { #region data /********************\ |* DATA *| \********************/ private double _InputL. System.Generic. #endregion #region constructor Page 152 of 225 . System. private int _HiddenL. FANN_BackProp BPnet. _05025397.2. private double _OutputL. System.Collections. System. ZedGraph.Linq. FANN_Wrapper.“Algorithms\BackProp.cs” 00000001 00000002 00000003 00000004 00000005 00000006 00000007 00000008 00000009 00000010 00000011 00000012 00000013 00000014 00000015 00000016 00000017 00000018 00000019 00000020 00000021 00000022 00000023 00000024 00000025 00000026 00000027 00000028 00000029 using using using using using using using using using using System. namespace _05025397.Text.6 .Windows.Collections.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 9.Forms.IO. System. System. private double _LearnRate.Controller.

(int)_OutputL. BPnet = new FANN_BackProp((int)_InputL. RichTextBox txtData. double LearnRate. Reports. base. int Iter_Max. } #endregion #region internal_functions /********************\ Page 153 of 225 .IterMax). ITerr) { _HiddenL = HiddenL. double TargetError. getdata. int Reports.GetStructure(out iterations. //Copy the training and testing data to the dat files //ready for the DLL's to access.ReportInterval.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000030 00000031 00000032 00000033 00000034 00000035 00000036 00000037 00000038 00000039 00000040 00000041 00000042 00000043 00000044 00000045 00000046 00000047 00000048 00000049 00000050 00000051 00000052 00000053 00000054 00000055 00000056 00000057 00000058 00000059 /********************\ |* CONSTRUCTOR *| \********************/ public BackProp (int HiddenL. out _OutputL). double iterations. out _InputL. txtTest. saveDllData(txtData. txtData. base. HiddenL. bool ITerr. Iter_Max. base. RichTextBox txtTest) : base(TargetError.TargetError. _LearnRate = LearnRate. _LearnRate. txtTest).

(int) _InputL)).Write(tr.Append( string. tw.Append( Page 154 of 225 . output. RichTextBox te) { TextWriter tw = new StreamWriter("dlltrdata.Close().William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000060 00000061 00000062 00000063 00000064 00000065 00000066 00000067 00000068 00000069 00000070 00000071 00000072 00000073 00000074 00000075 00000076 00000077 00000078 00000079 00000080 00000081 00000082 00000083 00000084 00000085 00000086 00000087 00000088 00000089 |* INTERNAL *| \********************/ private void saveDllData(RichTextBox tr.dat").Write(te. } #endregion #region external_functions /********************\ |* EXTERNAL *| \********************/ public override string network_details() { StringBuilder output = new StringBuilder().Format ("\t\t\tOutput Layer: {0:d}". (int) _OutputL)). output.Format ("Network Details: \n Input Layer: {0:d}". tw = new StreamWriter("dlltedata. tw.Close(). tw. output.Text).dat"). tw.Text).Append( string.

". return output.Format ("\nReport every {0:d} generations. _ITerr)).Append( string.Format ("\t\t\tTarget Error: {0:0.Append( string.Append( string.Format ("\nLearning Rate: {0:0.Format ("\t\tMaximum Epoch: {0:d}". base. output. (int) _HiddenL)). output. _LearnRate)). output. base.Format ("\t\t\t\t\t\tIgnore target error " + "(process all iterations): {0}". } public override bool Train() { Page 155 of 225 .Format ("\t\t\tHidden Layer: {0:d}". output. output.TargetError)).IterMax)).Append( string.00000}". base.00000}".William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000090 00000091 00000092 00000093 00000094 00000095 00000096 00000097 00000098 00000099 00000100 00000101 00000102 00000103 00000104 00000105 00000106 00000107 00000108 00000109 00000110 00000111 00000112 00000113 00000114 00000115 00000116 00000117 00000118 00000119 string.ReportInterval)).ToString().Append( string.

Error). } success = getGraphDataFromDll(). "Error". return success. } catch { MessageBox.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000120 00000121 00000122 00000123 00000124 00000125 00000126 00000127 00000128 00000129 00000130 00000131 00000132 00000133 00000134 00000135 00000136 00000137 00000138 00000139 00000140 00000141 00000142 00000143 00000144 00000145 00000146 00000147 00000148 00000149 bool success = true. try { double[] besterrlist = BPnet.Train().Length.besterrorlist.OK._tr_output). i < besterrlist. MessageBoxIcon. Report(BPnet. base. Page 156 of 225 . try { success = BPnet._Trained = success. } public bool getGraphDataFromDll() { bool success = true. i++) { base. for (int i = 0. besterrlist[i]). MessageBoxButtons. success = false.BestErrList.Show("Error running Backprop training!".Add((double)i.

OK.Show("Error running Backprop testing!". success = false.Test().William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000150 00000151 00000152 00000153 00000154 00000155 00000156 00000157 00000158 00000159 00000160 00000161 00000162 00000163 00000164 00000165 00000166 00000167 00000168 00000169 00000170 00000171 00000172 00000173 00000174 00000175 00000176 00000177 00000178 00000179 } } catch { MessageBox. "Error".Show("Error getting graph data from DLL".Error).Error)._Tested = success. } return success.OK. } public override bool Test() { bool success = true. MessageBoxIcon. MessageBoxButtons. try { success = BPnet. return success. Report(BPnet. MessageBoxButtons. success = false. } catch { MessageBox. } #endregion Page 157 of 225 . MessageBoxIcon._te_output). "Error". } base.

Model 9. protected int _hiddennodes.Linq. Page 158 of 225 . _05025397.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000180 00000181 } } 9. System.“Network.cs” 00000001 00000002 00000003 00000004 00000005 00000006 00000007 00000008 00000009 00000010 00000011 00000012 00000013 00000014 00000015 00000016 00000017 00000018 00000019 00000020 00000021 00000022 00000023 00000024 using using using using using using System. protected int _numoutputs.Text. System.Model { public class Network { #region data /********************\ |* DATA *| \********************/ //[layer][node][input] protected double[][][] _inputs. protected double[][] _outputs.3 .Forms.Collections. System. namespace _05025397.Windows.Generic. protected int _numinputs.3. System.1 . protected double[][][] _weights.1.1.

_weights[1] = new double[_hiddennodes][]. } } private void init_hiddenlayer() { _inputs[1] = new double[_hiddennodes][]. for (int i = 0. i < _hiddennodes. i < _numinputs.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000025 00000026 00000027 00000028 00000029 00000030 00000031 00000032 00000033 00000034 00000035 00000036 00000037 00000038 00000039 00000040 00000041 00000042 00000043 00000044 00000045 00000046 00000047 00000048 00000049 00000050 00000051 00000052 00000053 00000054 protected Random Rand. _outputs[1] = new double[_hiddennodes]. i++) { _inputs[0][i] = new double[2]. #endregion #region init /********************\ |* INIT *| \********************/ private void init_inputlayer() { _inputs[0] = new double[_numinputs][]. _weights[0] = new double[_numinputs][]. _outputs[0] = new double[_numinputs]. for (int i = 0. Page 159 of 225 . i++) { _inputs[1][i] = new double[_numinputs + 1]. _weights[0][i] = new double[2]. _weights[1][i] = new double[_numinputs + 1].

} } private void init_bias() { //Input bias for (int i = 0. i < _hiddennodes. i++) { _inputs[2][i] = new double[_hiddennodes + 1].William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000055 00000056 00000057 00000058 00000059 00000060 00000061 00000062 00000063 00000064 00000065 00000066 00000067 00000068 00000069 00000070 00000071 00000072 00000073 00000074 00000075 00000076 00000077 00000078 00000079 00000080 00000081 00000082 00000083 00000084 } } private void init_outputlayer() { _inputs[2] = new double[_numoutputs][]. for (int i = 0. i < _numinputs. _weights[2] = new double[_numoutputs][]. i < _numoutputs. _weights[0][i][1] = 1. Page 160 of 225 . _weights[2][i] = new double[_hiddennodes + 1].0. i++) { _inputs[1][i][_numinputs] = 1.0. _weights[1][i][_numinputs] = 1.0. i++) { _inputs[0][i][1] = 1. _outputs[2] = new double[_numoutputs]. } //Hidden layer bias for (int i = 0.0.

i < _hiddennodes. } } } private void init_outputweights() Page 161 of 225 . i++) { for (int j = 0. i < _numoutputs.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000085 00000086 00000087 00000088 00000089 00000090 00000091 00000092 00000093 00000094 00000095 00000096 00000097 00000098 00000099 00000100 00000101 00000102 00000103 00000104 00000105 00000106 00000107 00000108 00000109 00000110 00000111 00000112 00000113 00000114 } //Output layer bias for (int i = 0. i++) { _weights[0][i][0] = Rand.NextDouble().0.NextDouble(). i < _numinputs. } } private void init_hiddenweights() { for (int i = 0. j++) { _weights[1][i][j] = Rand. i++) { _inputs[2][i][_hiddennodes] = 1.0. _weights[2][i][_hiddennodes] = 1. } } private void init_inputweights() { for (int i = 0. j < _numinputs.

i++) { Page 162 of 225 . } private bool Runinput() { bool success = true.E. -input))). try { //Calculate results for this layer for (int i = 0.NextDouble(). i++) { for (int j = 0. j < _hiddennodes.Pow(Math. } } } #endregion #region internal /********************\ |* INTERNAL *| \********************/ private double sigmoid(double input) { return (1 / (1 + Math.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000115 00000116 00000117 00000118 00000119 00000120 00000121 00000122 00000123 00000124 00000125 00000126 00000127 00000128 00000129 00000130 00000131 00000132 00000133 00000134 00000135 00000136 00000137 00000138 00000139 00000140 00000141 00000142 00000143 00000144 { for (int i = 0. i < _numinputs. j++) { _weights[2][i][j] = Rand.0. i < _numoutputs. double sum = 0.

try { //Feed forward the results from input layer for (int i = 0. j < _numinputs. "Error". j < 2. } private bool Runhidden() { bool success = true. i < _hiddennodes.0.Show("Error processing input layer".William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000145 00000146 00000147 00000148 00000149 00000150 00000151 00000152 00000153 00000154 00000155 00000156 00000157 00000158 00000159 00000160 00000161 00000162 00000163 00000164 00000165 00000166 00000167 00000168 00000169 00000170 00000171 00000172 00000173 00000174 for (int j = 0. } return success.0. MessageBoxIcon.OK. } _outputs[0][i] = sigmoid(sum). MessageBoxButtons. j++) { _inputs[1][i][j] = _outputs[0][j]. sum = 0. j++) { sum += (_inputs[0][i][j] * _weights[0][i][j]). Page 163 of 225 . } } catch { MessageBox. i++) { for (int j = 0. success = false.Error). double sum = 0.

try Page 164 of 225 . } private bool Runoutput() { bool success = true. double sum = 0. } return success.OK.Error). } } catch { MessageBox. i < _hiddennodes. MessageBoxIcon.0. sum = 0. MessageBoxButtons.0. j++) { sum += (_inputs[1][i][j] * _weights[1][i][j]). i++) { for (int j = 0.Show("Error processing hidden layer". j < _numinputs + 1.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000175 00000176 00000177 00000178 00000179 00000180 00000181 00000182 00000183 00000184 00000185 00000186 00000187 00000188 00000189 00000190 00000191 00000192 00000193 00000194 00000195 00000196 00000197 00000198 00000199 00000200 00000201 00000202 00000203 00000204 } } //Calculate results for this layer for (int i = 0. success = false. "Error". } _outputs[1][i] = sigmoid(sum).

i < _numoutputs.Error). MessageBoxButtons. sum = 0. } } catch { MessageBox. success = false. i++) { for (int j = 0. MessageBoxIcon.Show("Error processing output layer".William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000205 00000206 00000207 00000208 00000209 00000210 00000211 00000212 00000213 00000214 00000215 00000216 00000217 00000218 00000219 00000220 00000221 00000222 00000223 00000224 00000225 00000226 00000227 00000228 00000229 00000230 00000231 00000232 00000233 00000234 { //Feed forward the results from hidden layer for (int i = 0. } _outputs[2][i] = sigmoid(sum). } } //Calculate results for this layer for (int i = 0. i++) { for (int j = 0. j++) { sum += (_inputs[2][i][j] * _weights[2][i][j]). j++) { _inputs[2][i][j] = _outputs[1][j]. "Error". i < _numoutputs. j < _hiddennodes.OK. } return success.0. } Page 165 of 225 . j < _hiddennodes + 1.

} if (success) for (int i = 0. success = false. Page 166 of 225 . i++) //Each input node has only one real input //and a bias . if(success) success = Runinput().Error). MessageBoxButtons.Show("Error: Incorrect number of inputs supplied to NN".William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000235 00000236 00000237 00000238 00000239 00000240 00000241 00000242 00000243 00000244 00000245 00000246 00000247 00000248 00000249 00000250 00000251 00000252 00000253 00000254 00000255 00000256 00000257 00000258 00000259 00000260 00000261 00000262 00000263 00000264 #endregion #region external /********************\ |* EXTERNAL *| \********************/ public bool Run(double[] inputs) { bool success = true. MessageBoxIcon. if(success) success = Runhidden().OK. i < _numinputs.Length != _numinputs) { MessageBox. //The numbers of inputs must match up if (inputs.the number of nodes corresponds //to the number of inputs accepted. _inputs[0][i][0] = inputs[i]. "Incorrect number of inputs".

return success. _hiddennodes = hiddennodes. _numoutputs = numoutputs. int numoutputs. //Set network structure descriptors _numinputs = numinputs. //We'll always have 3 layers Page 167 of 225 . int hiddennodes.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000265 00000266 00000267 00000268 00000269 00000270 00000271 00000272 00000273 00000274 00000275 00000276 00000277 00000278 00000279 00000280 00000281 00000282 00000283 00000284 00000285 00000286 00000287 00000288 00000289 00000290 00000291 00000292 00000293 00000294 if(success) success = Runoutput(). } #endregion #region constructor /********************\ |* CONSTRUCTOR *| \********************/ public Network(int numinputs. } public double[] GetOutput() { //Return the outputs from the //output layer return _outputs[2]. int SetRandom) { //Set random number generator Rand = new Random(SetRandom).

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3
00000295 00000296 00000297 00000298 00000299 00000300 00000301 00000302 00000303 00000304 00000305 00000306 00000307 00000308 00000309 00000310 } //Input, Hidden, and Output _inputs = new double[3][][]; _weights = new double[3][][]; _outputs = new double[3][]; init_inputlayer(); init_hiddenlayer(); init_outputlayer(); init_bias(); init_inputweights(); init_hiddenweights(); init_outputweights(); } #endregion }

9.1.3.2 - “GANetwork.cs”
00000001 00000002 00000003 00000004 00000005 00000006 00000007 00000008 00000009 00000010 00000011 00000012 using using using using using using using System; System.Collections.Generic; System.Linq; System.Text; System.Windows.Forms; _05025397; System.Collections;

//This class contains Genetic Algorithm specific functions //in addition to the basic feed foward neural net functionality. namespace _05025397.Model

Page 168 of 225

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3
00000013 { 00000014 00000015 00000016 00000017 00000018 00000019 00000020 00000021 00000022 00000023 00000024 00000025 00000026 00000027 00000028 00000029 00000030 00000031 00000032 00000033 00000034 00000035 00000036 00000037 00000038 00000039 00000040 00000041 00000042

public class GANetwork : Network, IComparable { #region data /********************\ |* DATA *| \********************/ double _MSqE; #endregion #region .NET /********************\ |* .NET *| \********************/ //Interface_Implementation //Return Value Meanings: //-<Zero: x < y //-Zero: x == y //->Zero: x > y public int CompareTo(object a) { GANetwork b; if (a is GANetwork) { b = a as GANetwork; return _MSqE.CompareTo(b.MSqE); }

Page 169 of 225

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3
00000043 00000044 00000045 00000046 00000047 00000048 00000049 00000050 00000051 00000052 00000053 00000054 00000055 00000056 00000057 00000058 00000059 00000060 00000061 00000062 00000063 00000064 00000065 00000066 00000067 00000068 00000069 00000070 00000071 00000072 return 0; } #endregion #region external /********************\ |* EXTERNAL *| \********************/ public void getMsQE(double[][] inputs, double[][] outputs) { double sum = 0.0; int counter = 0; double[] netoutputs = new double[_numoutputs]; for (int i = 0; i < inputs.Length; i++) { base.Run(inputs[i]); netoutputs = base.GetOutput(); for (int j = 0; j < netoutputs.Length; j++) { sum += (outputs[i][j] - netoutputs[j]) * (outputs[i][j] - netoutputs[j]); counter++; } } _MSqE = (sum / counter); }

Page 170 of 225

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3
00000073 00000074 00000075 00000076 00000077 00000078 00000079 00000080 00000081 00000082 00000083 00000084 00000085 00000086 00000087 00000088 00000089 00000090 00000091 00000092 00000093 00000094 00000095 00000096 00000097 00000098 00000099 00000100 00000101 00000102 public double[] getWeights() { ArrayList collater = new ArrayList(); //Collect all the weights in an array list //then spit them out as a 1D array of doubles try { for (int i = 0; i < _weights.Length; i++) { for (int j = 0; j < _weights[i].Length; j++) { for (int k = 0; k < _weights[i][j].Length; k++) { collater.Add(_weights[i][j][k]); } } } } catch { MessageBox.Show("Fatal Error collating weights to 1D array", "Error", MessageBoxButtons.OK, MessageBoxIcon.Error); Application.Exit(); } return (double[])collater.ToArray(typeof(double)); } public void setWeights(double[] weights)

Page 171 of 225

MessageBoxIcon. i++) { for (int j = 0.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000103 00000104 00000105 00000106 00000107 00000108 00000109 00000110 00000111 00000112 00000113 00000114 00000115 00000116 00000117 00000118 00000119 00000120 00000121 00000122 00000123 00000124 00000125 00000126 00000127 00000128 00000129 00000130 00000131 00000132 { //Take a 1D array of doubles and apply //to the correct positions in our weights //array try { for (int i = 0. j < _weights[i]. k++.Exit(). i < _weights.Show("Fatal Error adding 1D weight array to 3D weight array".OK. wc = 0. k < _weights[i][j]. } } } } catch { MessageBox.Length. MessageBoxButtons. Application.Error). j++) { for (int k = 0. wc++) { _weights[i][j][k] = weights[wc]. "Error". } } /********************\ |* GETTERS/SETTERS *| \********************/ public double MSqE { Page 172 of 225 .Length.Length.

SetRandom) { MSqE = 0.0. Noutputs. int Nhnodes. } } #endregion #region constructor /********************\ |* CONSTRUCTOR *| \********************/ public GANetwork(int Ninputs. } #endregion } Page 173 of 225 . } set { _MSqE = value.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000133 00000134 00000135 00000136 00000137 00000138 00000139 00000140 00000141 00000142 00000143 00000144 00000145 00000146 00000147 00000148 00000149 00000150 00000151 } get { return _MSqE. int Noutputs. int SetRandom) : base(Ninputs. Nhnodes.

namespace FANN_Wrapper { public ref class FANN_Cascade //Managed wrapper for UnManaged_FANN_CasC //which is a C++ interface to the C programmed //FANN dll.1.h" using namespace System.4 .h” 00000001 00000002 00000003 00000004 00000005 00000006 00000007 00000008 00000009 00000010 00000011 00000012 00000013 00000014 00000015 00000016 00000017 00000018 00000019 00000020 00000021 00000022 00000023 00000024 00000025 00000026 #pragma once #include "UnManaged_FANN_BackProp.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 9.h" #include "UnManaged_FANN_CasC. double TargetErr. Page 174 of 225 .DLL Wrapper for FANN functions 9.1 . { public: /********************\ |* DATA *| \********************/ UnManaged_FANN_CasC* UMWrapper.4.“FANN_Wrapper. public: /********************\ |* EXTERNAL *| \********************/ FANN_Cascade(int InputL.1. int OutputL. using namespace System::Runtime::InteropServices. double LearnRate.

Page 175 of 225 . int ~FANN_Cascade(void).William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000027 00000028 00000029 00000030 00000031 00000032 00000033 00000034 00000035 00000036 00000037 00000038 00000039 00000040 00000041 00000042 00000043 00000044 00000045 00000046 00000047 00000048 00000049 00000050 00000051 00000052 00000053 00000054 00000055 00000056 int ReportInterval. } } property String^ _tr_output { String^ get() { return gcnew String((wchar_t *) UMWrapper->get_report_train()). } } property array<double>^ besterrorlist { array<double>^ get() MaxNeurons). !FANN_Cascade(void). bool Train(void). public: /********************\ |* GETTERS/SETTERS *| \********************/ property String^ _te_output { String^ get() { return gcnew String((wchar_t *) UMWrapper->get_report_test()). bool Test(void).

William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000057 00000058 00000059 00000060 00000061 00000062 00000063 00000064 00000065 00000066 00000067 00000068 00000069 00000070 00000071 00000072 00000073 00000074 00000075 00000076 00000077 00000078 00000079 00000080 00000081 00000082 00000083 00000084 00000085 00000086 { int size. i < size. i++) { arout[i] = ar[i]. } return arout. { public: /********************\ |* DATA *| \********************/ UnManaged_FANN_Backprop* UMWrapper. array<double>^ arout = gcnew array<double>(size). const double *ar = UMWrapper->get_besterrs(size). for(int i = 0. public: Page 176 of 225 . public ref class FANN_BackProp //Managed wrapper for UnManaged_FANN_Backprop //which is a C++ interface to the C programmed //FANN dll. } } }.

public: /********************\ |* GETTERS/SETTERS *| \********************/ property String^ _te_output { String^ get() { return gcnew String((wchar_t *) UMWrapper->get_report_test()). bool Train(void). int OutputL. } } property String^ _tr_output { String^ get() { return gcnew String((wchar_t *) UMWrapper->get_report_train()). int MaximumIteration). } Page 177 of 225 . int ReportInterval. bool Test(void).William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000087 00000088 00000089 00000090 00000091 00000092 00000093 00000094 00000095 00000096 00000097 00000098 00000099 00000100 00000101 00000102 00000103 00000104 00000105 00000106 00000107 00000108 00000109 00000110 00000111 00000112 00000113 00000114 00000115 00000116 /********************\ |* EXTERNAL *| \********************/ FANN_BackProp(int InputL. double LearnRate. !FANN_BackProp(void). double TargetErr. int HiddenL. ~FANN_BackProp(void).

const double *ar = UMWrapper->get_besterrs(size).William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000117 00000118 00000119 00000120 00000121 00000122 00000123 00000124 00000125 00000126 00000127 00000128 00000129 00000130 00000131 00000132 00000133 00000134 00000135 00000136 00000137 00000138 00000139 } } property array<double>^ besterrorlist { array<double>^ get() { int size. Page 178 of 225 . } } }. } return arout. array<double>^ arout = gcnew array<double>(size). i < size. for(int i = 0. i++) { arout[i] = ar[i].

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3

9.1.4.2 - “FANN_Wrapper.cpp”
00000001 00000002 00000003 00000004 00000005 00000006 00000007 00000008 00000009 00000010 00000011 00000012 00000013 00000014 00000015 00000016 00000017 00000018 00000019 00000020 00000021 00000022 00000023 00000024 00000025 00000026 00000027 00000028 00000029 #include "stdafx.h" #include "FANN_Wrapper.h" namespace FANN_Wrapper { /********************\ |* FANN_BackProp *| \********************/ //Constructor FANN_BackProp::FANN_BackProp(int InputL, int HiddenL, int OutputL, double LearnRate, double TargetErr, int ReportInterval, int MaximumIteration) { UMWrapper = new UnManaged_FANN_Backprop( InputL, HiddenL, OutputL, LearnRate, TargetErr, ReportInterval, MaximumIteration); } //Destructor FANN_BackProp::~FANN_BackProp(void) { if (UMWrapper) { delete UMWrapper; UMWrapper = 0; } }

Page 179 of 225

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3
00000030 00000031 00000032 00000033 00000034 00000035 00000036 00000037 00000038 00000039 00000040 00000041 00000042 00000043 00000044 00000045 00000046 00000047 00000048 00000049 00000050 00000051 00000052 00000053 00000054 00000055 00000056 00000057 00000058 00000059

//Finalizer FANN_BackProp::!FANN_BackProp(void) { if (UMWrapper) { delete UMWrapper; UMWrapper = 0; } }

//Train bool FANN_BackProp::Train(void) { return UMWrapper->Train(); } //Test bool FANN_BackProp::Test(void) { return UMWrapper->Test(); } /********************\ |* FANN_Cascade *| \********************/ //Constructor FANN_Cascade::FANN_Cascade(int InputL, int OutputL,

Page 180 of 225

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3
00000060 00000061 00000062 00000063 00000064 00000065 00000066 00000067 00000068 00000069 00000070 00000071 00000072 00000073 00000074 00000075 00000076 00000077 00000078 00000079 00000080 00000081 00000082 00000083 00000084 00000085 00000086 00000087 00000088 00000089 double LearnRate, double TargetErr, int ReportInterval, int MaxNeurons) { UMWrapper = new UnManaged_FANN_CasC( InputL, OutputL, LearnRate, TargetErr, ReportInterval, MaxNeurons); } //Destructor FANN_Cascade::~FANN_Cascade(void) { if (UMWrapper) { delete UMWrapper; UMWrapper = 0; } } //Finalizer FANN_Cascade::!FANN_Cascade(void) { if (UMWrapper) { delete UMWrapper; UMWrapper = 0; } } //Train

Page 181 of 225

William Sayers

05025397

Genetic Algorithms and Neural Networks
Milestone 3
00000090 00000091 00000092 00000093 00000094 00000095 00000096 00000097 00000098 00000099 00000100 } bool FANN_Cascade::Train(void) { return UMWrapper->Train(); } //Test bool FANN_Cascade::Test(void) { return UMWrapper->Test(); }

Page 182 of 225

int _OutputL. //Output for C# Page 183 of 225 . int _ReportInterval.1.h> #include <fann_cpp.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 9. int _MaximumIteration. int _HiddenL.4. double _TargetErr.3 .“UnManaged_FANN_BackProp. { private: /********************\ |* DATA *| \********************/ //Network Structure int _InputL.h> class UnManaged_FANN_Backprop //An interface to the C programmed //FANN dll. //Training Parameters double _LearnRate.h” 00000001 00000002 00000003 00000004 00000005 00000006 00000007 00000008 00000009 00000010 00000011 00000012 00000013 00000014 00000015 00000016 00000017 00000018 00000019 00000020 00000021 00000022 00000023 00000024 00000025 00000026 00000027 00000028 00000029 #pragma once #include <iostream> #include <string> #include <sstream> #include <vector> #include <doublefann. double _Momentum.

00000048 int ReportInterval. 00000047 double LearnRate. int OutputL. 00000032 wchar_t *wchoutput. 00000033 00000034 std::vector<double> vecbsterr. 00000039 struct fann_train_data *data. int MaximumIteration). 00000056 bool Test(void). 00000052 00000053 //Interface functions 00000054 //accessed from C# 00000055 bool Train(void). 00000040 00000041 public: 00000042 /********************\ 00000043 |* EXTERNAL *| 00000044 \********************/ 00000045 //Constructor 00000046 UnManaged_FANN_Backprop(int InputL. 00000057 00000058 public: 00000059 /********************\ Page 184 of 225 . int HiddenL.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000030 std::wstringstream tr_output. 00000036 00000037 //FANN Data 00000038 struct fann *ann. 00000035 double *bsterr. 00000031 std::wstringstream te_output. 00000049 00000050 //Destructor 00000051 ~UnManaged_FANN_Backprop(void). double TargetErr.

const wchar_t* get_report_test(void). const double* get_besterrs(int &size). |* GETTERS/SETTERS *| \********************/ const wchar_t* get_report_train(void). Page 185 of 225 .William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000060 00000061 00000062 00000063 00000064 00000065 00000066 }.

cpp” 00000001 00000002 00000003 00000004 00000005 00000006 00000007 00000008 00000009 00000010 00000011 00000012 00000013 00000014 00000015 00000016 00000017 00000018 00000019 00000020 00000021 00000022 00000023 00000024 00000025 00000026 00000027 00000028 00000029 #include "StdAfx.4 . double TargetErr. _LearnRate = LearnRate. _HiddenL = HiddenL.h" //Constructor UnManaged_FANN_Backprop::UnManaged_FANN_Backprop (int InputL. bsterr = NULL. Page 186 of 225 . int MaximumIteration) { _InputL = InputL. wchoutput = NULL.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 9. _TargetErr = TargetErr. _OutputL = OutputL. int OutputL. int ReportInterval. data = NULL.4. int HiddenL. } //Destructor UnManaged_FANN_Backprop::~UnManaged_FANN_Backprop() { fann_destroy_train(data). _ReportInterval = ReportInterval. double LearnRate.1.“UnManaged_FANN_BackProp.h" #include "UnManaged_FANN_BackProp. ann = NULL. _MaximumIteration = MaximumIteration.

bsterr = NULL. delete wchoutput. bool success = true. ann = fann_create_standard(3. _OutputL)..William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000030 00000031 00000032 00000033 00000034 00000035 00000036 00000037 00000038 00000039 00000040 00000041 00000042 00000043 00000044 00000045 00000046 00000047 00000048 00000049 00000050 00000051 00000052 00000053 00000054 00000055 00000056 00000057 00000058 00000059 delete bsterr.) { throw(""). } //Train bool UnManaged_FANN_Backprop::Train(void) { static int firstrun = false. _HiddenL. wchoutput = NULL. _InputL.. } catch(. int reportcounter = 0. double error. success = false. try { data = fann_read_train_from_file("dlltrdata. } if (fann_num_input_train_data(data) != _InputL) Page 187 of 225 .dat").

FANN_SIGMOID).William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000060 00000061 00000062 00000063 00000064 00000065 00000066 00000067 00000068 00000069 00000070 00000071 00000072 00000073 00000074 00000075 00000076 00000077 00000078 00000079 00000080 00000081 00000082 00000083 00000084 00000085 00000086 00000087 00000088 00000089 { throw(""). FANN_TRAIN_BATCH). FANN_SIGMOID). 1). fann_set_activation_function_output (ann. //Sigmoid Activation Functions (the same one //the GA uses). fann_set_activation_function_hidden (ann. } if (fann_num_output_train_data(data) != _OutputL) { throw(""). success = false. success = false. //Set the learning rate fann_set_learning_rate(ann. 1). (float) _LearnRate). } fann_set_activation_steepness_hidden(ann. fann_set_activation_steepness_output(ann. //Standard backprop fann_set_training_algorithm(ann. //Same range the GA's weights are //initialised too Page 188 of 225 .

0). } reportcounter++. i < _MaximumIteration. } } fann_destroy_train(data). if (error < _TargetErr) { tr_output << "\nNetwork matching or improving upon target error" << "found at iteration [ " << i << " ].". 0.push_back(error).\n". 1. Page 189 of 225 .0. //Training Loop for (int i = 0. vecbsterr. reportcounter = 0. i++) { //Train one epoch then check the //mean squared error error = (double) fann_train_epoch(ann. if (reportcounter == _ReportInterval) { tr_output << "Best error at iteration [ " << i << " ] was " << error << ". i = _MaximumIteration + 1.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000090 00000091 00000092 00000093 00000094 00000095 00000096 00000097 00000098 00000099 00000100 00000101 00000102 00000103 00000104 00000105 00000106 00000107 00000108 00000109 00000110 00000111 00000112 00000113 00000114 00000115 00000116 00000117 00000118 00000119 fann_randomize_weights(ann. data).

te_output << "\nWith inputs". j++) { te_output << " [" << data->input[i][j] << "] ". double *error = NULL. for (unsigned int i = 0. } te_output << "\nOutput achieved was". return true. 0. te_output << "\n\n\t\t\t~~Network Testing~~".William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000120 00000121 00000122 00000123 00000124 00000125 00000126 00000127 00000128 00000129 00000130 00000131 00000132 00000133 00000134 00000135 00000136 00000137 00000138 00000139 00000140 00000141 00000142 00000143 00000144 00000145 00000146 00000147 00000148 00000149 firstrun = true. j < _OutputL. j < _InputL. data = fann_read_train_from_file("dlltedata. j++) { Page 190 of 225 . fann_scale_train_data(data. for (int j = 0.dat"). i < fann_length_train_data(data). error = new double[fann_length_train_data(data)]. for (int j = 0. } //Test bool UnManaged_FANN_Backprop::Test(void) { fann_type *calc_out = NULL. data->input[i]). 1). i++) { calc_out = fann_run(ann.

for (int j = 0. } } te_output << "\nMean Squared Error with these inputs and outputs is:".length() + 1].str(). j++) { te_output << " [" << data->output[i][j] << "] ". } //get_report const wchar_t* UnManaged_FANN_Backprop::get_report_train(void) { if (wchoutput != NULL) { delete wchoutput.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000150 00000151 00000152 00000153 00000154 00000155 00000156 00000157 00000158 00000159 00000160 00000161 00000162 00000163 00000164 00000165 00000166 00000167 00000168 00000169 00000170 00000171 00000172 00000173 00000174 00000175 00000176 00000177 00000178 00000179 te_output << " [" << calc_out[j] << "] ". } te_output << "\nOutput Desired was". te_output << fann_test_data(ann. Page 191 of 225 . } wchoutput = new wchar_t[tr_output. delete error. data). delete calc_out. return true. wchoutput = NULL. wcscpy(wchoutput. j < _OutputL.c_str()). tr_output.str().

William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000180 00000181 00000182 00000183 00000184 00000185 00000186 00000187 00000188 00000189 00000190 00000191 00000192 00000193 00000194 00000195 00000196 00000197 00000198 00000199 00000200 00000201 00000202 00000203 00000204 00000205 00000206 00000207 00000208 00000209 return wchoutput.length() + 1]. wcscpy(wchoutput. size = vecbsterr. wchoutput = NULL.c_str()).size().str(). } //get_besterrs const double* UnManaged_FANN_Backprop::get_besterrs(int &size) { if (bsterr == NULL) { delete bsterr. Page 192 of 225 .str(). return wchoutput. te_output.size()]. } bsterr = new double[vecbsterr. bsterr = NULL. } wchoutput = new wchar_t[te_output. } const wchar_t* UnManaged_FANN_Backprop::get_report_test(void) { if (wchoutput != NULL) { delete wchoutput.

“UnManaged_FANN_CasC.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000210 00000211 00000212 00000213 00000214 00000215 00000216 00000217 00000218 00000219 } for (unsigned int i = 0.5 . i++) { bsterr[i] = vecbsterr[i].4.clear().1.h” 00000001 00000002 00000003 00000004 00000005 00000006 00000007 00000008 00000009 00000010 00000011 00000012 00000013 00000014 00000015 00000016 00000017 00000018 #pragma once #include <iostream> #include <string> #include <sstream> #include <vector> #include <doublefann.h> class UnManaged_FANN_CasC { public: /********************\ |* DATA *| \********************/ //Network Structure int _InputL. return bsterr. int _OutputL. //Training Parameters Page 193 of 225 . } vecbsterr. i < vecbsterr.size(). 9.

Page 194 of 225 . 00000026 std::wstringstream te_output. 00000021 int _ReportInterval. 00000034 struct fann_train_data *data. 00000043 00000044 //Constructor 00000045 UnManaged_FANN_CasC 00000046 (int InputL. 00000022 int _MaxNeurons. 00000023 00000024 //Output for C# 00000025 static std::wstringstream tr_output. 00000031 00000032 //FANN Data 00000033 struct fann *ann. int OutputL. 00000048 int ReportInterval. 00000035 00000036 public: 00000037 /********************\ 00000038 |* EXTERNAL *| 00000039 \********************/ 00000040 00000041 //Destructor 00000042 ~UnManaged_FANN_CasC(void). 00000047 double LearnRate. 00000020 double _TargetErr. double TargetErr.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000019 double _LearnRate. 00000030 double *bsterr. 00000027 wchar_t *wchoutput. 00000028 00000029 static std::vector<double> vecbsterr. int MaxNeurons).

struct fann_train_data *train. 00000054 00000055 static int FANN_API Report_Callback 00000056 (struct fann *ann. 00000068 }. unsigned int epochs_between_reports. 00000059 00000060 public: 00000061 /********************\ 00000062 |* GETTERS/SETTERS *| 00000063 \********************/ 00000064 const wchar_t* get_report_train(void). unsigned int epochs). Page 195 of 225 . 00000065 const wchar_t* get_report_test(void). 00000066 00000067 const double* get_besterrs(int &size).William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000049 00000050 //Interface functions 00000051 //accessed from C# 00000052 bool Train(void). 00000058 float desired_error. 00000053 bool Test(void). 00000057 unsigned int max_epochs.

h" //Static variable declarations std::wstringstream UnManaged_FANN_CasC::tr_output. wchoutput = NULL.6 . _TargetErr = TargetErr.4. int ReportInterval.1. ann = NULL. int OutputL. data = NULL.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 9. //Constructor UnManaged_FANN_CasC::UnManaged_FANN_CasC (int InputL. std::vector<double> UnManaged_FANN_CasC::vecbsterr.“UnManaged_FANN_CasC. _MaxNeurons = MaxNeurons.h" #include "UnManaged_FANN_CasC. bsterr = NULL. int MaxNeurons) { _InputL = InputL.cpp” 00000001 00000002 00000003 00000004 00000005 00000006 00000007 00000008 00000009 00000010 00000011 00000012 00000013 00000014 00000015 00000016 00000017 00000018 00000019 00000020 00000021 00000022 00000023 00000024 00000025 00000026 00000027 00000028 00000029 #include "StdAfx. _OutputL = OutputL. double TargetErr. _LearnRate = LearnRate. } //Destructor UnManaged_FANN_CasC::~UnManaged_FANN_CasC(void) Page 196 of 225 . double LearnRate. _ReportInterval = ReportInterval.

wcscpy(wchoutput. delete wchoutput.str(). return wchoutput.length() + 1]. Page 197 of 225 .William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000030 00000031 00000032 00000033 00000034 00000035 00000036 00000037 00000038 00000039 00000040 00000041 00000042 00000043 00000044 00000045 00000046 00000047 00000048 00000049 00000050 00000051 00000052 00000053 00000054 00000055 00000056 00000057 00000058 00000059 { delete bsterr.str(). } const wchar_t* UnManaged_FANN_CasC::get_report_test(void) { if (wchoutput != NULL) { delete wchoutput. wchoutput = NULL. } wchoutput = new wchar_t[tr_output. bsterr = NULL. fann_destroy_train(data).c_str()). tr_output. wchoutput = NULL. } //get_report const wchar_t* UnManaged_FANN_CasC::get_report_train(void) { if (wchoutput != NULL) { delete wchoutput.

William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000060 00000061 00000062 00000063 00000064 00000065 00000066 00000067 00000068 00000069 00000070 00000071 00000072 00000073 00000074 00000075 00000076 00000077 00000078 00000079 00000080 00000081 00000082 00000083 00000084 00000085 00000086 00000087 00000088 00000089 wchoutput = NULL. } wchoutput = new wchar_t[te_output.c_str()). for (unsigned int i = 0.size()]. te_output. return bsterr. return wchoutput. wcscpy(wchoutput.length() + 1]. } bsterr = new double[vecbsterr.size(). } //get_besterrs const double* UnManaged_FANN_CasC::get_besterrs(int &size) { if (bsterr == NULL) { delete bsterr.size().clear().str(). } vecbsterr. } Page 198 of 225 . bsterr = NULL. i++) { bsterr[i] = vecbsterr[i].str(). size = vecbsterr. i < vecbsterr.

. _OutputL). 00000094 00000095 ann = fann_create_shortcut(2.0). 00000100 } 00000101 catch(.) 00000102 { 00000103 throw(""). 2. 00000118 00000119 fann_set_quickprop_mu(ann. _InputL. 00000096 00000097 try 00000098 { 00000099 data = fann_read_train_from_file("dlltrdata. (float)_LearnRate).dat"). 00000104 } 00000105 00000106 if (fann_num_input_train_data(data) != _InputL) 00000107 throw(""). 0. 00000108 00000109 if (fann_num_output_train_data(data) != _OutputL) 00000110 throw(""). 00000116 00000117 fann_set_quickprop_decay(ann. 00000111 00000112 fann_set_learning_rate(ann. Page 199 of 225 .0).William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000090 //Train 00000091 bool UnManaged_FANN_CasC::Train() 00000092 { 00000093 int reportcounter = 0.. 00000113 00000114 //Some more network customisation here 00000115 //might be nice in future.

William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000120 00000121 fann_set_cascade_weight_multiplier(ann. FANN_SIGMOID). _MaxNeurons. 00000131 00000132 fann_set_activation_function_hidden(ann. data. FANN_TRAIN_QUICKPROP). 1). _ReportInterval. 00000142 00000143 fann_cascadetrain_on_data(ann. 00000138 fann_set_cascade_candidate_change_fraction(ann. 0. FANN_STOPFUNC_MSE). FANN_SIGMOID). 00000135 00000136 fann_randomize_weights(ann. 00000124 00000125 fann_set_activation_steepness_output(ann. 00000139 fann_set_train_stop_function(ann. 00000144 00000145 return true. 1). 00000146 } 00000147 00000148 //Callback for reporting 00000149 int FANN_API UnManaged_FANN_CasC::Report_Callback Page 200 of 225 . 00000137 fann_set_cascade_output_change_fraction(ann. 00000127 00000128 fann_set_learning_rate(ann. 00000126 fann_set_activation_steepness_hidden(ann. (float) _LearnRate). 00000129 00000130 fann_set_training_algorithm(ann.0). 150).01f). 00000122 00000123 fann_set_cascade_max_out_epochs(ann. 1. 0. UnManaged_FANN_CasC::Report_Callback).01f). 00000133 00000134 fann_set_activation_function_output(ann. 1). (float) _TargetErr).0. 00000140 00000141 fann_set_callback(ann. 0.

\n". return 0. struct fann_train_data *train.push_back(MSqE). 0. fann_scale_train_data(data. float desired_error.". if (MSqE <= desired_error) { tr_output << "\nNetwork matching or improving upon target error" << "found at node [ " << node << " ]. static int node = 1. unsigned int epochs_between_reports. Page 201 of 225 . 1). } //Test bool UnManaged_FANN_CasC::Test() { fann_type *calc_out = NULL. unsigned int epochs) { double MSqE = fann_get_MSE(ann).dat"). double *error = NULL. tr_output << "Best error at node [ " << node << " ] was " << MSqE << ".William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000150 00000151 00000152 00000153 00000154 00000155 00000156 00000157 00000158 00000159 00000160 00000161 00000162 00000163 00000164 00000165 00000166 00000167 00000168 00000169 00000170 00000171 00000172 00000173 00000174 00000175 00000176 00000177 00000178 00000179 (struct fann *ann. vecbsterr. unsigned int max_epochs. data = fann_read_train_from_file("dlltedata. } node++.

j < _OutputL. } te_output << "\nOutput Desired was:". te_output << "\n\n\t\t\t~~Network Testing~~". NULL). j++) { te_output << " [" << data->input[i][j] << "] ". } } te_output << "\nMean Squared Error with these inputs and outputs is:". } te_output << "\nOutput achieved was:". Page 202 of 225 . for (int j = 0. te_output << "\nWith inputs:". for (unsigned int i = 0. te_output << fann_test_data(ann. data->input[i]). for (int j = 0.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000180 00000181 00000182 00000183 00000184 00000185 00000186 00000187 00000188 00000189 00000190 00000191 00000192 00000193 00000194 00000195 00000196 00000197 00000198 00000199 00000200 00000201 00000202 00000203 00000204 00000205 00000206 00000207 00000208 00000209 fann_set_callback(ann. for (int j = 0. data). j < _InputL. j++) { te_output << " [" << calc_out[j] << "] ". i++) { calc_out = fann_run(ann. j++) { te_output << " [" << data->output[i][j] << "] ". i < fann_length_train_data(data). j < _OutputL. error = new double[fann_length_train_data(data)].

William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 00000210 00000211 00000212 00000213 00000214 00000215 } delete error. delete calc_out. Page 203 of 225 . return true.

William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 9.2 . Page 204 of 225 .UML Class Diagram The class diagram on the following pages represents the structure of the various classes within the program and how they are combined together to create a whole.

William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Page 205 of 225 .

William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Page 206 of 225 .

edu/ga/ o Accessed: 31/10/2008 Page 207 of 225 .Libraries Researched • GALib o Matthew Wall o http://lancet.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 -BackProp Previous Page -CascadeCorrelation 1 FANN_Cascade -UMWrapper +FANN_Cascade(in AllDataToFillAttributes) +Train() : bool +Test() : bool 1 -UMWrapper 1 FANN_BackProp +FANN_BackProp(in AllDataToFillAttributes) +Train() : bool +Test() : bool 1 1 1 UnManaged_FANN_BackProp -_InputL : int -_HiddenL : int -_OutputL : int -_LearnRate : double -_TargetErr : double -_ReportInterval : int -_MaximumIteration : int -_Momentum : double -tr_output -te_output -wchoutput -vecbsterr -bsterr -ann -data +UnManaged_FANN_Backprop(in AddDataToFillAttributes) +~UnManaged_FANN_Backprop() +Train() : bool +Test() : bool UnManaged_FANN_CasC -_InputL : int -_OutputL : int -_LearnRate : double -_TargetErr : double -_ReportInterval : int -_MaxNeurons : int -tr_output -te_output -wchoutput -vecbsterr -bsterr -ann -data +UnManaged_FANN_CasC(in AllDataToAFillAttributes) +~UnManaged_FANN_CasC() +Train() : bool +Test() : bool +Report_Callback(in Attributes) : int 1 1 1 1 FANN_Library 9.mit.3 .

Franklin o http://ieee.edu/au/~daniel/software/libneural/ o Accessed: 31/10/2008 • Libann o Anonymous o http://www.com/flood/ o Accessed: 31/10/2008 • Annie o Asim Shankar o http://annie.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 • Libneural o D.sourceforge.nongnu.net/ o Accessed: 31/10/2008 • FANN (Fast Artificial Neural Network Library) o Steffen Nissen Page 208 of 225 .html o Accessed: 31/10/2008 • Flood o Roberto Lopez o http://www.org/libann/index.uow.cimne.

uk/pub/PRNN/README.ac.4 .Datasets • XOR 1 0 1 0 1 1 1 1 0 0 0 0 • • Fishers Iris Data o http://www.dk/fann/index.html Page 209 of 225 .ox.math.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 o http://leenissen.php o Accessed: 31/10/2008 9.xhtml Virus Classification o http://www.edu/stat/data/Fisher.stats.uah.

Page 210 of 225 . and a document describing its implementation and usage. and in which cases these methods are suitable. Research current information on training neural networks using genetic algorithms. Using above application. evaluate training methods for neural networks. Deliverable two: An application meeting the requirements of objectives three and four. Build a user-interface for the aforementioned application allowing for easy alteration of appropriate variables. Build an application that is capable of training a neural network with a genetic algorithm and with a backpropagation system. Identify the most effective ways of training neural networks using genetic algorithms. and the conclusions derived from that evaluation. and that allows manual adjustment of relevant variables. Deliverable three: A document detailing and explaining the evaluation of different training techniques. • • • Deliverable one: A research document describing and detailing the research done for objectives one and two. as well as previous research.5 .William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 9.Objectives FINAL YEAR DEGREE PROJECT Project Objectives & Deliverables • • • • • • Research the fields of genetic algorithms and neural networks.

Curved trajectory prediction using a self-organizing neural network.edu/user/sef/www/publications/cascor-tr. S. (2001). S. The Cascade-Correlation Learning Architecture.cs. S.cmu. Davis. Retrieved April 13. (2007. from http://www.edu/~chris2d/papers/CED_thesis. Retrieved April 16. 2009.csharpcorner.aifb. (1988). 356-358). Wiley Professional Computing. Seeman.pdf Fahlman.Works Cited Barber.cs.cmu. from C# Corner: http://www. Carnegie Mellon: http://www-2. Retrieved April 16. Neural Network in C++. E. (1995). J. M. (2006). Bourg. C. 2009.cs.. from Codeproject: www. Graphics processing unit computation of neural networks.edu/afs/cs. A. (1859). AI: Neural Network for Beginners pt.aspx Page 211 of 225 . 2009.de/~jbr/Papers/GaNNOverview. E. (2004). S. In D. Retrieved April 16. or the preservation of favoured races in the struggle for life. D. & Seeman.com/KB/recipes/NeuralNetwork_1. from http://www.aspx Blum. An Empirical Study of Learning Speed in Back-Propagation Networks. C. On the origin of the species by means of natural selection. E. O'Reilly. from School of Computer Science. Passing Data between Windows Forms.codeproject.unikarlsruhe.ps Fahlman.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 10 .unm. 2009. Bourg. G.. C. 2009.cmu. Chapter 14: Neural Networks. M. from School of Computer Science.ps.ps Lysle. (1992). Branke.edu/afs/cs. January 16). Retrieved April 13. Retrieved April 13. AI for Game Developers (pp. & G. London: John Murray.edu/user/sef/www/publications/qp-tr. 1. (1991).com/UploadFile/scottlysle/PassData01142007013005AM/PassData. 2009. Carnegie Mellon: http://www2.cmu.gz Darwin. & Lebiere.

(1943). Massachusetts: MIT Press.com/faqs/genalg/genalg.componentmodel. F. Page 212 of 225 . (2004). (2002). 2009. from generation5: http://www.html Marshall.ps. W.gz Matthews.. 5.. Retrieved 21 01.cs. D. (2008). 386-408. An introduction to genetic algorithms.microsoft. Stanford University. from MSDN: http://msdn. Genetic algorithms and evolutionary computation. (2009). Microsoft. A logical calculus of the ideas immanent in nervous activity.edu/~marshall/WWW/PAPERS/curve9912. Retrieved April 15. 2009. 2009. (1999). Back-propagation for the Uninitiated. B.dk/fann/ Parker. J. A. 2009. 115-133. J.com/en-us/library/system. Curved trajectory prediction using a selforganizing neural network. from Artificial Neural Networks: http://www. 65. Bulletin of Mathematical Biophysics . Office of Technology Licensing. Learning Logic.com/en-us/library/2x8kf7zx. W.asp McCulloch. S. & Pitts. & Srikanth. Psychological Review . M. (1996).com/robotcontrol.generation5.aspx Mitchell.backgroundworker. Retrieved April 16. Retrieved April 15.d. (1958). 2009.org/content/2002/bp.). 2009. from FANN: http://leenissen.UNC-Chapel Hill: http://www. from http://www.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Marczyk.microsoft. from MSDN: http://msdn. 2009.talkorigins. (1982). Retrieved April 13.unc. Retrieved April 16. from Computer Science . Retrieved April 15. Invention Report S81-64. A. Nissen. V. (n. BackgroundWorker Class. The perceptron: A probabilistic theory for information storage and organization in the brain. Using C++ Interop (Implicit PInvoke).learnartificialneuralnetworks. Robot Control.aspx Microsoft. (2009).htm Rosenblatt.

P. S. Beyond Regression: New tools for prediction and analysis in the behavioral sciences.org/wiki/index.html#Contents Werbos.ac.doc.uk/~nd/surprise_96/journal/vol4/cs11/report. (n.ic. (1974).). Retrieved 21 01.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Stergiou. 2009.php?title=Main_Page Page 213 of 225 . PhD. ZedGraph. & Dimitrios. Harvard University. from Imperial College London: http://www. Neural Networks. C.. from http://zedgraph.d. 2009. Retrieved April 15. (1997).

Retrieved April 13. In D.codeproject.unm.aspx Blum. A. 2009. Seeman.php/c9855/ Page 214 of 225 . Retrieved April 13. (1995). M. Neural Network in C++. S.edu/~chris2d/papers/CED_thesis.aspx Barber. London: John Murray. (2006). (1859). from Codeguru: http://www. P. M. Chapter 14: Neural Networks. Curved trajectory prediction using a self-organizing neural network. 1.aspx DLL Tutorial for Beginners. Bourg. (2004). (2001). 2009.unikarlsruhe.codeproject. Retrieved April 13. from Codeproject: http://www. from Codeproject: www.aspx Barber. Davis..de/~jbr/Papers/GaNNOverview. AI: Neural Network for Beginners pt.pdf DiLascia. 2. C. from Codeproject: http://www. 2009. (2006).com/KB/recipes/NeuralNetwork_1.gz Darwin. (2002). Retrieved April 13. AI for Game Developers (pp. Wiley Professional Computing.com/KB/cs/GA_ANN_XOR. 2009.com/enus/magazine/cc301501. S. C. J.com/Cpp/Cpp/cpp_mfc/tutorials/article. Retrieved April 13. (2007.aifb. & Seeman. Killing Processes Cleanly. 2009. 2009. August 6). & G. 2009. Branke.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 11 . G. (2006). 356-358). AI: Neural Network for Beginners pt.cs. O'Reilly.codeproject. from MSDN: http://msdn.com/KB/recipes/Backprop_ANN. Call Unmanaged DLLs from C#. AI: Neural Network for Beginners pt. from http://www. S.ps.codeguru. D. E. Retrieved April 13.microsoft.Bibliography Barber. 3. Bourg. (1992). from http://www. Graphics processing unit computation of neural networks. or the preservation of favoured races in the struggle for life. On the origin of the species by means of natural selection. Retrieved April 13.

edu/user/sef/www/publications/qp-tr. E.talkorigins.. An Empirical Study of Learning Speed in Back-Propagation Networks.asp Matthews.cs. (2004). 2009. 2009. 5.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Fahlman. Genetic algorithms and evolutionary computation. Retrieved April 16. 2009.. & Pitts. 2009.edu/user/sef/www/publications/cascor-tr. S. Back-propagation for the Uninitiated. Retrieved 26 01.). Retrieved April 13. Carnegie Mellon: http://www-2. J. S.gz Matthews. (2007. W. & Srikanth.com/p/googlechartsharp/ Lysle. J. from generation5: http://www. J.generation5. (2002).aspx Marczyk.ps.unc. Retrieved April 15.cs. J.d. from generation5: http://www. from Computer Science . 2009.cs.edu/afs/cs.d.com/faqs/genalg/genalg.cmu.ps GoogleChartSharp. (1943). A.UNC-Chapel Hill: http://www. E. Retrieved April 15. S.google. January 16).edu/afs/cs. from http://code. Retrieved 21 01.ps Fahlman. A. Retrieved April 15. Passing Data between Windows Forms.org/content/2000/xorga. (n.asp Matthews. 115-133. 2009.generation5. (2000). Page 215 of 225 . (1988).html Marshall.generation5. The Cascade-Correlation Learning Architecture. W. generation5. from School of Computer Science. C.cmu. from School of Computer Science. 2009.. Retrieved April 16. from XORGA: http://www. (n.org/content/2000/cbpnet. from C# Corner: http://www. A logical calculus of the ideas immanent in nervous activity. Bulletin of Mathematical Biophysics . & Lebiere. Back-Propagation: CBPNet. (1991). V.cmu.edu/~marshall/WWW/PAPERS/curve9912. Curved trajectory prediction using a selforganizing neural network.asp McCulloch. 2009.csharpcorner. Retrieved April 16.).com/UploadFile/scottlysle/PassData01142007013005AM/PassData.org/content/2002/bp. from http://www. Carnegie Mellon: http://www2. 2009. (1999).cmu.

).d. 2009. (2009). Stanford University.d. D.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Microsoft. 2009.componentmodel.). 2009. 2009. Neural Networks. from FANN: http://leenissen.html#fann_train_enum Nissen. M. Nguyen.d. 21-26. from FANN: http://leenissen. (2009).microsoft. Retrieved April 15. (n.html Nissen. (n. Retrieved April 16.. Robot Control. S. (2008). Reference Manual. 2009. (n. Nissen. Improving the learning speed of 2-layer neural networks by choosinginitial values of the adaptive weights. S.). Invention Report S81-64. 2009. 2009. 2009.dk/fann/ Nissen. Using C++ Interop (Implicit PInvoke). B.org/nplot/wiki/ Parker. 1990.). Learning Logic. from MSDN: http://msdn.com/en-us/library/system.d. Retrieved 21 01. S.aspx Mitchell. struct fann_train_data. Retrieved April 16. (1982).. S.NET. from FANN: http://leenissen. (1996). Retrieved 21 01.dk/fann/fann_1_2_0/r1597. (1990). An introduction to genetic algorithms.dk/fann/html/files/fann-h. Retrieved 21 01. from MSDN: http://msdn. B. from http://netcontrols.).microsoft. Office of Technology Licensing.htm Page 216 of 225 .backgroundworker. (n. Retrieved 26 01.html Nissen. (n. (n. struct fann.). & Widrow.html Nplot Charting Library for .dk/fann/html/files/fann_data-h.com/robotcontrol. D.com/en-us/library/2x8kf7zx. from Artificial Neural Networks: http://www.dk/fann/fann_1_2_0/r1837.d. from Datatypes: http://leenissen.aspx Microsoft.learnartificialneuralnetworks. S. BackgroundWorker Class. Massachusetts: MIT Press.d. 2009. from FANN: http://leenissen. 1990 IJCNN International Joint Conference on . Retrieved 21 01. Retrieved 21 01.

................. The perceptron: A probabilistic theory for information storage and organization in the brain...................1 . 2009... (1958)...)...... Neural Networks.......... from http://zedgraph..local optimum (units are undefined in this case)..uk/~nd/surprise_96/journal/vol4/cs11/report.. 12 Figure 3 .........An artificial neuron ............. S...............The initial state of a cascade correlation neural network............................ 30 Figure 6 ...ic.......A human neuron ...........Table of Figures Figure 1 ......... Harvard University.A feed-forward neural network ................... (n. Retrieved April 15...... PhD...William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Rosenblatt.......Tables 12.......d............doc....... Stergiou........ F... 27 Figure 5 .... from Imperial College London: http://www.... 65.....html#Contents Werbos........ The Cascade-Correlation Learning Architecture.....ac............ The circular connections are adjustable weights (Fahlman & Lebiere.. & Dimitrios......... Beyond Regression: New tools for prediction and analysis in the behavioral sciences......... 386-408.... 2009.............. Psychological Review . ZedGraph... P...... Retrieved 21 01..... C.............................. 10 Figure 2 ..........................The sigmoid function shape ........ 1991)...php?title=Main_Page 12 ................................................. (1974).................... ............ 13 Figure 4 ............................org/wiki/index.... .................... 35 Page 217 of 225 ... (1997).

..........................About form design (About form) .................. 45 Figure 17 ............................... 47 Figure 20 .................................................. A first node has been added......... 36 Figure 9 – Network and output tab design (Main form) ..... 43 Figure 13 .................................. 42 Figure 11 ....................Dataset display design (About form) .........Dataset selection tab design (Wizard form)......................The dataset tab . with two nodes added (Fahlman & Lebiere............................................... ....The third state of a cascade correlation neural network........................................................................................... 42 Figure 12 ....Design of the training algorithm tab (Wizard form) ..............................William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Figure 7 .............. 35 Figure 8 ......................Network Settings tab..............................................................Network and Output tab.............. The Cascade-Correlation Learning Architecture.................... 1991)......... 45 Figure 16 .........................Design of the network settings tab (Wizard form) .................................................................................Mean squared error graph tab .... 1991).................................................... 46 Figure 18 .............................. 41 Figure 10 .............. The square connections are locked weights(Fahlman & Lebiere..........................................Learning Algorithm tab . 49 Figure 22 . 51 Page 218 of 225 ............Licenses display design (About form) .... 50 Figure 23 ...................................................................Mean squared error tab design (Main form) ............. 44 Figure 14 ................................................ 46 Figure 19 .............. The CascadeCorrelation Learning Architecture..The second state of a cascade correlation neural network......... 48 Figure 21 .....................Working form design (Working form) .. 44 Figure 15 ..................Dataset tab design (Main form) ....................................................

........................................................................... 51 Figure 25 ........ 13 Equation 3 – The delta rule(Matthews........... 67 Figure 37 ............... as defined in the graph above....The mean squared error at testing (Iris data) .............................................................. 65 Figure 35 ...................................About form.......2 . 61 Figure 30 ....... 21 Page 219 of 225 ............................. main view .................................. Datasets view ......................................................................................Table of Equations Equation 1 .................................................. 67 Figure 36 ..........About form..........Number of iterations to achieve target (XOR) ................... 64 Figure 34........................ 52 Figure 26 ..... 2002) ..................Number of iterations to achieve target (Viruses) .......Mean squared error at testing (Viruses)............ 61 Figure 31 ........... ................................... 2004)......Dataset tab . 12 Equation 2 ...........The mean squared error at testing (XOR)..............About form... 62 Figure 32 ............... 54 Figure 28 ...........Mean squared error upon last training test (Iris data) ..Mean squared error upon last training test (XOR) ............................ 68 12......................................A sigmoid function(Bourg & Seeman............Summation of the inputs and weights .............Mean squared error upon last training test (Viruses)... 54 Figure 29 .............. Back-propagation for the Uninitiated...............................Working form ..................... 64 Figure 33... 53 Figure 27 ........ In this example “y” is the function output and “t” is the function input.... Licenses view ........Number of iterations to achieve target (Iris data) ............................................William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Figure 24 ........................................................

................................................. 2002)......... 15 Table 2 .......Altered delta calculation rule for the output layer(Matthews............................................................. 21 Equation 6 .........................The definition of 's' given that 'o' is the network output at which the error is measured...........................William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Equation 4 ....................The partial derivative of ‘s’ with respect to each of the candidates incoming weights ‘wi’......................................................... Backpropagation for the Uninitiated......................3 ................................. 33 Equation 9 .............. 'v' is the candidate unit's value...........Altered delta calculation rule for the hidden layer(s) (Matthews..... 21 Equation 7 . The Cascade-Correlation Learning Architecture........................ Back-propagation for the Uninitiated.....The statistical approach to deciding relevant data ........ Backpropagation for the Uninitiated....... Back-propagation for the Uninitiated...... 59 Page 220 of 225 .......... 59 Table 3 .......................... 'p' is the training pattern........................................ 22 Equation 8 ............. 2002) ........Genetic Algorithm testing data (XOR) ..............Table of tables Table 1 ............................................. where ‘oo’ is the sign of the correlation between the candidates value output ‘o’...................... 34 Equation 10 ............................................................. 1991)..................differentiated sigmoid function (Matthews........ the quantities ‘`v ’ and ‘`Eo’ are the values of v and Eo averaged over all patterns (Fahlman & Lebiere..The partial derivative of ’s’ (Fahlman & Lebiere..........p’ is the input the candidate receives from unit ‘i’ for pattern ‘p’................................ The CascadeCorrelation Learning Architecture............................ 2002)......Back-propagation testing data (XOR)... ‘f'p’ is the derivative for pattern 'p' of the candidate unit's activation function with respect to the sum of it’s inputs and ‘Ii.........Altered perceptron learning rule (Matthews................ 34 12...... ... 2002) ........................ 1991)............................................................................. 21 Equation 5 ........................ .......

................................................................Genetic Algorithms testing data (Viruses) ..............Back-propagation testing data (Viruses) ....................Cascade Correlation testing data (XOR) ....................................Genetic algorithm testing data (Iris data) ....... 63 Table 8 . 60 Table 5 ....... 63 Table 6 ................William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 Table 4 ..................Cascade correlation testing data (Iris data) ....... 63 Table 7 .................................................Back-propagation testing data (Iris data) ......................................... 66 Table 9 ......................... 66 Table 10 ....Cascade Correlation testing data (Viruses) .............................................. 66 Page 221 of 225 .....................................

o Decision made to adjust the weights of the neural network during training as opposed to using a genetic algorithm to establish network structure. • 10/10/2008 o GALib decided as a genetic algorithm starting point o Further non-web references as a goal • • 16/10/2008 o Investigation into various neural network libraries taking place. o Submitted objectives. 17/10/2008 o Investigating more deeply into journals based on research already conducted. back-propagation network was running and learning XOR. o Decided on XOR as a starting point.Diary • 01/10/2008 – Research progress satisfactory. • 24/10/2008 o University computers were down so code demo was impossible. o Agreed on further investigation into GALib and genetic algorithms. however.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 13 . • 31/10/2008 o First presentation complete and ready o References building up o Project plan complete • 10/11/2008 o Presentation went well o Progress satisfactory • 14/11/2008 o Discussed document formatting and layout Page 222 of 225 .

• • 06/02/2009 o Still exploring extra areas for project to cover. 13/02/2009 o Have decided to extend the project by including cascade correlation learning algorithm and comparison to genetic algorithms. o Progress satisfactory • 20/02/2009 o Progress satisfactory Page 223 of 225 . • • • • • • • • • 19/11/2008 o Milestone one submitted successfully.William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 o Progress satisfactory. 21/11/2008 o Progress satisfactory 28/11/2008 o Progress satisfactory 05/12/2008 o Progress satisfactory 12/12/2008 o Progress satisfactory 09/01/2009 o Progress satisfactory 16/01/2009 o Progress satisfactory 23/01/2009 o Progress satisfactory 30/01/2009 o Milestone two has been successfully submitted o Started investigating other areas to explore outside of project requirements.

William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 • • • • 27/02/2009 o Progress satisfactory 06/03/2009 o Project progress delayed by other coursework 13/03/2009 o Project progress delayed by other coursework 20/03/2009 o Project progressing. Page 224 of 225 . o Report satisfactory • 05/04/2009 o Further work on user interface needed o Finish C# genetic algorithm code (C++ code does work but is very slow) o Report satisfactory • 06/04/2009 o C# genetic algorithm code is complete. catch-up time for previous two weeks will be used over Easter break. is much faster (fixed several bugs along the way) and retains none of the problematic memory leaks. have decided to implement in managed language (C#) to try to solve this o Report continues satisfactorily • 04/04/2009 o To do: About box Add dataset notes Decided on virus classification as a third dataset via the custom dataset functionality. o Have started report • 02/04/2009 o Main problems experienced with genetic algorithm seem related to memory leaks.

Page 225 of 225 .William Sayers 05025397 Genetic Algorithms and Neural Networks Milestone 3 o Report satisfactory • 10/04/2009 o Fully functional project – commencing report. o Report satisfactory.

Sign up to vote on this title
UsefulNot useful