{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:03:21Z","timestamp":1742954601602,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031700842"},{"type":"electronic","value":"9783031700859"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-70085-9_3","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:54Z","timestamp":1725663774000},"page":"36-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LTR-HSS: A Learning-to-Rank Based Framework for\u00a0Hypervolume Subset Selection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7859-1777","authenticated-orcid":false,"given":"Cheng","family":"Gong","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5412-914X","authenticated-orcid":false,"given":"Ping","family":"Guo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7673-3943","authenticated-orcid":false,"given":"Tianye","family":"Shu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0786-0671","authenticated-orcid":false,"given":"Qingfu","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9186-6472","authenticated-orcid":false,"given":"Hisao","family":"Ishibuchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1162\/EVCO_a_00009","volume":"19","author":"J Bader","year":"2011","unstructured":"Bader, J., Zitzler, E.: Hype: an algorithm for fast hypervolume-based many-objective optimization. Evol. Comput. 19(1), 45\u201376 (2011)","journal-title":"Evol. Comput."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Basseur, M., Derbel, B., Go\u00ebffon, A., Liefooghe, A.: Experiments on greedy and local search heuristics for d dimensional hypervolume subset selection. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, pp. 541\u2013548 (2016)","DOI":"10.1145\/2908812.2908949"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","volume":"181","author":"N Beume","year":"2007","unstructured":"Beume, N., Naujoks, B., Emmerich, M.: SMS-EMOA: multiobjective selection based on dominated hypervolume. Eur. J. Oper. Res. 181(3), 1653\u20131669 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-319-10762-2_51","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"K Bringmann","year":"2014","unstructured":"Bringmann, K., Friedrich, T., Klitzke, P.: Generic postprocessing via subset selection for hypervolume and epsilon-indicator. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 518\u2013527. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10762-2_51"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Bringmann, K., Friedrich, T., Klitzke, P.: Two-dimensional subset selection for hypervolume and epsilon-indicator. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, pp. 589\u2013596 (2014)","DOI":"10.1145\/2576768.2598276"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Chen, W., Ishibuchi, H., Shang, K.: Clustering-based subset selection in evolutionary multiobjective optimization. In: 2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 468\u2013475. IEEE (2021)","DOI":"10.1109\/SMC52423.2021.9658582"},{"issue":"4","key":"3_CR7","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/TEVC.2021.3103386","volume":"26","author":"W Chen","year":"2021","unstructured":"Chen, W., Ishibuchi, H., Shang, K.: Fast greedy subset selection from large candidate solution sets in evolutionary multiobjective optimization. IEEE Trans. Evol. Comput. 26(4), 750\u2013764 (2021)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.1597059","volume":"1","author":"CC Coello","year":"2006","unstructured":"Coello, C.C.: Evolutionary multi-objective optimization: a historical view of the field. IEEE Comput. Intell. Mag. 1(1), 28\u201336 (2006)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-319-10762-2_51","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"K Bringmann","year":"2014","unstructured":"Bringmann, K., Friedrich, T., Klitzke, P.: Generic postprocessing via subset selection for hypervolume and epsilon-indicator. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 518\u2013527. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10762-2_51"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.cor.2018.07.003","volume":"100","author":"RJ Gomes","year":"2018","unstructured":"Gomes, R.J., Guerreiro, A.P., Kuhn, T., Paquete, L.: Implicit enumeration strategies for the hypervolume subset selection problem. Comput. Oper. Res. 100, 244\u2013253 (2018)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1162\/evco_a_00235","volume":"27","author":"B Groz","year":"2019","unstructured":"Groz, B., Maniu, S.: Hypervolume subset selection with small subsets. Evol. Comput. 27(4), 611\u2013637 (2019)","journal-title":"Evol. Comput."},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1162\/EVCO_a_00188","volume":"24","author":"AP Guerreiro","year":"2016","unstructured":"Guerreiro, A.P., Fonseca, C.M., Paquete, L.: Greedy hypervolume subset selection in low dimensions. Evol. Comput. 24(3), 521\u2013544 (2016)","journal-title":"Evol. Comput."},{"key":"3_CR13","unstructured":"Hansen, M.P., Jaszkiewicz, A.: Evaluating the quality of approximations to the non-dominated set. IMM, Department of Mathematical Modelling, Technical Universityof Denmark (1994)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H., Pang, L.M., Shang, K.: A new framework of evolutionary multi-objective algorithms with an unbounded external archive. In: Proceedings European Conference on Artificial Intelligence, pp. 283\u2013290 (2020)","DOI":"10.36227\/techrxiv.11661276"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-319-15892-1_8","volume-title":"Evolutionary Multi-Criterion Optimization","author":"H Ishibuchi","year":"2015","unstructured":"Ishibuchi, H., Masuda, H., Tanigaki, Y., Nojima, Y.: Modified distance calculation in generational distance and inverted generational distance. In: Gaspar-Cunha, A., Henggeler Antunes, C., Coello, C.C. (eds.) EMO 2015. LNCS, vol. 9019, pp. 110\u2013125. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15892-1_8"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H., Sakane, Y., Tsukamoto, N., Nojima, Y.: Selecting a small number of representative non-dominated solutions by a hypervolume-based solution selection approach. In: 2009 IEEE International Conference on Fuzzy Systems, pp. 1609\u20131614. IEEE (2009)","DOI":"10.1109\/FUZZY.2009.5277324"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H., Setoguchi, Y., Masuda, H., Nojima, Y.: How to compare many-objective algorithms under different settings of population and archive sizes. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 1149\u20131156. IEEE (2016)","DOI":"10.1109\/CEC.2016.7743917"},{"issue":"10","key":"3_CR18","doi-asserted-by":"publisher","first-page":"2202","DOI":"10.1109\/TCYB.2014.2367526","volume":"45","author":"S Jiang","year":"2014","unstructured":"Jiang, S., Zhang, J., Ong, Y.S., Zhang, A.N., Tan, P.S.: A simple and fast hypervolume indicator-based multiobjective evolutionary algorithm. IEEE Trans. Cybern. 45(10), 2202\u20132213 (2014)","journal-title":"IEEE Trans. Cybern."},{"key":"3_CR19","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)"},{"issue":"3","key":"3_CR20","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1162\/EVCO_a_00157","volume":"24","author":"T Kuhn","year":"2016","unstructured":"Kuhn, T., Fonseca, C.M., Paquete, L., Ruzika, S., Duarte, M.M., Figueira, J.R.: Hypervolume subset selection in two dimensions: formulations and algorithms. Evol. Comput. 24(3), 411\u2013425 (2016)","journal-title":"Evol. Comput."},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Nan, Y., Shang, K., Ishibuchi, H., He, L.: Improving local search hypervolume subset selection in evolutionary multi-objective optimization. In: 2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 751\u2013757. IEEE (2021)","DOI":"10.1109\/SMC52423.2021.9659147"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Nan, Y., Shang, K., Ishibuchi, H., He, L.: An improved local search method for large-scale hypervolume subset selection. IEEE Trans. Evol. Comput. (2022)","DOI":"10.1109\/TEVC.2022.3219081"},{"key":"3_CR23","unstructured":"Navon, A., Shamsian, A., Chechik, G., Fetaya, E.: Learning the pareto front with hypernetworks. arXiv preprint arXiv:2010.04104 (2020)"},{"key":"3_CR24","unstructured":"Paszke, A., et\u00a0al.: PyTorch: an imperative style, high-performance deep learning library. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Qian, C., Bian, C., Feng, C.: Subset selection by pareto optimization with recombination. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a034, pp. 2408\u20132415 (2020)","DOI":"10.1609\/aaai.v34i03.5621"},{"key":"3_CR26","unstructured":"Qian, C., Yu, Y., Zhou, Z.H.: Subset selection by pareto optimization. In: Advances in Neural Information Processing Systems, vol. 28 (2015)"},{"issue":"5","key":"3_CR27","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1109\/TEVC.2020.2964705","volume":"24","author":"K Shang","year":"2020","unstructured":"Shang, K., Ishibuchi, H.: A new hypervolume-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 24(5), 839\u2013852 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Shang, K., Ishibuchi, H., Chen, W.: Greedy approximated hypervolume subset selection for many-objective optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 448\u2013456 (2021)","DOI":"10.1145\/3449639.3459390"},{"key":"3_CR29","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.ins.2022.11.155","volume":"622","author":"K Shang","year":"2023","unstructured":"Shang, K., Shu, T., Ishibuchi, H., Nan, Y., Pang, L.M.: Benchmarking large-scale subset selection in evolutionary multi-objective optimization. Inf. Sci. 622, 755\u2013770 (2023)","journal-title":"Inf. Sci."},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Shu, T., Shang, K., Ishibuchi, H., Nan, Y.: Effects of archive size on computation time and solution quality for multi-objective optimization. IEEE Trans. Evol. Comput. (2022)","DOI":"10.1109\/TEVC.2022.3219521"},{"issue":"5","key":"3_CR31","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1109\/TEVC.2018.2883094","volume":"23","author":"HK Singh","year":"2018","unstructured":"Singh, H.K., Bhattacharjee, K.S., Ray, T.: Distance-based subset selection for benchmarking in evolutionary multi\/many-objective optimization. IEEE Trans. Evol. Comput. 23(5), 904\u2013912 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Suresh, A., Deb, K.: Machine learning based prediction of new pareto-optimal solutions from pseudo-weights. IEEE Trans. Evol. Comput. (2023)","DOI":"10.1109\/TEVC.2023.3319494"},{"key":"3_CR33","unstructured":"Zhang, X., Lin, X., Xue, B., Chen, Y., Zhang, Q.: Hypervolume maximization: a geometric view of pareto set learning. In: Advances in Neural Information Processing Systems, vol. 36 (2024)"},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0056872","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN V","author":"E Zitzler","year":"1998","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms \u2014 a comparative case study. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 292\u2013301. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056872"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70085-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:33Z","timestamp":1725664413000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70085-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700842","9783031700859"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70085-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}