Olafsson, Sverrir and Abu-Mostafa, Yaser S. (1988) The capacity of multilevel threshold functions. IEEE Transactions on Pattern Analysis and Machine Intelligence, 10 (2). pp. 277-281. ISSN 0162-8828 http://resolver.caltech.edu/CaltechAUTHORS:OLAieeetpami88
![[img]](http://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
See Usage Policy. 510Kb |
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:OLAieeetpami88
Abstract
Lower and upper bounds for the capacity of multilevel threshold elements are estimated, using two essentially different enumeration techniques. It is demonstrated that the exact number of multilevel threshold functions depends strongly on the relative topology of the input set. The results correct a previously published estimate and indicate that adding threshold levels enhances the capacity more than adding variables.
| Item Type: | Article |
|---|---|
| Additional Information: | © Copyright 1988 IEEE. Reprinted with permission. Manuscript received June 13, 1986; revised March 16, 1987. Recommended for acceptance by J. Kittler. This work was supported by the President's Fund, Caltech. |
| Subject Keywords: | Classifier, information capacity, multilevel threshold element, neural networks, parallel hyperplanes, pattern recognition |
| Record Number: | CaltechAUTHORS:OLAieeetpami88 |
| Persistent URL: | http://resolver.caltech.edu/CaltechAUTHORS:OLAieeetpami88 |
| Alternative URL: | http://dx.doi.org/10.1109/34.3890 |
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. |
| ID Code: | 5776 |
| Collection: | CaltechAUTHORS |
| Deposited By: | Archive Administrator |
| Deposited On: | 01 Nov 2006 |
| Last Modified: | 26 Dec 2012 09:15 |
Repository Staff Only: item control page
