{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T02:41:55Z","timestamp":1791081715266,"version":"4.1.0"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1109\/tit.2011.2169296","type":"journal-article","created":{"date-parts":[[2012,1,11]],"date-time":"2012-01-11T21:58:12Z","timestamp":1326319092000},"page":"459-478","source":"Crossref","is-referenced-by-count":24,"title":["Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations"],"prefix":"10.1109","volume":"58","author":[{"given":"Gowtham","family":"Bellala","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suresh K.","family":"Bhavnani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Clayton","family":"Scott","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(89)90077-7"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(89)90075-7"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISTCS.1997.595156"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89538"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1037\/h0020184"},{"key":"ref30","article-title":"Noisy generalized binary search","volume":"21","author":"nowak","year":"2009","journal-title":"Adv Neural Inf Process Syst (NIPS)"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(89)90062-9"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143853"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/BF00993160"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72927-3_7"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/34.476006"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90270-P"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01469224"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797609"},{"key":"ref13","article-title":"Adaptive Submodularity: A new approach to active learning and stochastic optimization","author":"golovin","year":"2010","journal-title":"Proc Int Conf Learn Theory (COLT)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14165-2_58"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref16","author":"fano","year":"1961","journal-title":"Transmission of Information"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(76)90095-8"},{"key":"ref28","article-title":"Near-optimal Bayesian active learning with noisy observations","volume":"23","author":"golovin","year":"2010","journal-title":"Adv Neural Inf Process Syst (NIPS)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/0123019"},{"key":"ref27","article-title":"Extensions of generalized binary search to group identification and exponential costs","volume":"23","author":"bellala","year":"2010","journal-title":"Adv Neural Inf Process Syst (NIPS)"},{"key":"ref3","author":"garey","year":"1970","journal-title":"Optimal binary decision trees for diagnostic identification problems"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1977.1674766"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/11894841_9","article-title":"Active learning in the non-realizable case","author":"kriinen","year":"2006","journal-title":"Algorithm Learn Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF00290148"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0098-1354(85)80006-5"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.dam.2002.08.001","article-title":"Sequential testing of complex systems: A review","volume":"142","author":"nlyurt","year":"2004","journal-title":"Discr Appl Math"},{"key":"ref2","article-title":"Analysis of a greedy active learning strategy","author":"dasgupta","year":"2004","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref9","first-page":"1187","article-title":"Multiple disease (fault) diagnosis with applications to the QMR-DT problem","volume":"2","author":"yu","year":"2003","journal-title":"Proc IEEE Int Conf Syst Man Cybern"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.11.004"},{"key":"ref46","article-title":"Coarse sample complexity bounds for active learning","author":"dasgupta","year":"2006","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref20","first-page":"13","article-title":"Minimum-effort driven dynamic faceted search in structured databases","author":"roy","year":"2008","journal-title":"Proc 17th ACM Conf Inf Knowl Manage"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00181-0"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.21221"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/S0167-7152(99)00128-5","article-title":"Rates of convergence of the sup-norm risk in image models under sequential designs","volume":"46","author":"korostelev","year":"2000","journal-title":"Statist Probabil Lett"},{"key":"ref21","first-page":"11","article-title":"On an optimal split tree problem","author":"kosaraju","year":"1999","journal-title":"Proc 6th Int Workshop on Algorithms and Data Structures (WADS)"},{"key":"ref42","article-title":"Network analysis of toxic chemicals and symptoms: Implications for designing first-responder systems","author":"bhavnani","year":"2007","journal-title":"Proc Amer Med Informat Assoc"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_19"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00303-6"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265538"},{"key":"ref44","article-title":"On the boosting ability of top-down decision tree learning algorithms","author":"kearns","year":"1995","journal-title":"Proc 28th Ann ACM Symp Theory of Comput"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85363-3_1"},{"key":"ref43","author":"quinlan","year":"1993","journal-title":"C4 5 Programs for Machine Learning"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17514-5_18"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6121971\/06121981.pdf?arnumber=6121981","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:47:18Z","timestamp":1633909638000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6121981\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":47,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2169296","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1]]}}}