{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T09:07:41Z","timestamp":1743325661589},"reference-count":4,"publisher":"MIT Press - Journals","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Computation"],"published-print":{"date-parts":[[2001,2]]},"abstract":"<jats:p> This article presents preliminary research on the general problem of reducing the number of neurons needed in a neural network so that the network can perform a specific recognition task. We consider a single-hidden-layer feedforward network in which only McCulloch-Pitts units are employed in the hidden layer. We show that if only interconnections between adjacent layers are allowed, the minimum size of the hidden layer required to solve the n-bit parity problem is n when n \u2264 4. <\/jats:p>","DOI":"10.1162\/089976601300014556","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:55:01Z","timestamp":1027770901000},"page":"319-326","source":"Crossref","is-referenced-by-count":9,"title":["Minimal Feedforward Parity Networks Using Threshold Gates"],"prefix":"10.1162","volume":"13","author":[{"given":"Hon-Kwok","family":"Fung","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics, Hong Kong Polytechnic University, Hong Kong"}]},{"given":"Leong Kwan","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, Hong Kong Polytechnic University, Hong Kong"}]}],"member":"281","reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(05)80101-7"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(05)80114-5"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(92)90039-L"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(05)80088-7"}],"container-title":["Neural Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mitpressjournals.org\/doi\/pdf\/10.1162\/089976601300014556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T21:48:40Z","timestamp":1615585720000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/neco\/article\/13\/2\/319-326\/6477"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["10.1162\/089976601300014556"],"URL":"https:\/\/doi.org\/10.1162\/089976601300014556","relation":{},"ISSN":["0899-7667","1530-888X"],"issn-type":[{"value":"0899-7667","type":"print"},{"value":"1530-888X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}