Hostname: page-component-7c8c6479df-fqc5m Total loading time: 0 Render date: 2024-03-28T21:30:26.215Z Has data issue: false hasContentIssue false

A binary classifier with applications to poorly defined engineering problems

Published online by Cambridge University Press:  01 June 1998

IAN FLOOD
Affiliation:
M.E. Rinker, Sr. School of Building Construction, University of Florida, Gainesville, FL 32611, U.S.A.
NABIL KARTAM
Affiliation:
Department of Civil Engineering, University of Kuwait, Safat, Kuwait.

Abstract

The paper proposes and evaluates a binary network architecture and complementary training algorithm designed for pattern classification, with applications in a variety of engineering problems. The advantages of the system are that it can always converge on zero error for a set of unambiguous training patterns (if required), converges rapidly, and circumvents the issue of how many hidden neurons to incorporate in a network. The main benefit of the proposed system over Hamming networks, its main counterpart, is that it can group patterns into different classes along any boundary. The system is shown to outperform 1) the Hamming network for a character recognition problem where the images are subject to both position change and noise; and 2) a radial-Gaussian network in a truck-type classification problem. A variant of the system, where hidden neuron thresholds are set to zero, is shown to further improve performance if a comprehensive set of noise-free input patterns are available for training.

Type
Research Article
Copyright
1998 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)