{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:35:16Z","timestamp":1725471316424},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540352945"},{"type":"electronic","value":"9783540352969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11776420_45","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T14:49:15Z","timestamp":1159454955000},"page":"620-634","source":"Crossref","is-referenced-by-count":6,"title":["Active Sampling for Multiple Output Identification"],"prefix":"10.1007","author":[{"given":"Shai","family":"Fine","sequence":"first","affiliation":[]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","unstructured":"Dasgupta, S.: Analysis of a greedy active learning strategy. In: Advances in Neural Information Processing Systems (NIPS) (2004)"},{"key":"45_CR2","unstructured":"Dasgupta, S.: Coarse sample complexity bounds for active learning. In: Advances in Neural Information Processing Systems (NIPS) (2005)"},{"key":"45_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/11503415_17","volume-title":"Learning Theory","author":"S. Dasgupta","year":"2005","unstructured":"Dasgupta, S., Kalai, A.T., Monteleoni, C.: Analysis of perceptron-based active learning. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS, vol.\u00a03559, pp. 249\u2013263. Springer, Heidelberg (2005)"},{"issue":"3","key":"45_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1147\/sj.411.0111","volume":"41","author":"O. Edelstein","year":"2002","unstructured":"Edelstein, O., Farchi, E., Nir, Y., Ratzaby, G., Ur, S.: Multithreaded java program test generation. IBM Systems Journal\u00a041(3), 111\u2013125 (2002)","journal-title":"IBM Systems Journal"},{"key":"45_CR5","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1093\/biomet\/52.3-4.331","volume":"52","author":"B. Efron","year":"1965","unstructured":"Efron, B.: The convex hull of a rndom set of points. Biometrika\u00a052, 331\u2013343 (1965)","journal-title":"Biometrika"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"Fine, S., Gilad-Bachrach, R., Shamir, E.: Query by committee, linear separation and random walks. Theoretical Computer Science\u00a0284(1) (2002), (A preliminary version appeared in EuroColt 1999)","DOI":"10.1016\/S0304-3975(01)00079-2"},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"Fine, S., Ziv, A.: Coverage directed test generation for functional verification using Bayesian networks. In: Proceedings of the 40th Design Automation Conference, pp. 286\u2013291 (June 2003)","DOI":"10.1145\/775832.775907"},{"issue":"2\/3","key":"45_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1007330508534","volume":"28","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., Seung, H., Shamir, E., Tishby, N.: Selective sampling using the query by committee algorithm. Machine Learning\u00a028(2\/3), 133\u2013168 (1997)","journal-title":"Machine Learning"},{"key":"45_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1022627018023","volume":"11","author":"S.R. Kulkarni","year":"1993","unstructured":"Kulkarni, S.R., Mitter, S.K., Tsitsiklis, J.N.: Active learning using arbitrary binary valued queries. Machine Learning\u00a011, 23\u201335 (1993)","journal-title":"Machine Learning"},{"key":"45_CR10","unstructured":"Liere, R., Tadepalli, P.: Active learning with committees for text categorization. In: AAAI 1997 (1997)"},{"issue":"2","key":"45_CR11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01200907","volume":"17","author":"N. Linial","year":"1997","unstructured":"Linial, N., Luby, M., Saks, M., Zuckerman, D.: Efficient construction of a small hitting set for combinatorial rectangles in high dimension. Combinatorica\u00a017(2), 215\u2013234 (1997), (A preliminary version appeard in STOC 1993)","journal-title":"Combinatorica"},{"key":"45_CR12","volume-title":"Functional Verification Coverage Measurement and Analysis","author":"A. Piziali","year":"2004","unstructured":"Piziali, A.: Functional Verification Coverage Measurement and Analysis. Springer, Heidelberg (2004)"},{"key":"45_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An introduction. Springer, Heidelberg (1985)"},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF00535300","volume":"2","author":"A. R\u00e9nyi","year":"1963","unstructured":"R\u00e9nyi, A., Sulamke, R.: Uber die konvexe hulle von n zufallig gewahlten punkten. Z. Wahrschein\u00a02, 75\u201384 (1963)","journal-title":"Z. Wahrschein"},{"key":"45_CR15","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","volume":"13","author":"N. Sauer","year":"1972","unstructured":"Sauer, N.: On the density of family of sets. J. of Combinatorial Theory, Ser. A\u00a013, 145\u2013147 (1972)","journal-title":"J. of Combinatorial Theory, Ser. A"},{"key":"45_CR16","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/130385.130417","volume-title":"Proceedings of the Fith Workshop on Computational Learning Theory","author":"H.S. Seung","year":"1992","unstructured":"Seung, H.S., Opper, M., Sompolinsky, H.: Query by committe. In: Proceedings of the Fith Workshop on Computational Learning Theory, pp. 287\u2013294. Morgan Kaufman, San Mateo (1992)"},{"key":"45_CR17","doi-asserted-by":"crossref","unstructured":"Ur, S., Yadin, Y.: Micro-architecture coverage directed generation of test programs. In: Proceedings of the 36th Design Automation Conference, June 1999, pp. 175\u2013180 (1999)","DOI":"10.1145\/309847.309909"},{"issue":"2","key":"45_CR18","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"XVI","author":"V.N. Vapnik","year":"1971","unstructured":"Vapnik, V.N., Ya, A.: Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its applications\u00a0XVI(2), 264\u2013280 (1971)","journal-title":"Theory of Probability and its applications"},{"key":"45_CR19","volume-title":"Comprehensive Functional Verification \u2013 The Complete Industry Cycle","author":"B. Wile","year":"2005","unstructured":"Wile, B., Goss, J.C., Roesner, W.: Comprehensive Functional Verification \u2013 The Complete Industry Cycle. Elsevier, Amsterdam (2005)"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11776420_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:58Z","timestamp":1605643618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11776420_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540352945","9783540352969"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11776420_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}