{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T19:22:33Z","timestamp":1648927353311},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1007\/bf00993305","type":"journal-article","created":{"date-parts":[[2005,1,14]],"date-time":"2005-01-14T12:53:30Z","timestamp":1105707210000},"page":"161-183","source":"Crossref","is-referenced-by-count":4,"title":["Learning nonoverlapping perceptron networks from examples and membership queries"],"prefix":"10.1007","volume":"16","author":[{"given":"Thomas R.","family":"Hancock","sequence":"first","affiliation":[]},{"given":"Mostefa","family":"Golea","sequence":"additional","affiliation":[]},{"given":"Mario","family":"Marchand","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/138027.138061","volume":"40","author":"D. Angluin","year":"1993","unstructured":"Angluin, D., Hellerstein, L., and Karpinski, M. (1993). Learning read-once formulas with queries.Journal of the Association for Computing Machinery 40, 185?210.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR2","first-page":"444","volume-title":"Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing","author":"D. Angluin","year":"1991","unstructured":"Angluin, D. and Kharitonov, M. (1991). When won't membership queries help?Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing (pp. 444?454). New York: ACM Press."},{"issue":"18","key":"CR3","doi-asserted-by":"crossref","first-page":"2312","DOI":"10.1103\/PhysRevLett.65.2312","volume":"65","author":"E. Barkai","year":"1990","unstructured":"Barkai, E., Hansel, D., and Kanter, I. (1990). Statistical mechanics of multilayer neural networks.Physical Review Letters 65(18), 2312?2315.","journal-title":"Physical Review Letters"},{"issue":"2","key":"CR4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1209\/0295-5075\/14\/2\/003","volume":"14","author":"E. Barkai","year":"1991","unstructured":"Barkai, E. and Kanter, I. (1991). Storage capacity of a multilayer network with binary weights.Europhysics Letters 14(2), 107?112.","journal-title":"Europhysics Letters"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0885-064X(90)90012-3","volume":"6","author":"E.B. Baum","year":"1990","unstructured":"Baum, E.B. (1990a). On learning a union of halfspaces.Journal of Complexity 6, 67?101.","journal-title":"Journal of Complexity"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1162\/neco.1990.2.4.510","volume":"2","author":"E.B. Baum","year":"1990","unstructured":"Baum, E.B. (1990b). A polynomial time algorithm that learns two hidden unit nets.Neural Computation 2, 510?522.","journal-title":"Neural Computation"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/72.80287","volume":"2","author":"E.B. Baum","year":"1991","unstructured":"Baum, E.B. (1991). Neural net algorithms that learn in polynomial time from examples and queries.IEEE Transactions on Neural Networks 2, 5?19.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1162\/neco.1989.1.1.151","volume":"1","author":"E.B. Baum","year":"1989","unstructured":"Baum, E.B. and Haussler, D. (1989). What size net gives valid generalization.Neural Computation 1, 151?160.","journal-title":"Neural Computation"},{"key":"CR9","first-page":"9","volume-title":"Proceedings of the 1988 Workshop on Computational Learning Theory","author":"A. Blum","year":"1988","unstructured":"Blum, A. and Rivest, R. (1988). Training a 3-node neural network is NP-complete.Proceedings of the 1988 Workshop on Computational Learning Theory (pp. 9?18). San Mateo, CA: Morgan Kaufman."},{"issue":"4","key":"CR10","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., and Warmuth, M. (1989). Learnability and the Vapnik-Chervonenkis dimension. newblockJournal of the Association for Computing Machinery 36(4), 929?965.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR11","first-page":"370","volume-title":"Proceedings of the 24th Annual ACM Symposium on the Theory of Computing","author":"N.H. Bshouty","year":"1992","unstructured":"Bshouty, N.H., Hancock, T.R., and Hellerstein, L. (1992a). Learning arithmetic read-once formulas.Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (pp. 370?381). New York: ACM Press."},{"key":"CR12","first-page":"1","volume-title":"Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory","author":"N.H. Bshouty","year":"1992","unstructured":"Bshouty, N.H., Hancock, T.R., and Hellerstein, L. (1992b). Learning boolean read-once formulas with arbitrary symmetric and constant fan-in gates.Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory (pp. 1?15). New York. ACM Press."},{"key":"CR13","volume-title":"Proceedings of the 31st Symposium on Foundations of Computer Science","author":"S. Goldman","year":"1990","unstructured":"Goldman, S., Kearns, M., and Schapire, R. (1990). Exact identification of circuits using fixed points of amplification functions.Proceedings of the 31st Symposium on Foundations of Computer Science. Los Alamitos, CA: IEEE Computer Society Press. To appear,SIAM Journal of Computation."},{"key":"CR14","volume-title":"Neural Information Processing Systems 5","author":"M. Golea","year":"1992","unstructured":"Golea, M., Marchand, M., and Hancock, T.R. (1992). On Learning ?-Perceptron Networks with Binary Weights. In S.J., Hanson; J., Cowan and C.L., Giles, (Eds),Neural Information Processing Systems 5. San Mateo, CA: Morgan Kaufman."},{"key":"CR15","first-page":"199","volume-title":"Proceedings of the Fourth Annual Workshop on Computational Learning Theory","author":"T.R. Hancock","year":"1991","unstructured":"Hancock, T.R. (1991). Learning 2? DNF formulas and ?? decision trees.Proceedings of the Fourth Annual Workshop on Computational Learning Theory (pp. 199?209). San Mateo, CA: Morgan Kaufman."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0885-064X(88)90019-2","volume":"4","author":"S. Judd","year":"1988","unstructured":"Judd, S. (1988). On the complexity of loading shallow neural networks.Journal of Complexity 4, 177?192.","journal-title":"Journal of Complexity"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"Karmarkar, N. (1984). A new polynomial time algorithm for linear programmingCombinatorica 4, 373?395.","journal-title":"Combinatorica"},{"key":"CR18","volume-title":"Proceedings of the Ninth Annual ACM Symposium on Theory of Computing","author":"M. Kearns","year":"1987","unstructured":"Kearns, M., Li, M., Pitt, L., and Valiant, L. (1987). On the learnability of boolean formulae.Proceedings of the Ninth Annual ACM Symposium on Theory of Computing. New York: ACM Press."},{"key":"CR19","first-page":"433","volume-title":"Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing","author":"M. Kearns","year":"1989","unstructured":"Kearns, M. and Valiant, L. (1989). Cryptographic limitations on learning boolean formulae and finite automata.Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing (pp. 433?444). New York: ACM Press."},{"key":"CR20","volume-title":"Proceedings of the Twenty Fifth Annual ACM Symposium on Theory of Computing","author":"M. Kharitonov","year":"1993","unstructured":"Kharitonov, M. (1993). When won't membership queries help?Proceedings of the Twenty Fifth Annual ACM Symposium on Theory of Computing. New York: ACM Press."},{"key":"CR21","first-page":"211","volume":"6","author":"J.H. Lin","year":"1991","unstructured":"Lin, J.H. and Vitter, J.S. (1991). Complexity results on learning by neural nets.Machine Learning 6, 211?230.","journal-title":"Machine Learning"},{"key":"CR22","series-title":"Technical Report","volume-title":"A greedy method for learning ?DNF functions under the uniform distribution","author":"G. Pagallo","year":"1989","unstructured":"Pagallo, G. and Haussler, D. (1989).A greedy method for learning ?DNF functions under the uniform distribution (Technical Report UCSC-CRL-89-12). Santa Cruz, CA: Department of Computer and Information Science, University of California at Santa Cruz."},{"key":"CR23","first-page":"184","volume-title":"Proceedings of the Fourth Annual Workshop on Computational Learning Theory","author":"R.E. Schapire","year":"1991","unstructured":"Schapire, R.E. (1991). Learning probabilistic read-once formulas on product distributions.Proceedings of the Fourth Annual Workshop on Computational Learning Theory (pp. 184?198). San Mateo, CA: Morgan Kaufman."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"Valiant, L.G. (1984). A theory of the learnable.Communications of the ACM 27, 1134?1142.","journal-title":"Communications of the ACM"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00993305.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00993305\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00993305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T18:58:43Z","timestamp":1556564323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00993305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["BF00993305"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf00993305","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":["Artificial Intelligence","Software"],"published":{"date-parts":[[1994,9]]}}}