Cart (Loading....) | Create Account
Close category search window
 

Validating connectionist implementations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Klyne, S. ; Exeter Univ., UK

We present a method for validating implementations of connectionist algorithms by comparison with known versions. The method is dependent on a statistical model derived from work in multiversion programming techniques. We present example results which reveal that two variations of the backpropagation algorithm which are widely accepted as mere implementation variants do actually produce networks with some levels of differences. It is suggested that this method could be a useful validation tool for developers of variants of known algorithms

Published in:

Artificial Neural Networks, 1995., Fourth International Conference on

Date of Conference:

26-28 Jun 1995

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.