{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:55:34Z","timestamp":1759334134981,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032061089"},{"type":"electronic","value":"9783032061096"}],"license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-06109-6_13","type":"book-chapter","created":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T10:04:37Z","timestamp":1759226677000},"page":"219-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Submodular Sequencing from\u00a0Samples"],"prefix":"10.1007","author":[{"given":"Jing","family":"Yuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaojie","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Anderson, S.P., De\u00a0Palma, A., Thisse, J.F.: Discrete Choice Theory of Product Differentiation. MIT press (1992)","DOI":"10.7551\/mitpress\/2450.001.0001"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Asadpour, A., Niazadeh, R., Saberi, A., Shameli, A.: Sequential submodular maximization and applications to ranking an assortment of products. Oper. Res. 71(4), 1154\u20131170 (2022)","DOI":"10.1287\/opre.2022.2370"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Azar, Y., Gamzu, I.: Ranking with submodular valuations. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1070\u20131079. SIAM (2011)","DOI":"10.1137\/1.9781611973082.81"},{"key":"13_CR4","unstructured":"Balcan, M.F., Constantin, F., Iwata, S., Wang, L.: Learning valuation functions. In: Conference on Learning Theory, pp.\u00a04\u20131. JMLR Workshop and Conference Proceedings (2012)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Balcan, M.F., Harvey, N.J.: Learning submodular functions. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, pp. 793\u2013802 (2011)","DOI":"10.1145\/1993636.1993741"},{"key":"13_CR6","unstructured":"Balkanski, E., Rubinstein, A., Singer, Y.: The power of optimization from samples. In: Advances in Neural Information Processing Systems, vol. 29 (2016)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Balkanski, E., Rubinstein, A., Singer, Y.: The limitations of optimization from samples. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1016\u20131027 (2017)","DOI":"10.1145\/3055399.3055406"},{"key":"13_CR8","unstructured":"Chen, W., Sun, X., Zhang, J., Zhang, Z.: Optimization from structured samples for coverage functions. In: International Conference on Machine Learning, pp. 1715\u20131724. PMLR (2020)"},{"key":"13_CR9","unstructured":"Chen, W., Sun, X., Zhang, J., Zhang, Z.: Network inference and influence maximization from samples. In: International Conference on Machine Learning, pp. 1707\u20131716. PMLR (2021)"},{"key":"13_CR10","unstructured":"Das, A., Kempe, D.: Submodular meets spectral: greedy algorithms for subset selection, sparse approximation and dictionary selection. In: Proceedings of the 28th International Conference on International Conference on Machine Learning, pp. 1057\u20131064 (2011)"},{"key":"13_CR11","unstructured":"Feldman, V., Kothari, P.: Learning coverage functions and private release of marginals. In: Conference on Learning Theory, pp. 679\u2013702. PMLR (2014)"},{"key":"13_CR12","unstructured":"Feldman, V., Kothari, P., Vondr\u00e1k, J.: Representation, approximation and learning of submodular functions using low-rank decision trees. In: Conference on Learning Theory, pp. 711\u2013740. PMLR (2013)"},{"key":"13_CR13","first-page":"427","volume":"42","author":"D Golovin","year":"2011","unstructured":"Golovin, D., Krause, A.: Adaptive submodularity: theory and applications in active learning and stochastic optimization. J. Artif. Intell. Res. 42, 427\u2013486 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"13_CR14","unstructured":"Lin, H., Bilmes, J.: A class of submodular functions for document summarization. In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, pp. 510\u2013520 (2011)"},{"issue":"1","key":"13_CR15","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-i. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"13_CR16","unstructured":"Schrijver, A., et\u00a0al.: Combinatorial Optimization: Polyhedra and Efficiency, vol.\u00a024. Springer (2003)"},{"issue":"1","key":"13_CR17","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.orl.2019.10.013","volume":"48","author":"S Tang","year":"2020","unstructured":"Tang, S., Yuan, J.: Influence maximization with partial feedback. Oper. Res. Lett. 48(1), 24\u201328 (2020)","journal-title":"Oper. Res. Lett."},{"issue":"7","key":"13_CR18","doi-asserted-by":"crossref","first-page":"2143","DOI":"10.1111\/poms.13359","volume":"30","author":"S Tang","year":"2021","unstructured":"Tang, S., Yuan, J.: Cascade submodular maximization: question selection and sequencing in online personality quiz. Prod. Oper. Manag. 30(7), 2143\u20132161 (2021)","journal-title":"Prod. Oper. Manag."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Tang, S., Yuan, J.: Optimal sampling gaps for adaptive submodular maximization. In: AAAI (2022)","DOI":"10.1007\/s10878-022-00965-9"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Tang, S., Yuan, J.: Non-monotone sequential submodular maximization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a038, pp. 15284\u201315291 (2024)","DOI":"10.1609\/aaai.v38i14.29452"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Tschiatschek, S., Singla, A., Krause, A.: Selecting sequences of items via submodular maximization. In: Thirty-First AAAI Conference on Artificial Intelligence (2017)","DOI":"10.1609\/aaai.v31i1.10923"},{"issue":"3","key":"13_CR22","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1007\/s10618-022-00833-4","volume":"36","author":"G Zhang","year":"2022","unstructured":"Zhang, G., Tatti, N., Gionis, A.: Ranking with submodular functions on a budget. Data Min. Knowl. Disc. 36(3), 1197\u20131218 (2022)","journal-title":"Data Min. Knowl. Disc."}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases. Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-06109-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T10:04:53Z","timestamp":1759226693000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-06109-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"ISBN":["9783032061089","9783032061096"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-06109-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"assertion":[{"value":"1 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecmlpkdd.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}