{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:42Z","timestamp":1759639002984},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Networks"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1016\/0893-6080(94)90082-5","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T03:25:55Z","timestamp":1051241155000},"page":"491-494","source":"Crossref","is-referenced-by-count":9,"title":["The minimum feature set problem"],"prefix":"10.1016","volume":"7","author":[{"given":"Kevin S.","family":"Van Horn","sequence":"first","affiliation":[]},{"given":"Tony R.","family":"Martinez","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0893-6080(94)90082-5_BIB1","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1162\/neco.1989.1.1.151","article-title":"What size net gives valid generalizations?","volume":"1","author":"Baum","year":"1989","journal-title":"Neural Computation"},{"key":"10.1016\/0893-6080(94)90082-5_BIB2","series-title":"Proceedings of the 25th Annual ACM Symposium on Theory of Computing","first-page":"294","article-title":"Efficient probabilistically checkable proofs and applications to approximation","author":"Bellare","year":"1993"},{"key":"10.1016\/0893-6080(94)90082-5_BIB3","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"Learnability and the Vapnik-Chervonenkis dimension","volume":"36","author":"Blumer","year":"1989","journal-title":"Journal of the ACM"},{"key":"10.1016\/0893-6080(94)90082-5_BIB4","series-title":"Introduction to algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/0893-6080(94)90082-5_BIB5","series-title":"Concrete mathematics: A foundation for computer science","author":"Graham","year":"1989"},{"key":"10.1016\/0893-6080(94)90082-5_BIB6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0004-3702(88)90002-1","article-title":"Quantifying inductive bias: AI learning algorithms and Valiant's learning framework","volume":"36","author":"Haussler","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0893-6080(94)90082-5_BIB7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF00116827","article-title":"Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm","volume":"2","author":"Littlestone","year":"1988","journal-title":"Machine Learning"}],"container-title":["Neural Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0893608094900825?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0893608094900825?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T19:26:05Z","timestamp":1553282765000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0893608094900825"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0893608094900825"],"URL":"https:\/\/doi.org\/10.1016\/0893-6080(94)90082-5","relation":{},"ISSN":["0893-6080"],"issn-type":[{"value":"0893-6080","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}