Referenced Items are not available for this document.
A new sufficient condition that a region be classifiable by a two-layer feedforward network using threshold activation functions is found. Briefly, it is either a convex polytope, or that minus the removal of convex polytope from its interior, or. . .recursively. The author refers to these sets as convex recursive deletion regions. The proof of implementability exploits the equivalence of this problem with that of characterizing two set partitions of the vertices of a hypercube which are separable by a hyperplane, for which a new result is obtained
Published in:
Neural Networks, IEEE Transactions on
(Volume:4
,
Issue:
2
)
Date of Publication: Mar 1993
- Page(s):
- 343 - 347
- ISSN :
- 1045-9227
- INSPEC Accession Number:
- 4415963
- Digital Object Identifier :
- 10.1109/72.207621
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Mar 1993
- Sponsored by :
- IEEE Computational Intelligence Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
