{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:25:16Z","timestamp":1750307116479,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,8,21]],"date-time":"2011-08-21T00:00:00Z","timestamp":1313884800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,8,21]]},"DOI":"10.1145\/2020408.2020553","type":"proceedings-article","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T15:22:45Z","timestamp":1314804165000},"page":"850-858","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Active learning using on-line algorithms"],"prefix":"10.1145","author":[{"given":"Chris","family":"Mesterharm","sequence":"first","affiliation":[{"name":"Rutgers, The State University of New Jersey, Piscataway, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J.","family":"Pazzani","sequence":"additional","affiliation":[{"name":"Rutgers, The State University of New Jersey, Piscataway, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,8,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.11.004"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835859"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143853"},{"key":"e_1_3_2_1_4_1","volume-title":"The true sample complexity of active learning. Machine Learning, 80(2--3):111--139","author":"Balcan M. F.","year":"2010","unstructured":"M. F. Balcan , S. Hanneke , and J. W. Vaughan . The true sample complexity of active learning. Machine Learning, 80(2--3):111--139 , 2010 . M. F. Balcan, S. Hanneke, and J. W. Vaughan. The true sample complexity of active learning. Machine Learning, 80(2--3):111--139, 2010."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553381"},{"key":"e_1_3_2_1_6_1","volume-title":"NIPS","author":"Beygelzimer A.","year":"2010","unstructured":"A. Beygelzimer , D. Hsu , J. Langford , and T. Zhang . Agnostic active learning without constraints . In NIPS , 2010 . A. Beygelzimer, D. Hsu, J. Langford, and T. Zhang. Agnostic active learning without constraints. In NIPS, 2010."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.34.123"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.833339"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248591"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022627411411"},{"key":"e_1_3_2_1_11_1","first-page":"235","volume-title":"Coarse sample complexity bounds for active learning","author":"Dasgupta S.","year":"2006","unstructured":"S. Dasgupta . Coarse sample complexity bounds for active learning . In Y. Weiss, B. Sch\u00f6lkopf, and J. Platt, editors, NIPS, pages 235 -- 242 , Cambridge, MA, 2006 . MIT Press . S. Dasgupta. Coarse sample complexity bounds for active learning. In Y. Weiss, B. Sch\u00f6lkopf, and J. Platt, editors, NIPS, pages 235--242, Cambridge, MA, 2006. MIT Press."},{"key":"e_1_3_2_1_12_1","volume-title":"NIPS","author":"Dasgupta S.","year":"2007","unstructured":"S. Dasgupta , D. Hsu , and C. Monteleoni . A general agnostic active learning algorithm . In NIPS , 2007 . S. Dasgupta, D. Hsu, and C. Monteleoni. A general agnostic active learning algorithm. In NIPS, 2007."},{"key":"e_1_3_2_1_13_1","volume-title":"UCI repository of machine learning databases","author":"Newman C. B. D.J.","year":"1998","unstructured":"C. B. D.J. Newman , S. Hettich and C. Merz . UCI repository of machine learning databases , 1998 ; http:\/\/archive.ics.uci.edu\/ml\/. C. B. D.J. Newman, S. Hettich and C. Merz. UCI repository of machine learning databases, 1998; http:\/\/archive.ics.uci.edu\/ml\/."},{"key":"e_1_3_2_1_14_1","volume-title":"Internet advertising and the generalized second-price auction American Economic Review, 97(1):242--259","author":"Edelman B.","year":"2007","unstructured":"B. Edelman , M. Ostrovsky , and M. Schwarz . Internet advertising and the generalized second-price auction American Economic Review, 97(1):242--259 , 2007 . B. Edelman, M. Ostrovsky, and M. Schwarz. Internet advertising and the generalized second-price auction American Economic Review, 97(1):242--259, 2007."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/279943.279985"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007330508534"},{"key":"e_1_3_2_1_17_1","first-page":"213","article-title":"A new approximate maximal margin classification algorithm","volume":"2","author":"Gentile C.","year":"2001","unstructured":"C. Gentile . A new approximate maximal margin classification algorithm . Machine Learning , 2 : 213 -- 242 , 2001 . C. Gentile. A new approximate maximal margin classification algorithm. Machine Learning, 2:213--242, 2001.","journal-title":"Machine Learning"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS843"},{"key":"e_1_3_2_1_19_1","volume-title":"SIGIR","author":"Jenkins M.-C.","year":"2005","unstructured":"M.-C. Jenkins and D. Smith . Conservative stemming for search and indexing . In SIGIR , 2005 . M.-C. Jenkins and D. Smith. Conservative stemming for search and indexing. In SIGIR, 2005."},{"key":"e_1_3_2_1_20_1","volume-title":"Advances in Kernel Methods: Support Vector Machines","author":"Joachims T.","year":"1999","unstructured":"T. Joachims . Making large-scale support vector machine learning practical . In A. S. B. Sch\u00f6lkopf, C. Burges, editor, Advances in Kernel Methods: Support Vector Machines . MIT Press , Cambridge, MA , 1999 . T. Joachims. Making large-scale support vector machine learning practical. In A. S. B. Sch\u00f6lkopf, C. Burges, editor, Advances in Kernel Methods: Support Vector Machines. MIT Press, Cambridge, MA, 1999."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/188490.188495"},{"key":"e_1_3_2_1_22_1","first-page":"591","volume-title":"AAAI","author":"Liere R.","year":"1997","unstructured":"R. Liere and P. Tadepalli . Active learning with committees for text categorization . In AAAI , pages 591 -- 596 , 1997 . R. Liere and P. Tadepalli. Active learning with committees for text categorization. In AAAI, pages 591--596, 1997."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022869011914"},{"key":"e_1_3_2_1_24_1","first-page":"269","volume-title":"COLT","author":"Littlestone N.","year":"1989","unstructured":"N. Littlestone . From on-line to batch learning . In COLT , pages 269 -- 284 , 1989 . N. Littlestone. From on-line to batch learning. In COLT, pages 269--284, 1989."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2686"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1116025"}],"event":{"name":"KDD '11: The 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"San Diego California USA","acronym":"KDD '11"},"container-title":["Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2020408.2020553","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2020408.2020553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:17Z","timestamp":1750240097000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2020408.2020553"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,21]]},"references-count":26,"alternative-id":["10.1145\/2020408.2020553","10.1145\/2020408"],"URL":"https:\/\/doi.org\/10.1145\/2020408.2020553","relation":{},"subject":[],"published":{"date-parts":[[2011,8,21]]},"assertion":[{"value":"2011-08-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}