Pattern recognition with the decomposed multilayer perceptron

Lucas, S., Zhao, Z., Cawley, G. C. and Noakes, P. D. (1993) Pattern recognition with the decomposed multilayer perceptron. IEE Electronics Letters, 29 (5). pp. 442-443. ISSN 0013-5194

Full text not available from this repository. (Request a copy)

Abstract

The Letter reports the benefits of decomposing the multilayer perceptron (MLP) for pattern recognition tasks. Suppose there are N classes, instead of employing 1 MLP with N outputs, N MLPs are used, each with a single output. In practice, this allows fewer hidden units to be used than would be employed in the single MLP. Furthermore, it is found that decomposing the problem in this way allows convergence in fewer iterations, and it becomes straightforward to distribute the training over as many workstations as there are pattern classes. The speedup is then linear in the number of pattern classes, assuming there are as many processors as classes. If there are more classes than processors, then the speedup is linear in the number of processors. It is shown that on a difficult hand-written OCR problem, the results obtained with the decomposed MLP are slightly superior than those for the conventional MLP, and obtained in a fraction of the time.

Item Type: Article
Faculty \ School: Faculty of Science > School of Computing Sciences
University of East Anglia > Faculty of Science > Research Groups > Computational Biology (subgroups are shown below) > Machine learning in computational biology
?? RGCB ??
?? RGMLS ??
?? RGCOASC ??
Related URLs:
Depositing User: Vishal Gautam
Date Deposited: 08 Mar 2011 13:11
Last Modified: 25 Jul 2018 08:17
URI: https://ueaeprints.uea.ac.uk/id/eprint/23853
DOI: 10.1049/el:19930295

Actions (login required)

View Item