{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T20:34:51Z","timestamp":1725914091161},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319685991"},{"type":"electronic","value":"9783319686004"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68600-4_18","type":"book-chapter","created":{"date-parts":[[2017,10,23]],"date-time":"2017-10-23T19:04:26Z","timestamp":1508785466000},"page":"146-154","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for Obtaining Parsimonious Higher Order Neurons"],"prefix":"10.1007","author":[{"given":"Can Eren","family":"Sezener","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erhan","family":"Oztop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,24]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Sezener, C.E., Oztop, E.: Minimal sign representation of boolean functions: algorithms and exact results for low dimensions. Neural Comput. 27(8) (2015)","DOI":"10.1162\/NECO_a_00750"},{"issue":"7","key":"18_CR2","doi-asserted-by":"crossref","first-page":"938","DOI":"10.1016\/j.neunet.2009.03.016","volume":"22","author":"E Oztop","year":"2009","unstructured":"Oztop, E.: Sign-representation of boolean functions using a small number of monomials. Neural Netw. 22(7), 938\u2013948 (2009)","journal-title":"Neural Netw."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Oztop, E.: An upper bound on the minimum number of monomials required to separate dichotomies of \n            $$-$$\n            \n              \n                -\n              \n            \n          1, 1\n            $$^{\\text{n}}$$\n            \n              \n                \n                  \n                  n\n                \n              \n            \n          . Neural Comput. 18(12) (2006)","DOI":"10.1162\/neco.2006.18.12.3119"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-642-17517-6_28","volume-title":"Algorithms and Computation","author":"K Amano","year":"2010","unstructured":"Amano, K.: New upper bounds on the average PTF density of boolean functions. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6506, pp. 304\u2013315. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-17517-6_28"},{"key":"18_CR5","volume-title":"Discrete Neural Computation","author":"KY Siu","year":"1995","unstructured":"Siu, K.Y., Roychowdhury, V., Kailath, T.: Discrete Neural Computation. Prentice Hall, Englewood Cliffs (1995)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Mel, B.W.: Information processing in dendritic trees. Neural Comput. 6 (1994)","DOI":"10.1162\/neco.1994.6.6.1031"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/3-540-57785-8_168","volume-title":"STACS 94","author":"E Amaldi","year":"1994","unstructured":"Amaldi, E., Kann, V.: On the approximability of finding maximum feasible subsystems of linear systems. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 521\u2013532. Springer, Heidelberg (1994). doi:\n10.1007\/3-540-57785-8_168"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Saks, M.E.: Slicing the hypercube. In: London Mathematical Society Lecture Note Series 187: Surveys in Combinatorics. Cambridge University Press (1993)","DOI":"10.1017\/CBO9780511662089.009"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, R., Servedio, R.: Extremal properties of polynomial threshold functions. In: Eighteenth Annual Conference on Computational Complexity (2003)","DOI":"10.1109\/CCC.2003.1214406"}],"container-title":["Lecture Notes in Computer Science","Artificial Neural Networks and Machine Learning \u2013 ICANN 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68600-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,23]],"date-time":"2017-10-23T19:08:35Z","timestamp":1508785715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68600-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319685991","9783319686004"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68600-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}