{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T22:35:02Z","timestamp":1761518102932,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T00:00:00Z","timestamp":1439164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["307036"],"award-info":[{"award-number":["307036"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001711","name":"Schweizerische Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["200020_159557"],"award-info":[{"award-number":["200020_159557"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,8,10]]},"DOI":"10.1145\/2783258.2783360","type":"proceedings-article","created":{"date-parts":[[2015,8,7]],"date-time":"2015-08-07T15:38:27Z","timestamp":1438961907000},"page":"1195-1204","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Discovering Valuable items from Massive Data"],"prefix":"10.1145","author":[{"given":"Hastagiri P.","family":"Vanchinathan","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Andreas","family":"Marfurt","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Charles-Antoine","family":"Robelin","sequence":"additional","affiliation":[{"name":"Amadeus IT group SA, Nice, France"}]},{"given":"Donald","family":"Kossmann","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Andreas","family":"Krause","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2015,8,10]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.30"},{"key":"e_1_3_2_2_3_1","volume-title":"Advances in Neural Information Processing Systems (NIPS)","author":"Bubeck S.","year":"2008","unstructured":"}Bubeck08 S. Bubeck , R. Munos , G. Stoltz , and C. Szepesv\u00e1ri . Online optimization in X-armed bandits . In Advances in Neural Information Processing Systems (NIPS) , 2008 . }Bubeck08S. Bubeck, R. Munos, G. Stoltz, and C. Szepesv\u00e1ri. Online optimization in X-armed bandits. In Advances in Neural Information Processing Systems (NIPS), 2008."},{"key":"e_1_3_2_2_4_1","volume-title":"Theory of capacities. Annales de l'institut Fourier, 5: 131--295","author":"Choquet G.","year":"1954","unstructured":"G. Choquet . Theory of capacities. Annales de l'institut Fourier, 5: 131--295 , 1954 . G. Choquet. Theory of capacities. Annales de l'institut Fourier, 5: 131--295, 1954."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557138"},{"key":"e_1_3_2_2_6_1","volume-title":"Advances in Neural Information Processing Systems (NIPS)","author":"Dani V.","year":"2007","unstructured":"V. Dani , T. P. Hayes , and S. Kakade . The price of bandit information for online optimization . In Advances in Neural Information Processing Systems (NIPS) , 2007 . V. Dani, T. P. Hayes, and S. Kakade. The price of bandit information for online optimization. In Advances in Neural Information Processing Systems (NIPS), 2007."},{"key":"e_1_3_2_2_7_1","volume-title":"Journal of Machine Learning Research (JMLR)","author":"Desautels T.","year":"2014","unstructured":"T. Desautels , A. Krause , and J. Burdick . Parallelizing exploration-exploitation tradeoffs in gaussian process bandit optimization . Journal of Machine Learning Research (JMLR) , 2014 . T. Desautels, A. Krause, and J. Burdick. Parallelizing exploration-exploitation tradeoffs in gaussian process bandit optimization. Journal of Machine Learning Research (JMLR), 2014."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_2_9_1","volume-title":"Proceredings of the 29th Annual International Conference on Machine Learning (ICML)","author":"Garnett R.","year":"2012","unstructured":"R. Garnett , Y. Krishnamurthy , X. Xiong , J. Schneider , and R. Mann . Bayesian optimal active search and surveying . Proceredings of the 29th Annual International Conference on Machine Learning (ICML) , 2012 . R. Garnett, Y. Krishnamurthy, X. Xiong, J. Schneider, and R. Mann. Bayesian optimal active search and surveying. Proceredings of the 29th Annual International Conference on Machine Learning (ICML), 2012."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.48"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0059-1"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm611"},{"key":"e_1_3_2_2_13_1","first-page":"1054","volume-title":"Advances in Neural Information Processing Systems (NIPS)","author":"Kale S.","year":"2010","unstructured":"S. Kale , L. Reyzin , and R. E. Schapire . Non-stochastic bandit slate problems . In Advances in Neural Information Processing Systems (NIPS) , pages 1054 -- 1062 , 2010 . S. Kale, L. Reyzin, and R. E. Schapire. Non-stochastic bandit slate problems. In Advances in Neural Information Processing Systems (NIPS), pages 1054--1062, 2010."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126239"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374475"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-010-5178-7"},{"key":"e_1_3_2_2_17_1","volume-title":"Advances in Neural Information Processing Systems (NIPS)","author":"Krause A.","year":"2011","unstructured":"A. Krause and C. S. Ong . Contextual gaussian process bandit optimization . In Advances in Neural Information Processing Systems (NIPS) , 2011 . A. Krause and C. S. Ong. Contextual gaussian process bandit optimization. In Advances in Neural Information Processing Systems (NIPS), 2011."},{"key":"e_1_3_2_2_18_1","first-page":"2","article-title":"Determinantal point processes for machine learning","volume":"5","author":"Kulesza A.","year":"2012","unstructured":"A. Kulesza and B. Taskar . Determinantal point processes for machine learning . Machine Learning , 5 ( 2 -- 3 ): 123--286, 2012 . A. Kulesza and B. Taskar. Determinantal point processes for machine learning. Machine Learning, 5 (2--3): 123--286, 2012.","journal-title":"Machine Learning"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"e_1_3_2_2_20_1","first-page":"609","volume-title":"NIPS","author":"Lawrence N. D.","year":"2002","unstructured":"N. D. Lawrence , M. Seeger , and R. Herbrich . Fast sparse gaussian process methods: The informative vector machine . NIPS , pages 609 -- 616 , 2002 . N. D. Lawrence, M. Seeger, and R. Herbrich. Fast sparse gaussian process methods: The informative vector machine. NIPS, pages 609--616, 2002."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"e_1_3_2_2_22_1","first-page":"510","volume-title":"Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies -","volume":"1","author":"Lin H.","year":"2011","unstructured":"H. Lin and J. Bilmes . A class of submodular functions for document summarization . Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1 , HLT '11, pages 510 -- 520 , 2011 . H. Lin and J. Bilmes. A class of submodular functions for document summarization. Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1, HLT '11, pages 510--520, 2011."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0006528"},{"key":"e_1_3_2_2_24_1","volume-title":"Mathematical Programming","author":"Nemhauser G.","year":"1978","unstructured":"G. Nemhauser , L. Wolsey , and M. Fisher . An analysis of approximations for maximizing submodular set functions-1 . Mathematical Programming , 1978 . G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of approximations for maximizing submodular set functions-1. Mathematical Programming, 1978."},{"key":"e_1_3_2_2_25_1","volume-title":"June","author":"Peters B.","year":"2006","unstructured":"B. Peters , H. Bui , S. Frankild , M. Nielsen , C. Lundegaard , E. Kostem , D. Basch , K. Lamberth , M. Harndahl , W. Fleri , S. Wilson , J. Sidney , O. Lund , S. Buus , and A. Sette . A Community Resource Benchmarking Predictions of Peptide Binding to MHC-I Molecules. PLoS Comput Biol, 2 (6) , June 2006 . B. Peters, H. Bui, S. Frankild, M. Nielsen, C. Lundegaard, E. Kostem, D. Basch, K. Lamberth, M. Harndahl, W. Fleri, S. Wilson, J. Sidney, O. Lund, S. Buus, and A. Sette. A Community Resource Benchmarking Predictions of Peptide Binding to MHC-I Molecules. PLoS Comput Biol, 2 (6), June 2006."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1162254"},{"key":"e_1_3_2_2_27_1","volume-title":"Regularization, Optimization, and Beyond","author":"Sch\u00f6lkopf B.","year":"2001","unstructured":"opf and Smola(2001)}Scholkopf01 B. Sch\u00f6lkopf and A. J. Smola . Learning with Kernels: Support Vector Machines , Regularization, Optimization, and Beyond . MIT Press , Cambridge, MA, USA , 2001 . ISBN 0262194759. opf and Smola(2001)}Scholkopf01B. Sch\u00f6lkopf and A. J. Smola. Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press, Cambridge, MA, USA, 2001. ISBN 0262194759."},{"key":"e_1_3_2_2_28_1","volume-title":"Morgan & Claypool","author":"Settles B.","year":"2012","unstructured":"B. Settles . Active Learning. Synthesis Lectures on Artificial Intelligence and Machine Learning . Morgan & Claypool , 2012 . B. Settles. Active Learning. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool, 2012."},{"key":"e_1_3_2_2_29_1","first-page":"983","volume-title":"International Conference on Machine Learning(ICML)","author":"Slivkins A.","year":"2010","unstructured":"A. Slivkins , F. Radlinski , and S. Gollapudi . Learning optimally diverse rankings over large document collections . International Conference on Machine Learning(ICML) , pages 983 -- 990 , 2010 . A. Slivkins, F. Radlinski, and S. Gollapudi. Learning optimally diverse rankings over large document collections. International Conference on Machine Learning(ICML), pages 983--990, 2010."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2182033"},{"key":"e_1_3_2_2_31_1","first-page":"1577","volume-title":"Advances in Neural Information Processing Systems 21","author":"Streeter M.","year":"2008","unstructured":"M. Streeter and D. Golovin . An online algorithm for maximizing submodular functions . Advances in Neural Information Processing Systems 21 , pages 1577 -- 1584 . 2008 . M. Streeter and D. Golovin. An online algorithm for maximizing submodular functions. Advances in Neural Information Processing Systems 21, pages 1577--1584. 2008."},{"key":"e_1_3_2_2_32_1","volume-title":"Advances in Neural Information Processing Systems (NIPS)","author":"Streeter M.","year":"2009","unstructured":"M. Streeter , D. Golovin , and A. Krause . Online learning of assignments . In Advances in Neural Information Processing Systems (NIPS) , 2009 . M. Streeter, D. Golovin, and A. Krause. Online learning of assignments. In Advances in Neural Information Processing Systems (NIPS), 2009."},{"key":"e_1_3_2_2_33_1","volume-title":"AAAI","author":"Tran-Thanh L.","year":"2010","unstructured":"L. Tran-Thanh , A. C. Chapman , E. M. de Cote , A. Rogers , and N. R. Jennings . Epsilon-first policies for budget-limited multi-armed bandits . AAAI , 2010 . L. Tran-Thanh, A. C. Chapman, E. M. de Cote, A. Rogers, and N. R. Jennings. Epsilon-first policies for budget-limited multi-armed bandits. AAAI, 2010."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645733"},{"key":"e_1_3_2_2_35_1","volume-title":"June","author":"Vanchinathan H. P.","year":"2015","unstructured":"t al.(2015)Vanchinathan, Marfurt, Robelin, Kossmann, and Krause}Vanchinathan15Arxiv H. P. Vanchinathan , A. Marfurt , C.-A. Robelin , D. Kossmann , and A. Krause . Discovering Valuable Items from Massive Data. ArXiv e-prints , June 2015 . URL http:\/\/arxiv.org\/abs\/1506.00935. t al.(2015)Vanchinathan, Marfurt, Robelin, Kossmann, and Krause}Vanchinathan15ArxivH. P. Vanchinathan, A. Marfurt, C.-A. Robelin, D. Kossmann, and A. Krause. Discovering Valuable Items from Massive Data. ArXiv e-prints, June 2015. URL http:\/\/arxiv.org\/abs\/1506.00935."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487605"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/2540128.2540383"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci025620t"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"C. Widmer N. Toussaint Y. Altun and G. Ratsch. Inferring latent task structure for Multitask Learning by Multiple Kernel Learning. BMC Bioinformatics 11 (Suppl 8): S5  C. Widmer N. Toussaint Y. Altun and G. Ratsch. Inferring latent task structure for Multitask Learning by Multiple Kernel Learning. BMC Bioinformatics 11 (Suppl 8): S5","DOI":"10.1186\/1471-2105-11-S8-S5"},{"key":"e_1_3_2_2_40_1","unstructured":"2010. 2010."},{"key":"e_1_3_2_2_41_1","volume-title":"Advances in Neural Information Processing Systems (NIPS)","author":"Yue Y.","year":"2011","unstructured":"Y. Yue and C. Guestrin . Linear submodular bandits and their application to diversified retrieval . In Advances in Neural Information Processing Systems (NIPS) , Granada, Spain , December 2011 . Y. Yue and C. Guestrin. Linear submodular bandits and their application to diversified retrieval. In Advances in Neural Information Processing Systems (NIPS), Granada, Spain, December 2011."}],"event":{"name":"KDD '15: The 21th 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":"Sydney NSW Australia","acronym":"KDD '15"},"container-title":["Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2783258.2783360","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2783258.2783360","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:23Z","timestamp":1750223243000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2783258.2783360"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,10]]},"references-count":41,"alternative-id":["10.1145\/2783258.2783360","10.1145\/2783258"],"URL":"https:\/\/doi.org\/10.1145\/2783258.2783360","relation":{},"subject":[],"published":{"date-parts":[[2015,8,10]]},"assertion":[{"value":"2015-08-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}