Login | Register

A comparison of training techniques : ADALINE, back propagation and genetic algorithms

Title:

A comparison of training techniques : ADALINE, back propagation and genetic algorithms

Yang, Wei (2000) A comparison of training techniques : ADALINE, back propagation and genetic algorithms. [Graduate Projects (Non-thesis)] (Unpublished)

[thumbnail of MQ47857.pdf]
Preview
Text (application/pdf)
MQ47857.pdf
3MB

Abstract

This study is in the area of neural network architectures and training algorithms. The emphasis is placed on the comparisons of ADALINE, Back Propagation and Genetic Algorithms in training neural networks. Concrete examples are developed to illustrate and reveal the fundamental theories of neural networks, and demonstrate the strengths and weaknesses of ADALINE, Back Propagation and Genetic Algorithms. An object-oriented approach is applied in the overall analysis and design of the neural network architectures. The Object-oriented programming with C++ is used to facilitate the development and implementation of the neural network architectures and training algorithms.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Graduate Projects (Non-thesis)
Authors:Yang, Wei
Pagination:vii, 120 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:M. Comp. Sc.
Program:Computer Science
Department (as was):Department of Computer Science
Date:2000
Thesis Supervisor(s):Grogono, Peter
Identification Number:QA 76 M26+ 2000 no.4
ID Code:1107
Deposited By: Concordia University Library
Deposited On:27 Aug 2009 17:16
Last Modified:20 Oct 2022 20:44
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top