title: Discrimination networks for maximum selection.
abstract: We construct a novel discrimination network using differentiating units for maximum selection. In contrast to traditional competitive architectures like MAXNET the discrimination network does not only signal the winning unit, but also provides information about its evidence. In particular, we show that a discrimination network converges to a stable state within finite time and derive three characteristics: intensity normalization (P1), contrast enhancement (P2), and evidential response (P3). In order to improve the accuracy of the evidential response we incorporate distributed redundancy into the network. This leads to a system which is not only robust against failure of single units and noisy data, but also enables us to sharpen the focus on the problem given in terms of a more accurate evidential response. The proposed discrimination network can be regarded as a connectionist model for competitive learning by evidence.
authors.affiliation: Department of Computer Science, Sekr FR 5-8, Technical University Berlin, Franklinstr 28/29, D-10587 Berlin, Germany. bjj@cs.tu-berlin.de
authors.forename: Brijnesh J
authors.initials: BJ
authors.lastname: Jain
authors.forename: Fritz
authors.initials: F
authors.lastname: Wysotzki
mesh_terms: D003198:Computer Simulation; D004192:Discrimination, Psychological / Q000502:physiology*; D007858:Learning / Q000502:physiology*; D016014:Linear Models; D008959:Models, Neurological; D016571:Neural Networks, Computer; D017711:Nonlinear Dynamics; D016011:Normal Distribution