Performance of recurrent neural networks applied to a simplified pattern recognition problem

Authors:
Lenny Scardino;Rick Niess;William Douglas;Marcin Paprzycki
Affiliations:
The University of Southern Mississippi, Hattiesburg, MS;The University of Southern Mississippi, Hattiesburg, MS;The University of Southern Mississippi, Hattiesburg, MS;The University of Southern Mississippi, Hattiesburg, MS
Venue:
Journal of Computing Sciences in Colleges
Year:
2000

Citing 3
Cited 0

Pattern recognition using neural networks: theory and algorithms for engineers and scientists

Pattern recognition using neural networks: theory and algorithms for engineers and scientists
Applying Probabilistic Neural Networks to the Multifont Recognition Problem with Large Training Set

Proceedings of the Twelfth International Florida Artificial Intelligence Research Society Conference
Comparing Performance of Neural Networks Applied to a Simplified Recognition Problem

Proceedings of the Thirteenth International Florida Artificial Intelligence Research Society Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this note we present and discuss results of experiments comparing the performance of recurrent networks (Jordan-Elman networks) applied to a simplified multifont recognition problem. The experiments have been run for the increasing number of data elements in the training set and for varying number of nodes in the hidden layer.