{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:04:07Z","timestamp":1725516247182},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642334856"},{"type":"electronic","value":"9783642334863"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33486-3_61","type":"book-chapter","created":{"date-parts":[[2012,9,10]],"date-time":"2012-09-10T16:39:17Z","timestamp":1347295157000},"page":"846-849","source":"Crossref","is-referenced-by-count":2,"title":["Learning Submodular Functions"],"prefix":"10.1007","author":[{"given":"Maria-Florina","family":"Balcan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas J. A.","family":"Harvey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"61_CR1","unstructured":"NIPS workshop on discrete optimization in machine learning: Submodularity, sparsity & polyhedra, DISCML (2009), http:\/\/www.discml.cc\/"},{"key":"61_CR2","unstructured":"NIPS workshop on discrete optimization in machine learning (discml): Uncertainty, generalization and feedback (2011), http:\/\/las.ethz.ch\/discml\/"},{"key":"61_CR3","doi-asserted-by":"crossref","unstructured":"Balcan, M.F., Blum, A., Mansour, Y.: Item pricing for revenue maxmimization. In: ACM Conference on Electronic Commerce (2009)","DOI":"10.1145\/1386790.1386802"},{"key":"61_CR4","doi-asserted-by":"crossref","unstructured":"Blum, A., Burch, C., Langford, J.: On learning monotone boolean functions. In: FOCS (1998)","DOI":"10.1109\/SFCS.1998.743491"},{"key":"61_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-70575-8_4","volume-title":"Automata, Languages and Programming","author":"D. Dachman-Soled","year":"2008","unstructured":"Dachman-Soled, D., Lee, H.K., Malkin, T., Servedio, R.A., Wan, A., Wee, H.M.: Optimal Cryptographic Hardness of Learning Monotone Functions. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 36\u201347. Springer, Heidelberg (2008)"},{"key":"61_CR6","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Truthful Randomized Mechanisms for Combinatorial Auctions. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 644\u2013652 (2006)","DOI":"10.1145\/1132516.1132607"},{"key":"61_CR7","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1137\/1.9781611973068.59","volume-title":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Michel X. Goemans","year":"2009","unstructured":"Goemans, M., Harvey, N., Iwata, S., Mirrokni, V.: Approximating submodular functions everywhere. In: ACM-SIAM Symposium on Discrete Algorithms (2009)"},{"key":"61_CR8","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer (1993)","DOI":"10.1007\/978-3-642-78240-4"},{"key":"61_CR9","unstructured":"Krause, A., Guestrin, C.: Beyond convexity: Submodularity in machine learning (2008), http:\/\/www.select.cs.cmu.edu\/tutorials\/icml08submodularity.html"},{"key":"61_CR10","unstructured":"Krause, A., Guestrin, C.: Intelligent information gathering and submodular function optimization (2009), http:\/\/submodularity.org\/ijcai09\/index.html"},{"key":"61_CR11","unstructured":"Krause, A., Guestrin, C.: Near-optimal nonmyopic value of information in graphical models. In: UAI (2005)"},{"key":"61_CR12","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.geb.2005.02.006","volume":"55","author":"B. Lehmann","year":"2006","unstructured":"Lehmann, B., Lehmann, D.J., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior\u00a055, 270\u2013296 (2006)","journal-title":"Games and Economic Behavior"},{"key":"61_CR13","unstructured":"Narasimhan, M., Bilmes, J.: Local search for balanced submodular clusterings. In: Twentieth International Joint Conference on Artificial Intelligence (2007)"},{"key":"61_CR14","doi-asserted-by":"crossref","unstructured":"Vondr\u00e1k, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: STOC (2008)","DOI":"10.1145\/1374376.1374389"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33486-3_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T17:24:56Z","timestamp":1562174696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33486-3_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334856","9783642334863"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33486-3_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}