{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:45Z","timestamp":1759637925920},"reference-count":32,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3850,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0890-5401(02)00030-5","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T17:34:03Z","timestamp":1042824843000},"page":"82-100","source":"Crossref","is-referenced-by-count":11,"title":["Learning from examples with unspecified attribute values"],"prefix":"10.1016","volume":"180","author":[{"given":"Sally A.","family":"Goldman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen S.","family":"Kwek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen D.","family":"Scott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0890-5401(02)00030-5_BIB1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00116828","article-title":"Queries and concept learning","volume":"2","author":"Angluin","year":"1988","journal-title":"Machine Learning"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/138027.138061","article-title":"Learning read-once formulas with queries","volume":"40","author":"Angluin","year":"1993","journal-title":"Journal of ACM"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0004-3702(90)90041-W","article-title":"Concept learning and heuristic classification in weak-theory domains","volume":"45","author":"Bareiss","year":"1990","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/S0890-5401(02)00030-5_BIB4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1006\/jcss.1998.1569","article-title":"Learning with restricted focus of attention","volume":"56","author":"Ben-David","year":"1998","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB5","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/A:1007458528570","article-title":"On restricted-focus-of-attention learnability of Boolean functions","volume":"30","author":"Birkendorf","year":"1998","journal-title":"Machine Learning"},{"issue":"2","key":"10.1016\/S0890-5401(02)00030-5_BIB6","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1006\/jcss.1999.1638","article-title":"Structural results about exact learning with unspecified attribute values","volume":"60","author":"Birkendorf","year":"2000","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB7","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0020-0190(80)90078-2","article-title":"Equivalence of free Boolean graphs can be decided probabilistically in polynomial time","volume":"10","author":"Blum","year":"1980","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB8","series-title":"Classification and Regression Trees","author":"Breiman","year":"1984"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB9","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/136035.136043","article-title":"Symbolic boolean manipulation with ordered binary decision diagrams","volume":"24","author":"Bryant","year":"1992","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"10.1016\/S0890-5401(02)00030-5_BIB10","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1006\/inco.1995.1164","article-title":"Exact learning via the monotone theory","volume":"123","author":"Bshouty","year":"1995","journal-title":"Information and Computation"},{"issue":"3","key":"10.1016\/S0890-5401(02)00030-5_BIB11","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1006\/jcss.1996.0032","article-title":"Oracles and queries that are sufficient for exact learning","volume":"52","author":"Bshouty","year":"1996","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB12","series-title":"Proceedings of the 12th Annual Conference on Computation and Learning Theory","first-page":"81","article-title":"On learning in the presence of unspecified attribute values","author":"Bshouty","year":"1999"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1023\/A:1007379606734","article-title":"Multitask learning","volume":"28","author":"Caruana","year":"1997","journal-title":"Machine Learning"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB14","first-page":"959","article-title":"Using the future to \u201csort out\u201d the present: Rankprop and multitask learning for medical risk evaluation","volume":"8","author":"Caruana","year":"1996","journal-title":"Advances in Neural Information Processing Systems"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB15","doi-asserted-by":"crossref","DOI":"10.1016\/0002-9343(93)90177-Q","article-title":"Validation of a pneumonia prognostic index using the MedisGroups comparative hospital database","volume":"94","author":"Fine","year":"1993","journal-title":"American Journal of Medicine"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB16","series-title":"Lecture Notes in Computer Science, vol. 62, Proceedings of Automata, Languages and Programming","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/3-540-08860-1_17","article-title":"The complexity of equivalence and containment for free single variable program schemes","author":"Fortune","year":"1978"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB17","series-title":"Proceedings of the 6th International Workshop on Algorithmic Learning Theory","first-page":"228","article-title":"Learning ordered binary decision diagrams","author":"Gavalda","year":"1995"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB18","series-title":"Proceedings of the 10th Annual Conference on Computational Learning Theory","first-page":"231","article-title":"Learning from examples with unspecified attribute values","author":"Goldman","year":"1997"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB19","series-title":"Proceedings of the 13th International Conference on Machine Learning","first-page":"207","article-title":"Learning active classifiers","author":"Greiner","year":"1996"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB20","doi-asserted-by":"crossref","unstructured":"T. Hancock, Identifying \u03bc-formula decision trees with queries, in: Proceedings of the Third Annual Workshop on Computational Learning Theory, Morgan Kaufmann, 1990, pp. 23\u201337","DOI":"10.1016\/B978-1-55860-146-8.50005-9"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB21","series-title":"Proceedings of the Second Annual Workshop on Computational Learning Theory","first-page":"146","article-title":"Learning read-once formulas using membership queries","author":"Hellerstein","year":"1989"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB22","series-title":"Lecture Notes in Computer Science. Proceedings of 3rd Annual Symposium on Theoretical Aspects of Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-16078-7_83","article-title":"Monotone Boolean formulas, distributive lattices, and the complexity of logics, algebraic structures, and computation structures","author":"Hunt","year":"1986"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB23","first-page":"107","article-title":"Complete problems for deterministic polynomial time","volume":"vol. 3","author":"Jones","year":"1977"},{"issue":"3","key":"10.1016\/S0890-5401(02)00030-5_BIB24","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/S0022-0000(05)80062-5","article-title":"Efficient distribution-free learning of probabilistic concepts","volume":"48","author":"Kearns","year":"1994","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"10.1016\/S0890-5401(02)00030-5_BIB25","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1023\/A:1007581123604","article-title":"Learning to reason with a restricted view","volume":"35","author":"Khardon","year":"1999","journal-title":"Machine Learning"},{"issue":"2","key":"10.1016\/S0890-5401(02)00030-5_BIB26","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1006\/inco.1995.1149","article-title":"Read-twice DNF formulas are properly learnable","volume":"122","author":"Pillaipakkamnatt","year":"1995","journal-title":"Information and Computation"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB27","series-title":"Proceedings of the 6th International Machine Learning Workshop","first-page":"164","article-title":"Unknown attribute values in induction","author":"Quinlan","year":"1989"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB28","first-page":"249","article-title":"A nearly-linear time equivalence test and characterization of \u03bc-branching programs","volume":"30","author":"Raghavan","year":"1997","journal-title":"Mathematical Systems Theory"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB29","series-title":"Proceedings of the Tenth Canadian Conference on Artificial Intelligence","first-page":"519","article-title":"Learning default concepts","author":"Schuurmans","year":"1994"},{"key":"10.1016\/S0890-5401(02)00030-5_BIB30","series-title":"Computational Learning Theory and Natural Learning Systems, vol. IV: Making Learning Systems Practical","first-page":"87","article-title":"Learning to classify incomplete examples","author":"Schuurmans","year":"1997"},{"issue":"11","key":"10.1016\/S0890-5401(02)00030-5_BIB31","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Communications of ACM"},{"issue":"2","key":"10.1016\/S0890-5401(02)00030-5_BIB32","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","article-title":"On the uniform convergence of relative frequencies of events to their probabilities","volume":"16","author":"Vapnik","year":"1971","journal-title":"Theory of Probability and its Applications"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540102000305?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540102000305?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T14:27:38Z","timestamp":1553956058000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540102000305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0890540102000305"],"URL":"https:\/\/doi.org\/10.1016\/s0890-5401(02)00030-5","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}