[{"type":"book_chapter","publication":"Advances in Knowledge Discovery and Data Mining","status":"public","user_id":"25078","department":[{"_id":"64"}],"_id":"2978","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319317496","9783319317502"]},"citation":{"short":"J. Blömer, K. Bujna, in: Advances in Knowledge Discovery and Data Mining, Springer International Publishing, Cham, 2016, pp. 296–308.","mla":"Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” <i>Advances in Knowledge Discovery and Data Mining</i>, Springer International Publishing, 2016, pp. 296–308, doi:<a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">10.1007/978-3-319-31750-2_24</a>.","bibtex":"@inbook{Blömer_Bujna_2016, place={Cham}, title={Adaptive Seeding for Gaussian Mixture Models}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">10.1007/978-3-319-31750-2_24</a>}, booktitle={Advances in Knowledge Discovery and Data Mining}, publisher={Springer International Publishing}, author={Blömer, Johannes and Bujna, Kathrin}, year={2016}, pages={296–308} }","apa":"Blömer, J., &#38; Bujna, K. (2016). Adaptive Seeding for Gaussian Mixture Models. In <i>Advances in Knowledge Discovery and Data Mining</i> (pp. 296–308). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">https://doi.org/10.1007/978-3-319-31750-2_24</a>","ama":"Blömer J, Bujna K. Adaptive Seeding for Gaussian Mixture Models. In: <i>Advances in Knowledge Discovery and Data Mining</i>. Springer International Publishing; 2016:296-308. doi:<a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">10.1007/978-3-319-31750-2_24</a>","chicago":"Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” In <i>Advances in Knowledge Discovery and Data Mining</i>, 296–308. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">https://doi.org/10.1007/978-3-319-31750-2_24</a>.","ieee":"J. Blömer and K. Bujna, “Adaptive Seeding for Gaussian Mixture Models,” in <i>Advances in Knowledge Discovery and Data Mining</i>, Cham: Springer International Publishing, 2016, pp. 296–308."},"page":"296-308","year":"2016","place":"Cham","author":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Kathrin","full_name":"Bujna, Kathrin","last_name":"Bujna"}],"date_created":"2018-06-05T07:31:39Z","publisher":"Springer International Publishing","date_updated":"2023-01-10T13:49:50Z","doi":"10.1007/978-3-319-31750-2_24","title":"Adaptive Seeding for Gaussian Mixture Models"},{"language":[{"iso":"eng"}],"keyword":["Artificial Intelligence","Computer Science Applications","Linguistics and Language","Language and Linguistics"],"department":[{"_id":"34"},{"_id":"820"}],"user_id":"15504","_id":"48306","status":"public","abstract":[{"text":"<jats:p>The goal of argumentation mining, an evolving research field in computational linguistics, is to design methods capable of analyzing people's argumentation. In this article, we go beyond the state of the art in several ways. (i) We deal with actual Web data and take up the challenges given by the variety of registers, multiple domains, and unrestricted noisy user-generated Web discourse. (ii) We bridge the gap between normative argumentation theories and argumentation phenomena encountered in actual data by adapting an argumentation model tested in an extensive annotation study. (iii) We create a new gold standard corpus (90k tokens in 340 documents) and experiment with several machine learning methods to identify argument components. We offer the data, source codes, and annotation guidelines to the community under free licenses. Our findings show that argumentation mining in user-generated Web discourse is a feasible but challenging task.</jats:p>","lang":"eng"}],"publication":"Computational Linguistics","type":"journal_article","doi":"10.1162/coli_a_00276","title":"Argumentation Mining in User-Generated Web Discourse","volume":43,"date_created":"2023-10-19T08:30:44Z","author":[{"first_name":"Ivan","id":"101881","full_name":"Habernal, Ivan","last_name":"Habernal"},{"first_name":"Iryna","last_name":"Gurevych","full_name":"Gurevych, Iryna"}],"date_updated":"2023-10-19T12:08:00Z","publisher":"MIT Press","intvolume":"        43","page":"125-179","citation":{"chicago":"Habernal, Ivan, and Iryna Gurevych. “Argumentation Mining in User-Generated Web Discourse.” <i>Computational Linguistics</i> 43, no. 1 (2016): 125–79. <a href=\"https://doi.org/10.1162/coli_a_00276\">https://doi.org/10.1162/coli_a_00276</a>.","ieee":"I. Habernal and I. Gurevych, “Argumentation Mining in User-Generated Web Discourse,” <i>Computational Linguistics</i>, vol. 43, no. 1, pp. 125–179, 2016, doi: <a href=\"https://doi.org/10.1162/coli_a_00276\">10.1162/coli_a_00276</a>.","ama":"Habernal I, Gurevych I. Argumentation Mining in User-Generated Web Discourse. <i>Computational Linguistics</i>. 2016;43(1):125-179. doi:<a href=\"https://doi.org/10.1162/coli_a_00276\">10.1162/coli_a_00276</a>","apa":"Habernal, I., &#38; Gurevych, I. (2016). Argumentation Mining in User-Generated Web Discourse. <i>Computational Linguistics</i>, <i>43</i>(1), 125–179. <a href=\"https://doi.org/10.1162/coli_a_00276\">https://doi.org/10.1162/coli_a_00276</a>","short":"I. Habernal, I. Gurevych, Computational Linguistics 43 (2016) 125–179.","bibtex":"@article{Habernal_Gurevych_2016, title={Argumentation Mining in User-Generated Web Discourse}, volume={43}, DOI={<a href=\"https://doi.org/10.1162/coli_a_00276\">10.1162/coli_a_00276</a>}, number={1}, journal={Computational Linguistics}, publisher={MIT Press}, author={Habernal, Ivan and Gurevych, Iryna}, year={2016}, pages={125–179} }","mla":"Habernal, Ivan, and Iryna Gurevych. “Argumentation Mining in User-Generated Web Discourse.” <i>Computational Linguistics</i>, vol. 43, no. 1, MIT Press, 2016, pp. 125–79, doi:<a href=\"https://doi.org/10.1162/coli_a_00276\">10.1162/coli_a_00276</a>."},"year":"2016","issue":"1","publication_identifier":{"issn":["0891-2017","1530-9312"]},"publication_status":"published"},{"publisher":"ACM","date_updated":"2023-10-19T12:07:25Z","author":[{"id":"101881","full_name":"Habernal, Ivan","last_name":"Habernal","first_name":"Ivan"},{"first_name":"Maria","full_name":"Sukhareva, Maria","last_name":"Sukhareva"},{"first_name":"Fiana","last_name":"Raiber","full_name":"Raiber, Fiana"},{"last_name":"Shtok","full_name":"Shtok, Anna","first_name":"Anna"},{"first_name":"Oren","last_name":"Kurland","full_name":"Kurland, Oren"},{"first_name":"Hadar","last_name":"Ronen","full_name":"Ronen, Hadar"},{"full_name":"Bar-Ilan, Judit","last_name":"Bar-Ilan","first_name":"Judit"},{"first_name":"Iryna","last_name":"Gurevych","full_name":"Gurevych, Iryna"}],"date_created":"2023-10-19T08:31:35Z","title":"New Collection Announcement","doi":"10.1145/2911451.2914682","publication_status":"published","year":"2016","citation":{"apa":"Habernal, I., Sukhareva, M., Raiber, F., Shtok, A., Kurland, O., Ronen, H., Bar-Ilan, J., &#38; Gurevych, I. (2016). New Collection Announcement. <i>Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval</i>. <a href=\"https://doi.org/10.1145/2911451.2914682\">https://doi.org/10.1145/2911451.2914682</a>","bibtex":"@inproceedings{Habernal_Sukhareva_Raiber_Shtok_Kurland_Ronen_Bar-Ilan_Gurevych_2016, title={New Collection Announcement}, DOI={<a href=\"https://doi.org/10.1145/2911451.2914682\">10.1145/2911451.2914682</a>}, booktitle={Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval}, publisher={ACM}, author={Habernal, Ivan and Sukhareva, Maria and Raiber, Fiana and Shtok, Anna and Kurland, Oren and Ronen, Hadar and Bar-Ilan, Judit and Gurevych, Iryna}, year={2016} }","short":"I. Habernal, M. Sukhareva, F. Raiber, A. Shtok, O. Kurland, H. Ronen, J. Bar-Ilan, I. Gurevych, in: Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval, ACM, 2016.","mla":"Habernal, Ivan, et al. “New Collection Announcement.” <i>Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval</i>, ACM, 2016, doi:<a href=\"https://doi.org/10.1145/2911451.2914682\">10.1145/2911451.2914682</a>.","chicago":"Habernal, Ivan, Maria Sukhareva, Fiana Raiber, Anna Shtok, Oren Kurland, Hadar Ronen, Judit Bar-Ilan, and Iryna Gurevych. “New Collection Announcement.” In <i>Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval</i>. ACM, 2016. <a href=\"https://doi.org/10.1145/2911451.2914682\">https://doi.org/10.1145/2911451.2914682</a>.","ieee":"I. Habernal <i>et al.</i>, “New Collection Announcement,” 2016, doi: <a href=\"https://doi.org/10.1145/2911451.2914682\">10.1145/2911451.2914682</a>.","ama":"Habernal I, Sukhareva M, Raiber F, et al. New Collection Announcement. In: <i>Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval</i>. ACM; 2016. doi:<a href=\"https://doi.org/10.1145/2911451.2914682\">10.1145/2911451.2914682</a>"},"_id":"48308","user_id":"15504","department":[{"_id":"34"},{"_id":"820"}],"alternative_title":["Focused Retrieval Over the Web"],"language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval","status":"public"},{"publication_status":"published","citation":{"short":"I. Habernal, I. Gurevych, in: Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), Association for Computational Linguistics, 2016.","mla":"Habernal, Ivan, and Iryna Gurevych. “Which Argument Is More Convincing? Analyzing and Predicting Convincingness of Web Arguments Using Bidirectional LSTM.” <i>Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</i>, Association for Computational Linguistics, 2016, doi:<a href=\"https://doi.org/10.18653/v1/p16-1150\">10.18653/v1/p16-1150</a>.","bibtex":"@inproceedings{Habernal_Gurevych_2016, title={Which argument is more convincing? Analyzing and predicting convincingness of Web arguments using bidirectional LSTM}, DOI={<a href=\"https://doi.org/10.18653/v1/p16-1150\">10.18653/v1/p16-1150</a>}, booktitle={Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)}, publisher={Association for Computational Linguistics}, author={Habernal, Ivan and Gurevych, Iryna}, year={2016} }","apa":"Habernal, I., &#38; Gurevych, I. (2016). Which argument is more convincing? Analyzing and predicting convincingness of Web arguments using bidirectional LSTM. <i>Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</i>. <a href=\"https://doi.org/10.18653/v1/p16-1150\">https://doi.org/10.18653/v1/p16-1150</a>","ama":"Habernal I, Gurevych I. Which argument is more convincing? Analyzing and predicting convincingness of Web arguments using bidirectional LSTM. In: <i>Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</i>. Association for Computational Linguistics; 2016. doi:<a href=\"https://doi.org/10.18653/v1/p16-1150\">10.18653/v1/p16-1150</a>","chicago":"Habernal, Ivan, and Iryna Gurevych. “Which Argument Is More Convincing? Analyzing and Predicting Convincingness of Web Arguments Using Bidirectional LSTM.” In <i>Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</i>. Association for Computational Linguistics, 2016. <a href=\"https://doi.org/10.18653/v1/p16-1150\">https://doi.org/10.18653/v1/p16-1150</a>.","ieee":"I. Habernal and I. Gurevych, “Which argument is more convincing? Analyzing and predicting convincingness of Web arguments using bidirectional LSTM,” 2016, doi: <a href=\"https://doi.org/10.18653/v1/p16-1150\">10.18653/v1/p16-1150</a>."},"year":"2016","author":[{"last_name":"Habernal","full_name":"Habernal, Ivan","id":"101881","first_name":"Ivan"},{"full_name":"Gurevych, Iryna","last_name":"Gurevych","first_name":"Iryna"}],"date_created":"2023-10-19T08:31:11Z","date_updated":"2023-10-19T12:07:44Z","publisher":"Association for Computational Linguistics","doi":"10.18653/v1/p16-1150","title":"Which argument is more convincing? Analyzing and predicting convincingness of Web arguments using bidirectional LSTM","publication":"Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","type":"conference","status":"public","department":[{"_id":"34"},{"_id":"820"}],"user_id":"15504","_id":"48307","language":[{"iso":"eng"}]},{"date_created":"2023-08-04T15:10:09Z","publisher":"Springer International Publishing","title":"MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework","year":"2016","language":[{"iso":"eng"}],"publication":"LION 2016: Learning and Intelligent Optimization","abstract":[{"text":"Automated algorithm configuration procedures play an increasingly important role in the development and application of algorithms for a wide range of computationally challenging problems. Until very recently, these configuration procedures were limited to optimising a single performance objective, such as the running time or solution quality achieved by the algorithm being configured. However, in many applications there is more than one performance objective of interest. This gives rise to the multi-objective automatic algorithm configuration problem, which involves finding a Pareto set of configurations of a given target algorithm that characterises trade-offs between multiple performance objectives. In this work, we introduce MO-ParamILS, a multi-objective extension of the state-of-the-art single-objective algorithm configuration framework ParamILS, and demonstrate that it produces good results on several challenging bi-objective algorithm configuration scenarios compared to a base-line obtained from using a state-of-the-art single-objective algorithm configurator.","lang":"eng"}],"author":[{"first_name":"A","full_name":"Blot, A","last_name":"Blot"},{"first_name":"H","last_name":"Hoos","full_name":"Hoos, H"},{"last_name":"Jourdan","full_name":"Jourdan, L","first_name":"L"},{"first_name":"M","last_name":"Marmion","full_name":"Marmion, M"},{"first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","id":"100740","full_name":"Trautmann, Heike"}],"volume":10079,"date_updated":"2023-10-16T13:37:50Z","doi":"10.1007/978-3-319-50349-3_3","citation":{"short":"A. Blot, H. Hoos, L. Jourdan, M. Marmion, H. Trautmann, in: V. et al. Joaquin (Ed.), LION 2016: Learning and Intelligent Optimization, Springer International Publishing, Cham, 2016, pp. 32–47.","bibtex":"@inproceedings{Blot_Hoos_Jourdan_Marmion_Trautmann_2016, place={Cham}, series={LNTCS}, title={MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework}, volume={10079}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-50349-3_3\">10.1007/978-3-319-50349-3_3</a>}, booktitle={LION 2016: Learning and Intelligent Optimization}, publisher={Springer International Publishing}, author={Blot, A and Hoos, H and Jourdan, L and Marmion, M and Trautmann, Heike}, editor={et al. Joaquin, Vanschooren}, year={2016}, pages={32–47}, collection={LNTCS} }","mla":"Blot, A., et al. “MO-ParamILS: A Multi-Objective Automatic Algorithm Configuration Framework.” <i>LION 2016: Learning and Intelligent Optimization</i>, edited by Vanschooren et al. Joaquin, vol. 10079, Springer International Publishing, 2016, pp. 32–47, doi:<a href=\"https://doi.org/10.1007/978-3-319-50349-3_3\">10.1007/978-3-319-50349-3_3</a>.","apa":"Blot, A., Hoos, H., Jourdan, L., Marmion, M., &#38; Trautmann, H. (2016). MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework. In V. et al. Joaquin (Ed.), <i>LION 2016: Learning and Intelligent Optimization</i> (Vol. 10079, pp. 32–47). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-50349-3_3\">https://doi.org/10.1007/978-3-319-50349-3_3</a>","ama":"Blot A, Hoos H, Jourdan L, Marmion M, Trautmann H. MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework. In: et al. Joaquin V, ed. <i>LION 2016: Learning and Intelligent Optimization</i>. Vol 10079. LNTCS. Springer International Publishing; 2016:32–47. doi:<a href=\"https://doi.org/10.1007/978-3-319-50349-3_3\">10.1007/978-3-319-50349-3_3</a>","ieee":"A. Blot, H. Hoos, L. Jourdan, M. Marmion, and H. Trautmann, “MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework,” in <i>LION 2016: Learning and Intelligent Optimization</i>, 2016, vol. 10079, pp. 32–47, doi: <a href=\"https://doi.org/10.1007/978-3-319-50349-3_3\">10.1007/978-3-319-50349-3_3</a>.","chicago":"Blot, A, H Hoos, L Jourdan, M Marmion, and Heike Trautmann. “MO-ParamILS: A Multi-Objective Automatic Algorithm Configuration Framework.” In <i>LION 2016: Learning and Intelligent Optimization</i>, edited by Vanschooren et al. Joaquin, 10079:32–47. LNTCS. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-50349-3_3\">https://doi.org/10.1007/978-3-319-50349-3_3</a>."},"intvolume":"     10079","page":"32–47","place":"Cham","series_title":"LNTCS","user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"_id":"46364","type":"conference","status":"public","editor":[{"full_name":"et al. Joaquin, Vanschooren","last_name":"et al. Joaquin","first_name":"Vanschooren"}]},{"language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"_id":"46363","status":"public","abstract":[{"lang":"eng","text":"The averaged Hausdorff distance has been proposed as an indicator for assessing the quality of finitely sized approximations of the Pareto front of a multiobjective problem. Since many set-based, iterative optimization algorithms store their currently best approximation in an internal archive these approximations are also termed archives. In case of two objectives and continuous variables it is known that the best approximations in terms of averaged Hausdorff distance are subsets of the Pareto front if it is concave. If it is linear or circularly concave the points of the best approximation are equally spaced.\r\n\r\nHere, it is proven that the optimal averaged Hausdorff approximation and the Pareto front have an empty intersection if the Pareto front is circularly convex. But the points of the best approximation are equally spaced and they rapidly approach the Pareto front for increasing size of the approximation."}],"editor":[{"last_name":"Squillero","full_name":"Squillero, G","first_name":"G"},{"first_name":"P","last_name":"Burelli","full_name":"Burelli, P"}],"type":"book_chapter","publication":"Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II","doi":"10.1007/978-3-319-31153-1_4","title":"On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front","author":[{"first_name":"G","full_name":"Rudolph, G","last_name":"Rudolph"},{"last_name":"Schütze","full_name":"Schütze, O","first_name":"O"},{"first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","id":"100740","full_name":"Trautmann, Heike"}],"date_created":"2023-08-04T15:09:14Z","publisher":"Springer International Publishing","date_updated":"2023-10-16T13:37:33Z","citation":{"ama":"Rudolph G, Schütze O, Trautmann H. On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front. In: Squillero G, Burelli P, eds. <i>Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II</i>. Springer International Publishing; 2016:42–55. doi:<a href=\"https://doi.org/10.1007/978-3-319-31153-1_4\">10.1007/978-3-319-31153-1_4</a>","chicago":"Rudolph, G, O Schütze, and Heike Trautmann. “On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front.” In <i>Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II</i>, edited by G Squillero and P Burelli, 42–55. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-31153-1_4\">https://doi.org/10.1007/978-3-319-31153-1_4</a>.","ieee":"G. Rudolph, O. Schütze, and H. Trautmann, “On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front,” in <i>Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II</i>, G. Squillero and P. Burelli, Eds. Cham: Springer International Publishing, 2016, pp. 42–55.","apa":"Rudolph, G., Schütze, O., &#38; Trautmann, H. (2016). On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front. In G. Squillero &#38; P. Burelli (Eds.), <i>Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II</i> (pp. 42–55). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-31153-1_4\">https://doi.org/10.1007/978-3-319-31153-1_4</a>","mla":"Rudolph, G., et al. “On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front.” <i>Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II</i>, edited by G Squillero and P Burelli, Springer International Publishing, 2016, pp. 42–55, doi:<a href=\"https://doi.org/10.1007/978-3-319-31153-1_4\">10.1007/978-3-319-31153-1_4</a>.","bibtex":"@inbook{Rudolph_Schütze_Trautmann_2016, place={Cham}, title={On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-31153-1_4\">10.1007/978-3-319-31153-1_4</a>}, booktitle={Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II}, publisher={Springer International Publishing}, author={Rudolph, G and Schütze, O and Trautmann, Heike}, editor={Squillero, G and Burelli, P}, year={2016}, pages={42–55} }","short":"G. Rudolph, O. Schütze, H. Trautmann, in: G. Squillero, P. Burelli (Eds.), Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II, Springer International Publishing, Cham, 2016, pp. 42–55."},"page":"42–55","place":"Cham","year":"2016","publication_identifier":{"isbn":["978-3-319-31153-1"]}},{"year":"2016","place":"Edinburgh, Scotland","page":"962–972","citation":{"ama":"Kerschke P, Wang H, Preuss M, et al. Towards Analyzing Multimodality of Multiobjective Landscapes. In: <i>Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV)</i>. Lecture Notes in Computer Science. Springer; 2016:962–972. doi:<a href=\"https://doi.org/10.1007/978-3-319-45823-6_90\">10.1007/978-3-319-45823-6_90</a>","chicago":"Kerschke, Pascal, Hao Wang, Mike Preuss, Christian Grimme, André Deutz, Heike Trautmann, and Michael Emmerich. “Towards Analyzing Multimodality of Multiobjective Landscapes.” In <i>Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV)</i>, 962–972. Lecture Notes in Computer Science. Edinburgh, Scotland: Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-45823-6_90\">https://doi.org/10.1007/978-3-319-45823-6_90</a>.","ieee":"P. Kerschke <i>et al.</i>, “Towards Analyzing Multimodality of Multiobjective Landscapes,” in <i>Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV)</i>, 2016, pp. 962–972, doi: <a href=\"https://doi.org/10.1007/978-3-319-45823-6_90\">10.1007/978-3-319-45823-6_90</a>.","apa":"Kerschke, P., Wang, H., Preuss, M., Grimme, C., Deutz, A., Trautmann, H., &#38; Emmerich, M. (2016). Towards Analyzing Multimodality of Multiobjective Landscapes. <i>Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV)</i>, 962–972. <a href=\"https://doi.org/10.1007/978-3-319-45823-6_90\">https://doi.org/10.1007/978-3-319-45823-6_90</a>","bibtex":"@inproceedings{Kerschke_Wang_Preuss_Grimme_Deutz_Trautmann_Emmerich_2016, place={Edinburgh, Scotland}, series={Lecture Notes in Computer Science}, title={Towards Analyzing Multimodality of Multiobjective Landscapes}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-45823-6_90\">10.1007/978-3-319-45823-6_90</a>}, booktitle={Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV)}, publisher={Springer}, author={Kerschke, Pascal and Wang, Hao and Preuss, Mike and Grimme, Christian and Deutz, André and Trautmann, Heike and Emmerich, Michael}, year={2016}, pages={962–972}, collection={Lecture Notes in Computer Science} }","mla":"Kerschke, Pascal, et al. “Towards Analyzing Multimodality of Multiobjective Landscapes.” <i>Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV)</i>, Springer, 2016, pp. 962–972, doi:<a href=\"https://doi.org/10.1007/978-3-319-45823-6_90\">10.1007/978-3-319-45823-6_90</a>.","short":"P. Kerschke, H. Wang, M. Preuss, C. Grimme, A. Deutz, H. Trautmann, M. Emmerich, in: Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV), Springer, Edinburgh, Scotland, 2016, pp. 962–972."},"date_updated":"2023-10-16T13:39:42Z","publisher":"Springer","author":[{"last_name":"Kerschke","full_name":"Kerschke, Pascal","first_name":"Pascal"},{"first_name":"Hao","last_name":"Wang","full_name":"Wang, Hao"},{"full_name":"Preuss, Mike","last_name":"Preuss","first_name":"Mike"},{"first_name":"Christian","last_name":"Grimme","full_name":"Grimme, Christian"},{"first_name":"André","full_name":"Deutz, André","last_name":"Deutz"},{"first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","full_name":"Trautmann, Heike","id":"100740"},{"full_name":"Emmerich, Michael","last_name":"Emmerich","first_name":"Michael"}],"date_created":"2023-08-04T15:16:02Z","title":"Towards Analyzing Multimodality of Multiobjective Landscapes","doi":"10.1007/978-3-319-45823-6_90","publication":"Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV)","type":"conference","abstract":[{"lang":"eng","text":"This paper formally defines multimodality in multiobjective optimization (MO). We introduce a test-bed in which multimodal MO problems with known properties can be constructed as well as numerical characteristics of the resulting landscape. Gradient- and local search based strategies are compared on exemplary problems together with specific performance indicators in the multimodal MO setting. By this means the foundation for Exploratory Landscape Analysis in MO is provided."}],"status":"public","_id":"46369","department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}]},{"user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"_id":"46367","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation","status":"public","abstract":[{"text":"When selecting the best suited algorithm for an unknown optimization problem, it is useful to possess some a priori knowledge of the problem at hand. In the context of single-objective, continuous optimization problems such knowledge can be retrieved by means of Exploratory Landscape Analysis (ELA), which automatically identifies properties of a landscape, e.g., the so-called funnel structures, based on an initial sample. In this paper, we extract the relevant features (for detecting funnels) out of a large set of landscape features when only given a small initial sample consisting of 50 x D observations, where D is the number of decision space dimensions. This is already in the range of the start population sizes of many evolutionary algorithms. The new Multiple Peaks Model Generator (MPM2) is used for training the classifier, and the approach is then very successfully validated on the Black-Box Optimization Benchmark (BBOB) and a subset of the CEC 2013 niching competition problems.","lang":"eng"}],"author":[{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"},{"last_name":"Preuss","full_name":"Preuss, Mike","first_name":"Mike"},{"last_name":"Wessing","full_name":"Wessing, Simon","first_name":"Simon"},{"first_name":"Heike","full_name":"Trautmann, Heike","id":"100740","orcid":"0000-0002-9788-8282","last_name":"Trautmann"}],"date_created":"2023-08-04T15:14:06Z","date_updated":"2023-10-16T13:38:47Z","doi":"10.1145/2908812.2908845","title":"Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models","publication_identifier":{"isbn":["978-1-4503-4206-3"]},"citation":{"apa":"Kerschke, P., Preuss, M., Wessing, S., &#38; Trautmann, H. (2016). Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models. <i>Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation</i>, 229–236. <a href=\"https://doi.org/10.1145/2908812.2908845\">https://doi.org/10.1145/2908812.2908845</a>","mla":"Kerschke, Pascal, et al. “Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models.” <i>Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation</i>, 2016, pp. 229–236, doi:<a href=\"https://doi.org/10.1145/2908812.2908845\">10.1145/2908812.2908845</a>.","bibtex":"@inproceedings{Kerschke_Preuss_Wessing_Trautmann_2016, place={Denver, CO, USA}, title={Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models}, DOI={<a href=\"https://doi.org/10.1145/2908812.2908845\">10.1145/2908812.2908845</a>}, booktitle={Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation}, author={Kerschke, Pascal and Preuss, Mike and Wessing, Simon and Trautmann, Heike}, year={2016}, pages={229–236} }","short":"P. Kerschke, M. Preuss, S. Wessing, H. Trautmann, in: Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation, Denver, CO, USA, 2016, pp. 229–236.","ama":"Kerschke P, Preuss M, Wessing S, Trautmann H. Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models. In: <i>Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation</i>. ; 2016:229–236. doi:<a href=\"https://doi.org/10.1145/2908812.2908845\">10.1145/2908812.2908845</a>","chicago":"Kerschke, Pascal, Mike Preuss, Simon Wessing, and Heike Trautmann. “Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models.” In <i>Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation</i>, 229–236. Denver, CO, USA, 2016. <a href=\"https://doi.org/10.1145/2908812.2908845\">https://doi.org/10.1145/2908812.2908845</a>.","ieee":"P. Kerschke, M. Preuss, S. Wessing, and H. Trautmann, “Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models,” in <i>Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation</i>, 2016, pp. 229–236, doi: <a href=\"https://doi.org/10.1145/2908812.2908845\">10.1145/2908812.2908845</a>."},"page":"229–236","place":"Denver, CO, USA","year":"2016"},{"issue":"2","year":"2016","citation":{"chicago":"Rudolph, G, O Schütze, C Grimme, C Domínguez-Medina, and Heike Trautmann. “Optimal Averaged Hausdorff Archives for Bi-Objective Problems: Theoretical and Numerical Results.” <i>Computational Optimization and Applications (Comput. Optim. Appl.)</i> 64, no. 2 (2016): 589–618. <a href=\"https://doi.org/10.1007/s10589-015-9815-8\">https://doi.org/10.1007/s10589-015-9815-8</a>.","ieee":"G. Rudolph, O. Schütze, C. Grimme, C. Domínguez-Medina, and H. Trautmann, “Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results,” <i>Computational Optimization and Applications (Comput. Optim. Appl.)</i>, vol. 64, no. 2, pp. 589–618, 2016, doi: <a href=\"https://doi.org/10.1007/s10589-015-9815-8\">10.1007/s10589-015-9815-8</a>.","bibtex":"@article{Rudolph_Schütze_Grimme_Domínguez-Medina_Trautmann_2016, title={Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results}, volume={64}, DOI={<a href=\"https://doi.org/10.1007/s10589-015-9815-8\">10.1007/s10589-015-9815-8</a>}, number={2}, journal={Computational Optimization and Applications (Comput. Optim. Appl.)}, author={Rudolph, G and Schütze, O and Grimme, C and Domínguez-Medina, C and Trautmann, Heike}, year={2016}, pages={589–618} }","mla":"Rudolph, G., et al. “Optimal Averaged Hausdorff Archives for Bi-Objective Problems: Theoretical and Numerical Results.” <i>Computational Optimization and Applications (Comput. Optim. Appl.)</i>, vol. 64, no. 2, 2016, pp. 589–618, doi:<a href=\"https://doi.org/10.1007/s10589-015-9815-8\">10.1007/s10589-015-9815-8</a>.","short":"G. Rudolph, O. Schütze, C. Grimme, C. Domínguez-Medina, H. Trautmann, Computational Optimization and Applications (Comput. Optim. Appl.) 64 (2016) 589–618.","apa":"Rudolph, G., Schütze, O., Grimme, C., Domínguez-Medina, C., &#38; Trautmann, H. (2016). Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results. <i>Computational Optimization and Applications (Comput. Optim. Appl.)</i>, <i>64</i>(2), 589–618. <a href=\"https://doi.org/10.1007/s10589-015-9815-8\">https://doi.org/10.1007/s10589-015-9815-8</a>","ama":"Rudolph G, Schütze O, Grimme C, Domínguez-Medina C, Trautmann H. Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results. <i>Computational Optimization and Applications (Comput Optim Appl)</i>. 2016;64(2):589–618. doi:<a href=\"https://doi.org/10.1007/s10589-015-9815-8\">10.1007/s10589-015-9815-8</a>"},"intvolume":"        64","page":"589–618","date_updated":"2023-10-16T13:40:21Z","author":[{"first_name":"G","last_name":"Rudolph","full_name":"Rudolph, G"},{"full_name":"Schütze, O","last_name":"Schütze","first_name":"O"},{"full_name":"Grimme, C","last_name":"Grimme","first_name":"C"},{"first_name":"C","full_name":"Domínguez-Medina, C","last_name":"Domínguez-Medina"},{"last_name":"Trautmann","orcid":"0000-0002-9788-8282","id":"100740","full_name":"Trautmann, Heike","first_name":"Heike"}],"date_created":"2023-08-04T15:17:48Z","volume":64,"title":"Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results","doi":"10.1007/s10589-015-9815-8","type":"journal_article","publication":"Computational Optimization and Applications (Comput. Optim. Appl.)","abstract":[{"text":"One main task in evolutionary multiobjective optimization (EMO) is to obtain a suitable finite size approximation of the Pareto front which is the image of the solution set, termed the Pareto set, of a given multiobjective optimization problem. In the technical literature, the characteristic of the desired approximation is commonly expressed by closeness to the Pareto front and a sufficient spread of the solutions obtained. In this paper, we first make an effort to show by theoretical and empirical findings that the recently proposed Averaged Hausdorff (or Δ𝑝-) indicator indeed aims at fulfilling both performance criteria for bi-objective optimization problems. In the second part of this paper, standard EMO algorithms combined with a specialized archiver and a postprocessing step based on the Δ𝑝 indicator are introduced which sufficiently approximate the Δ𝑝-optimal archives and generate solutions evenly spread along the Pareto front.","lang":"eng"}],"status":"public","_id":"46371","user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"language":[{"iso":"eng"}]},{"type":"journal_article","publication":"Journal of Heuristics","abstract":[{"lang":"eng","text":"We present a new hybrid evolutionary algorithm for the effective hypervolume approximation of the Pareto front of a given differentiable multi-objective optimization problem. Starting point for the local search (LS) mechanism is a new division of the decision space as we will argue that in each of these regions a different LS strategy seems to be most promising. For the LS in two out of the three regions we will utilize and adapt the Directed Search method which is capable of steering the search into any direction given in objective space and which is thus well suited for the problem at hand. We further on integrate the resulting LS mechanism into SMS-EMOA, a state-of-the-art evolutionary algorithm for hypervolume approximations. Finally, we will present some numerical results on several benchmark problems with two and three objectives indicating the strength and competitiveness of the novel hybrid."}],"status":"public","_id":"46372","user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"language":[{"iso":"eng"}],"issue":"3","year":"2016","citation":{"apa":"Schütze, O., Sosa, H. V., Trautmann, H., &#38; Rudolph, G. (2016). The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems. <i>Journal of Heuristics</i>, <i>22</i>(3), 273–300. <a href=\"https://doi.org/10.1007/s10732-016-9310-0\">https://doi.org/10.1007/s10732-016-9310-0</a>","mla":"Schütze, O., et al. “The Hypervolume Based Directed Search Method for Multi-Objective Optimization Problems.” <i>Journal of Heuristics</i>, vol. 22, no. 3, 2016, pp. 273–300, doi:<a href=\"https://doi.org/10.1007/s10732-016-9310-0\">10.1007/s10732-016-9310-0</a>.","bibtex":"@article{Schütze_Sosa_Trautmann_Rudolph_2016, title={The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems}, volume={22}, DOI={<a href=\"https://doi.org/10.1007/s10732-016-9310-0\">10.1007/s10732-016-9310-0</a>}, number={3}, journal={Journal of Heuristics}, author={Schütze, O and Sosa, Hernandez VA and Trautmann, Heike and Rudolph, G}, year={2016}, pages={273–300} }","short":"O. Schütze, H.V. Sosa, H. Trautmann, G. Rudolph, Journal of Heuristics 22 (2016) 273–300.","chicago":"Schütze, O, Hernandez VA Sosa, Heike Trautmann, and G Rudolph. “The Hypervolume Based Directed Search Method for Multi-Objective Optimization Problems.” <i>Journal of Heuristics</i> 22, no. 3 (2016): 273–300. <a href=\"https://doi.org/10.1007/s10732-016-9310-0\">https://doi.org/10.1007/s10732-016-9310-0</a>.","ieee":"O. Schütze, H. V. Sosa, H. Trautmann, and G. Rudolph, “The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems,” <i>Journal of Heuristics</i>, vol. 22, no. 3, pp. 273–300, 2016, doi: <a href=\"https://doi.org/10.1007/s10732-016-9310-0\">10.1007/s10732-016-9310-0</a>.","ama":"Schütze O, Sosa HV, Trautmann H, Rudolph G. The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems. <i>Journal of Heuristics</i>. 2016;22(3):273–300. doi:<a href=\"https://doi.org/10.1007/s10732-016-9310-0\">10.1007/s10732-016-9310-0</a>"},"page":"273–300","intvolume":"        22","date_updated":"2023-10-16T13:40:43Z","author":[{"full_name":"Schütze, O","last_name":"Schütze","first_name":"O"},{"full_name":"Sosa, Hernandez VA","last_name":"Sosa","first_name":"Hernandez VA"},{"first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","full_name":"Trautmann, Heike","id":"100740"},{"full_name":"Rudolph, G","last_name":"Rudolph","first_name":"G"}],"date_created":"2023-08-04T15:19:11Z","volume":22,"title":"The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems","doi":"10.1007/s10732-016-9310-0"},{"department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","_id":"46368","language":[{"iso":"eng"}],"publication":"Proceedings of the IEEE Congress on Evolutionary Computation (CEC)","type":"conference","status":"public","abstract":[{"lang":"eng","text":"Exploratory Landscape Analysis (ELA) aims at understanding characteristics of single-objective continuous (black-box) optimization problems in an automated way. Moreover, the approach provides the basis for constructing algorithm selection models for unseen problem instances. Recently, it has gained increasing attention and numerical features have been designed by various research groups. This paper introduces the R-Package FLACCO which makes all relevant features available in a unified framework together with efficient helper functions. Moreover, a case study which gives perspectives to ELA for multi-objective optimization problems is presented."}],"author":[{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"},{"first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","id":"100740","full_name":"Trautmann, Heike"}],"date_created":"2023-08-04T15:14:52Z","date_updated":"2023-10-16T13:39:06Z","doi":"10.1109/CEC.2016.7748359","title":"The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems","citation":{"ieee":"P. Kerschke and H. Trautmann, “The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems,” 2016, doi: <a href=\"https://doi.org/10.1109/CEC.2016.7748359\">10.1109/CEC.2016.7748359</a>.","chicago":"Kerschke, Pascal, and Heike Trautmann. “The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems.” In <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>. Vancouver, BC, Kanada, 2016. <a href=\"https://doi.org/10.1109/CEC.2016.7748359\">https://doi.org/10.1109/CEC.2016.7748359</a>.","ama":"Kerschke P, Trautmann H. The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems. In: <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>. ; 2016. doi:<a href=\"https://doi.org/10.1109/CEC.2016.7748359\">10.1109/CEC.2016.7748359</a>","mla":"Kerschke, Pascal, and Heike Trautmann. “The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems.” <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>, 2016, doi:<a href=\"https://doi.org/10.1109/CEC.2016.7748359\">10.1109/CEC.2016.7748359</a>.","bibtex":"@inproceedings{Kerschke_Trautmann_2016, place={Vancouver, BC, Kanada}, title={The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems}, DOI={<a href=\"https://doi.org/10.1109/CEC.2016.7748359\">10.1109/CEC.2016.7748359</a>}, booktitle={Proceedings of the IEEE Congress on Evolutionary Computation (CEC)}, author={Kerschke, Pascal and Trautmann, Heike}, year={2016} }","short":"P. Kerschke, H. Trautmann, in: Proceedings of the IEEE Congress on Evolutionary Computation (CEC), Vancouver, BC, Kanada, 2016.","apa":"Kerschke, P., &#38; Trautmann, H. (2016). The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems. <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>. <a href=\"https://doi.org/10.1109/CEC.2016.7748359\">https://doi.org/10.1109/CEC.2016.7748359</a>"},"year":"2016","place":"Vancouver, BC, Kanada"},{"publication":"Dagstuhl Reports","type":"journal_article","abstract":[{"lang":"eng","text":"This report documents the talks and discussions at the Dagstuhl Seminar 15211 \"Theory of Evolutionary Algorithms\". This seminar, now in its 8th edition, is the main meeting point of the highly active theory of randomized search heuristics subcommunities in Australia, Asia, North America, and Europe. Topics intensively discussed include rigorous runtime analysis and computational complexity theory for randomised search heuristics, information geometry of randomised search, and synergies between the theory of evolutionary algorithms and theories of natural evolution."}],"status":"public","_id":"46370","department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","language":[{"iso":"eng"}],"issue":"5","year":"2016","intvolume":"         5","page":"78–79","citation":{"bibtex":"@article{Neumann_Trautmann_2016, title={Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211)}, volume={5}, DOI={<a href=\"https://doi.org/10.4230/DagRep.5.5.57\">10.4230/DagRep.5.5.57</a>}, number={5}, journal={Dagstuhl Reports}, author={Neumann, F and Trautmann, Heike}, year={2016}, pages={78–79} }","mla":"Neumann, F., and Heike Trautmann. “Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211).” <i>Dagstuhl Reports</i>, vol. 5, no. 5, 2016, pp. 78–79, doi:<a href=\"https://doi.org/10.4230/DagRep.5.5.57\">10.4230/DagRep.5.5.57</a>.","short":"F. Neumann, H. Trautmann, Dagstuhl Reports 5 (2016) 78–79.","apa":"Neumann, F., &#38; Trautmann, H. (2016). Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211). <i>Dagstuhl Reports</i>, <i>5</i>(5), 78–79. <a href=\"https://doi.org/10.4230/DagRep.5.5.57\">https://doi.org/10.4230/DagRep.5.5.57</a>","ama":"Neumann F, Trautmann H. Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211). <i>Dagstuhl Reports</i>. 2016;5(5):78–79. doi:<a href=\"https://doi.org/10.4230/DagRep.5.5.57\">10.4230/DagRep.5.5.57</a>","ieee":"F. Neumann and H. Trautmann, “Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211),” <i>Dagstuhl Reports</i>, vol. 5, no. 5, pp. 78–79, 2016, doi: <a href=\"https://doi.org/10.4230/DagRep.5.5.57\">10.4230/DagRep.5.5.57</a>.","chicago":"Neumann, F, and Heike Trautmann. “Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211).” <i>Dagstuhl Reports</i> 5, no. 5 (2016): 78–79. <a href=\"https://doi.org/10.4230/DagRep.5.5.57\">https://doi.org/10.4230/DagRep.5.5.57</a>."},"date_updated":"2023-10-16T13:40:00Z","volume":5,"author":[{"full_name":"Neumann, F","last_name":"Neumann","first_name":"F"},{"first_name":"Heike","id":"100740","full_name":"Trautmann, Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282"}],"date_created":"2023-08-04T15:17:00Z","title":"Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211)","doi":"10.4230/DagRep.5.5.57"},{"status":"public","type":"conference","publication":"Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing","language":[{"iso":"eng"}],"_id":"48309","user_id":"15504","department":[{"_id":"34"},{"_id":"820"}],"year":"2016","citation":{"ieee":"I. Habernal and I. Gurevych, “What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation,” 2016, doi: <a href=\"https://doi.org/10.18653/v1/d16-1129\">10.18653/v1/d16-1129</a>.","chicago":"Habernal, Ivan, and Iryna Gurevych. “What Makes a Convincing Argument? Empirical Analysis and Detecting            Attributes of Convincingness in Web Argumentation.” In <i>Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing</i>. Association for Computational Linguistics, 2016. <a href=\"https://doi.org/10.18653/v1/d16-1129\">https://doi.org/10.18653/v1/d16-1129</a>.","ama":"Habernal I, Gurevych I. What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation. In: <i>Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing</i>. Association for Computational Linguistics; 2016. doi:<a href=\"https://doi.org/10.18653/v1/d16-1129\">10.18653/v1/d16-1129</a>","apa":"Habernal, I., &#38; Gurevych, I. (2016). What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation. <i>Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing</i>. <a href=\"https://doi.org/10.18653/v1/d16-1129\">https://doi.org/10.18653/v1/d16-1129</a>","bibtex":"@inproceedings{Habernal_Gurevych_2016, title={What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation}, DOI={<a href=\"https://doi.org/10.18653/v1/d16-1129\">10.18653/v1/d16-1129</a>}, booktitle={Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing}, publisher={Association for Computational Linguistics}, author={Habernal, Ivan and Gurevych, Iryna}, year={2016} }","mla":"Habernal, Ivan, and Iryna Gurevych. “What Makes a Convincing Argument? Empirical Analysis and Detecting            Attributes of Convincingness in Web Argumentation.” <i>Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing</i>, Association for Computational Linguistics, 2016, doi:<a href=\"https://doi.org/10.18653/v1/d16-1129\">10.18653/v1/d16-1129</a>.","short":"I. Habernal, I. Gurevych, in: Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing, Association for Computational Linguistics, 2016."},"publication_status":"published","title":"What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation","doi":"10.18653/v1/d16-1129","publisher":"Association for Computational Linguistics","date_updated":"2023-10-19T12:07:05Z","date_created":"2023-10-19T08:31:58Z","author":[{"id":"101881","full_name":"Habernal, Ivan","last_name":"Habernal","first_name":"Ivan"},{"last_name":"Gurevych","full_name":"Gurevych, Iryna","first_name":"Iryna"}]},{"doi":"10.1007/978-3-319-50349-3_4","author":[{"orcid":"0000-0002-4121-4668","last_name":"Bossek","full_name":"Bossek, Jakob","id":"102979","first_name":"Jakob"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike"}],"date_updated":"2023-12-13T10:47:05Z","page":"48–59","citation":{"apa":"Bossek, J., &#38; Trautmann, H. (2016). Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers. In P. Festa, M. Sellmann, &#38; J. Vanschoren (Eds.), <i>Learning and Intelligent Optimization</i> (pp. 48–59). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">https://doi.org/10.1007/978-3-319-50349-3_4</a>","short":"J. Bossek, H. Trautmann, in: P. Festa, M. Sellmann, J. Vanschoren (Eds.), Learning and Intelligent Optimization, Springer International Publishing, Cham, 2016, pp. 48–59.","mla":"Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers.” <i>Learning and Intelligent Optimization</i>, edited by Paola Festa et al., Springer International Publishing, 2016, pp. 48–59, doi:<a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>.","bibtex":"@inproceedings{Bossek_Trautmann_2016, place={Cham}, series={Lecture Notes in Computer Science}, title={Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>}, booktitle={Learning and Intelligent Optimization}, publisher={Springer International Publishing}, author={Bossek, Jakob and Trautmann, Heike}, editor={Festa, Paola and Sellmann, Meinolf and Vanschoren, Joaquin}, year={2016}, pages={48–59}, collection={Lecture Notes in Computer Science} }","ieee":"J. Bossek and H. Trautmann, “Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers,” in <i>Learning and Intelligent Optimization</i>, 2016, pp. 48–59, doi: <a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>.","chicago":"Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers.” In <i>Learning and Intelligent Optimization</i>, edited by Paola Festa, Meinolf Sellmann, and Joaquin Vanschoren, 48–59. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">https://doi.org/10.1007/978-3-319-50349-3_4</a>.","ama":"Bossek J, Trautmann H. Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers. In: Festa P, Sellmann M, Vanschoren J, eds. <i>Learning and Intelligent Optimization</i>. Lecture Notes in Computer Science. Springer International Publishing; 2016:48–59. doi:<a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>"},"place":"Cham","publication_identifier":{"isbn":["978-3-319-50349-3"]},"publication_status":"published","extern":"1","department":[{"_id":"819"}],"user_id":"102979","series_title":"Lecture Notes in Computer Science","_id":"48873","status":"public","editor":[{"first_name":"Paola","full_name":"Festa, Paola","last_name":"Festa"},{"first_name":"Meinolf","full_name":"Sellmann, Meinolf","last_name":"Sellmann"},{"first_name":"Joaquin","last_name":"Vanschoren","full_name":"Vanschoren, Joaquin"}],"type":"conference","title":"Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers","date_created":"2023-11-14T15:58:57Z","publisher":"Springer International Publishing","year":"2016","language":[{"iso":"eng"}],"keyword":["Algorithm selection","Feature selection","Instance hardness","TSP"],"abstract":[{"text":"Despite the intrinsic hardness of the Traveling Salesperson Problem (TSP) heuristic solvers, e.g., LKH+restart and EAX+restart, are remarkably successful in generating satisfactory or even optimal solutions. However, the reasons for their success are not yet fully understood. Recent approaches take an analytical viewpoint and try to identify instance features, which make an instance hard or easy to solve. We contribute to this area by generating instance sets for couples of TSP algorithms A and B by maximizing/minimizing their performance difference in order to generate instances which are easier to solve for one solver and much harder to solve for the other. This instance set offers the potential to identify key features which allow to distinguish between the problem hardness classes of both algorithms.","lang":"eng"}],"publication":"Learning and Intelligent Optimization"},{"citation":{"mla":"Borgwardt, Stefan, et al. “Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies.” <i>Journal on Data Semantics</i>, vol. 5, no. 2, Springer Science and Business Media LLC, 2016, pp. 55–75, doi:<a href=\"https://doi.org/10.1007/s13740-015-0055-y\">10.1007/s13740-015-0055-y</a>.","short":"S. Borgwardt, T. Mailis, R. Peñaloza, A.-Y. Turhan, Journal on Data Semantics 5 (2016) 55–75.","bibtex":"@article{Borgwardt_Mailis_Peñaloza_Turhan_2016, title={Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies}, volume={5}, DOI={<a href=\"https://doi.org/10.1007/s13740-015-0055-y\">10.1007/s13740-015-0055-y</a>}, number={2}, journal={Journal on Data Semantics}, publisher={Springer Science and Business Media LLC}, author={Borgwardt, Stefan and Mailis, Theofilos and Peñaloza, Rafael and Turhan, Anni-Yasmin}, year={2016}, pages={55–75} }","apa":"Borgwardt, S., Mailis, T., Peñaloza, R., &#38; Turhan, A.-Y. (2016). Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies. <i>Journal on Data Semantics</i>, <i>5</i>(2), 55–75. <a href=\"https://doi.org/10.1007/s13740-015-0055-y\">https://doi.org/10.1007/s13740-015-0055-y</a>","chicago":"Borgwardt, Stefan, Theofilos Mailis, Rafael Peñaloza, and Anni-Yasmin Turhan. “Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies.” <i>Journal on Data Semantics</i> 5, no. 2 (2016): 55–75. <a href=\"https://doi.org/10.1007/s13740-015-0055-y\">https://doi.org/10.1007/s13740-015-0055-y</a>.","ieee":"S. Borgwardt, T. Mailis, R. Peñaloza, and A.-Y. Turhan, “Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies,” <i>Journal on Data Semantics</i>, vol. 5, no. 2, pp. 55–75, 2016, doi: <a href=\"https://doi.org/10.1007/s13740-015-0055-y\">10.1007/s13740-015-0055-y</a>.","ama":"Borgwardt S, Mailis T, Peñaloza R, Turhan A-Y. Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies. <i>Journal on Data Semantics</i>. 2016;5(2):55-75. doi:<a href=\"https://doi.org/10.1007/s13740-015-0055-y\">10.1007/s13740-015-0055-y</a>"},"page":"55-75","intvolume":"         5","year":"2016","issue":"2","publication_status":"published","publication_identifier":{"issn":["1861-2032","1861-2040"]},"doi":"10.1007/s13740-015-0055-y","title":"Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies","author":[{"first_name":"Stefan","last_name":"Borgwardt","full_name":"Borgwardt, Stefan"},{"last_name":"Mailis","full_name":"Mailis, Theofilos","first_name":"Theofilos"},{"first_name":"Rafael","last_name":"Peñaloza","full_name":"Peñaloza, Rafael"},{"id":"104470","full_name":"Turhan, Anni-Yasmin","last_name":"Turhan","first_name":"Anni-Yasmin"}],"date_created":"2024-03-25T09:23:39Z","volume":5,"date_updated":"2024-03-25T13:50:33Z","publisher":"Springer Science and Business Media LLC","status":"public","type":"journal_article","publication":"Journal on Data Semantics","language":[{"iso":"eng"}],"keyword":["Artificial Intelligence","Computer Networks and Communications","Information Systems"],"user_id":"9503","department":[{"_id":"888"}],"_id":"52803"},{"type":"conference","publication":"2016 IEEE Symposium on Security and Privacy (SP)","status":"public","user_id":"14931","department":[{"_id":"34"},{"_id":"858"}],"_id":"47240","language":[{"iso":"eng"}],"extern":"1","publication_status":"published","citation":{"ama":"Acar Y, Backes M, Bugiel S, Fahl S, McDaniel P, Smith M. SoK: Lessons Learned from Android Security Research for Appified Software Platforms. In: <i>2016 IEEE Symposium on Security and Privacy (SP)</i>. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/sp.2016.33\">10.1109/sp.2016.33</a>","chicago":"Acar, Yasemin, Michael Backes, Sven Bugiel, Sascha Fahl, Patrick McDaniel, and Matthew Smith. “SoK: Lessons Learned from Android Security Research for Appified Software Platforms.” In <i>2016 IEEE Symposium on Security and Privacy (SP)</i>. IEEE, 2016. <a href=\"https://doi.org/10.1109/sp.2016.33\">https://doi.org/10.1109/sp.2016.33</a>.","ieee":"Y. Acar, M. Backes, S. Bugiel, S. Fahl, P. McDaniel, and M. Smith, “SoK: Lessons Learned from Android Security Research for Appified Software Platforms,” 2016, doi: <a href=\"https://doi.org/10.1109/sp.2016.33\">10.1109/sp.2016.33</a>.","apa":"Acar, Y., Backes, M., Bugiel, S., Fahl, S., McDaniel, P., &#38; Smith, M. (2016). SoK: Lessons Learned from Android Security Research for Appified Software Platforms. <i>2016 IEEE Symposium on Security and Privacy (SP)</i>. <a href=\"https://doi.org/10.1109/sp.2016.33\">https://doi.org/10.1109/sp.2016.33</a>","mla":"Acar, Yasemin, et al. “SoK: Lessons Learned from Android Security Research for Appified Software Platforms.” <i>2016 IEEE Symposium on Security and Privacy (SP)</i>, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/sp.2016.33\">10.1109/sp.2016.33</a>.","short":"Y. Acar, M. Backes, S. Bugiel, S. Fahl, P. McDaniel, M. Smith, in: 2016 IEEE Symposium on Security and Privacy (SP), IEEE, 2016.","bibtex":"@inproceedings{Acar_Backes_Bugiel_Fahl_McDaniel_Smith_2016, title={SoK: Lessons Learned from Android Security Research for Appified Software Platforms}, DOI={<a href=\"https://doi.org/10.1109/sp.2016.33\">10.1109/sp.2016.33</a>}, booktitle={2016 IEEE Symposium on Security and Privacy (SP)}, publisher={IEEE}, author={Acar, Yasemin and Backes, Michael and Bugiel, Sven and Fahl, Sascha and McDaniel, Patrick and Smith, Matthew}, year={2016} }"},"year":"2016","date_created":"2023-09-22T12:41:43Z","author":[{"first_name":"Yasemin","id":"94636","full_name":"Acar, Yasemin","last_name":"Acar"},{"last_name":"Backes","full_name":"Backes, Michael","first_name":"Michael"},{"last_name":"Bugiel","full_name":"Bugiel, Sven","first_name":"Sven"},{"last_name":"Fahl","full_name":"Fahl, Sascha","first_name":"Sascha"},{"full_name":"McDaniel, Patrick","last_name":"McDaniel","first_name":"Patrick"},{"last_name":"Smith","full_name":"Smith, Matthew","first_name":"Matthew"}],"publisher":"IEEE","date_updated":"2024-06-05T13:14:55Z","doi":"10.1109/sp.2016.33","title":"SoK: Lessons Learned from Android Security Research for Appified Software Platforms"},{"year":"2016","page":"193–208","citation":{"apa":"Dechand, S., Schürmann, D., Busse, K., Acar, Y., Fahl, S., &#38; Smith, M. (2016). An Empirical Study of Textual Key-Fingerprint Representations. In T. Holz &#38; S. Savage (Eds.), <i>25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016</i> (pp. 193–208). USENIX Association.","bibtex":"@inproceedings{Dechand_Schürmann_Busse_Acar_Fahl_Smith_2016, title={An Empirical Study of Textual Key-Fingerprint Representations}, booktitle={25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016}, publisher={USENIX Association}, author={Dechand, Sergej and Schürmann, Dominik and Busse, Karoline and Acar, Yasemin and Fahl, Sascha and Smith, Matthew}, editor={Holz, Thorsten and Savage, Stefan}, year={2016}, pages={193–208} }","short":"S. Dechand, D. Schürmann, K. Busse, Y. Acar, S. Fahl, M. Smith, in: T. Holz, S. Savage (Eds.), 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016, USENIX Association, 2016, pp. 193–208.","mla":"Dechand, Sergej, et al. “An Empirical Study of Textual Key-Fingerprint Representations.” <i>25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016</i>, edited by Thorsten Holz and Stefan Savage, USENIX Association, 2016, pp. 193–208.","chicago":"Dechand, Sergej, Dominik Schürmann, Karoline Busse, Yasemin Acar, Sascha Fahl, and Matthew Smith. “An Empirical Study of Textual Key-Fingerprint Representations.” In <i>25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016</i>, edited by Thorsten Holz and Stefan Savage, 193–208. USENIX Association, 2016.","ieee":"S. Dechand, D. Schürmann, K. Busse, Y. Acar, S. Fahl, and M. Smith, “An Empirical Study of Textual Key-Fingerprint Representations,” in <i>25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016</i>, 2016, pp. 193–208.","ama":"Dechand S, Schürmann D, Busse K, Acar Y, Fahl S, Smith M. An Empirical Study of Textual Key-Fingerprint Representations. In: Holz T, Savage S, eds. <i>25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016</i>. USENIX Association; 2016:193–208."},"title":"An Empirical Study of Textual Key-Fingerprint Representations","publisher":"USENIX Association","date_updated":"2024-06-05T13:15:58Z","date_created":"2023-09-22T12:40:35Z","author":[{"last_name":"Dechand","full_name":"Dechand, Sergej","first_name":"Sergej"},{"first_name":"Dominik","last_name":"Schürmann","full_name":"Schürmann, Dominik"},{"first_name":"Karoline","full_name":"Busse, Karoline","last_name":"Busse"},{"first_name":"Yasemin","full_name":"Acar, Yasemin","id":"94636","last_name":"Acar"},{"full_name":"Fahl, Sascha","last_name":"Fahl","first_name":"Sascha"},{"first_name":"Matthew","last_name":"Smith","full_name":"Smith, Matthew"}],"editor":[{"first_name":"Thorsten","full_name":"Holz, Thorsten","last_name":"Holz"},{"first_name":"Stefan","full_name":"Savage, Stefan","last_name":"Savage"}],"status":"public","publication":"25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016","type":"conference","language":[{"iso":"eng"}],"extern":"1","_id":"47239","department":[{"_id":"34"},{"_id":"858"}],"user_id":"14931"},{"year":"2016","citation":{"apa":"Acar, Y., Backes, M., Fahl, S., Kim, D., Mazurek, M. L., &#38; Stransky, C. (2016). You Get Where You’re Looking for: The Impact of Information Sources on Code Security. <i>2016 IEEE Symposium on Security and Privacy (SP)</i>. <a href=\"https://doi.org/10.1109/sp.2016.25\">https://doi.org/10.1109/sp.2016.25</a>","short":"Y. Acar, M. Backes, S. Fahl, D. Kim, M.L. Mazurek, C. Stransky, in: 2016 IEEE Symposium on Security and Privacy (SP), IEEE, 2016.","bibtex":"@inproceedings{Acar_Backes_Fahl_Kim_Mazurek_Stransky_2016, title={You Get Where You’re Looking for: The Impact of Information Sources on Code Security}, DOI={<a href=\"https://doi.org/10.1109/sp.2016.25\">10.1109/sp.2016.25</a>}, booktitle={2016 IEEE Symposium on Security and Privacy (SP)}, publisher={IEEE}, author={Acar, Yasemin and Backes, Michael and Fahl, Sascha and Kim, Doowon and Mazurek, Michelle L. and Stransky, Christian}, year={2016} }","mla":"Acar, Yasemin, et al. “You Get Where You’re Looking for: The Impact of Information Sources on Code Security.” <i>2016 IEEE Symposium on Security and Privacy (SP)</i>, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/sp.2016.25\">10.1109/sp.2016.25</a>.","ama":"Acar Y, Backes M, Fahl S, Kim D, Mazurek ML, Stransky C. You Get Where You’re Looking for: The Impact of Information Sources on Code Security. In: <i>2016 IEEE Symposium on Security and Privacy (SP)</i>. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/sp.2016.25\">10.1109/sp.2016.25</a>","ieee":"Y. Acar, M. Backes, S. Fahl, D. Kim, M. L. Mazurek, and C. Stransky, “You Get Where You’re Looking for: The Impact of Information Sources on Code Security,” 2016, doi: <a href=\"https://doi.org/10.1109/sp.2016.25\">10.1109/sp.2016.25</a>.","chicago":"Acar, Yasemin, Michael Backes, Sascha Fahl, Doowon Kim, Michelle L. Mazurek, and Christian Stransky. “You Get Where You’re Looking for: The Impact of Information Sources on Code Security.” In <i>2016 IEEE Symposium on Security and Privacy (SP)</i>. IEEE, 2016. <a href=\"https://doi.org/10.1109/sp.2016.25\">https://doi.org/10.1109/sp.2016.25</a>."},"publication_status":"published","title":"You Get Where You're Looking for: The Impact of Information Sources on Code Security","doi":"10.1109/sp.2016.25","date_updated":"2024-06-05T13:15:19Z","publisher":"IEEE","author":[{"full_name":"Acar, Yasemin","id":"94636","last_name":"Acar","first_name":"Yasemin"},{"first_name":"Michael","full_name":"Backes, Michael","last_name":"Backes"},{"last_name":"Fahl","full_name":"Fahl, Sascha","first_name":"Sascha"},{"full_name":"Kim, Doowon","last_name":"Kim","first_name":"Doowon"},{"first_name":"Michelle L.","full_name":"Mazurek, Michelle L.","last_name":"Mazurek"},{"first_name":"Christian","last_name":"Stransky","full_name":"Stransky, Christian"}],"date_created":"2023-09-22T12:42:01Z","status":"public","publication":"2016 IEEE Symposium on Security and Privacy (SP)","type":"conference","extern":"1","language":[{"iso":"eng"}],"_id":"47241","department":[{"_id":"34"},{"_id":"858"}],"user_id":"14931"},{"status":"public","editor":[{"first_name":"P","last_name":"Festa","full_name":"Festa, P"},{"first_name":"M","full_name":"Sellmann, M","last_name":"Sellmann"},{"full_name":"Vanschoren, J","last_name":"Vanschoren","first_name":"J"}],"abstract":[{"text":"Despite the intrinsic hardness of the Traveling Salesperson Problem (TSP) heuristic solvers, e.g., LKH+restart and EAX+restart, are remarkably successful in generating satisfactory or even optimal solutions. However, the reasons for their success are not yet fully understood. Recent approaches take an analytical viewpoint and try to identify instance features, which make an instance hard or easy to solve. We contribute to this area by generating instance sets for couples of TSP algorithms A and B by maximizing/minimizing their performance difference in order to generate instances which are easier to solve for one solver and much harder to solve for the other. This instance set offers the potential to identify key features which allow to distinguish between the problem hardness classes of both algorithms.","lang":"eng"}],"type":"conference","publication":"Learning and Intelligent Optimization","language":[{"iso":"eng"}],"user_id":"15504","series_title":"Lecture Notes in Computer Science","department":[{"_id":"34"},{"_id":"819"}],"_id":"46365","citation":{"ama":"Bossek J, Trautmann H. Evolving Instances for Maximizing Performance Differences of State-of-The-Art Inexact TSP Solvers. In: Festa P, Sellmann M, Vanschoren J, eds. <i>Learning and Intelligent Optimization</i>. Vol 10079. Lecture Notes in Computer Science. Springer International Publishing; 2016:48–59. doi:<a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>","ieee":"J. Bossek and H. Trautmann, “Evolving Instances for Maximizing Performance Differences of State-of-The-Art Inexact TSP Solvers,” in <i>Learning and Intelligent Optimization</i>, 2016, vol. 10079, pp. 48–59, doi: <a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>.","chicago":"Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance Differences of State-of-The-Art Inexact TSP Solvers.” In <i>Learning and Intelligent Optimization</i>, edited by P Festa, M Sellmann, and J Vanschoren, 10079:48–59. Lecture Notes in Computer Science. Ischia, Italy: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">https://doi.org/10.1007/978-3-319-50349-3_4</a>.","apa":"Bossek, J., &#38; Trautmann, H. (2016). Evolving Instances for Maximizing Performance Differences of State-of-The-Art Inexact TSP Solvers. In P. Festa, M. Sellmann, &#38; J. Vanschoren (Eds.), <i>Learning and Intelligent Optimization</i> (Vol. 10079, pp. 48–59). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">https://doi.org/10.1007/978-3-319-50349-3_4</a>","short":"J. Bossek, H. Trautmann, in: P. Festa, M. Sellmann, J. Vanschoren (Eds.), Learning and Intelligent Optimization, Springer International Publishing, Ischia, Italy, 2016, pp. 48–59.","mla":"Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance Differences of State-of-The-Art Inexact TSP Solvers.” <i>Learning and Intelligent Optimization</i>, edited by P Festa et al., vol. 10079, Springer International Publishing, 2016, pp. 48–59, doi:<a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>.","bibtex":"@inproceedings{Bossek_Trautmann_2016, place={Ischia, Italy}, series={Lecture Notes in Computer Science}, title={Evolving Instances for Maximizing Performance Differences of State-of-The-Art Inexact TSP Solvers}, volume={10079}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>}, booktitle={Learning and Intelligent Optimization}, publisher={Springer International Publishing}, author={Bossek, Jakob and Trautmann, Heike}, editor={Festa, P and Sellmann, M and Vanschoren, J}, year={2016}, pages={48–59}, collection={Lecture Notes in Computer Science} }"},"page":"48–59","intvolume":"     10079","place":"Ischia, Italy","year":"2016","publication_identifier":{"isbn":["978-3-319-50348-6"]},"doi":"10.1007/978-3-319-50349-3_4","title":"Evolving Instances for Maximizing Performance Differences of State-of-The-Art Inexact TSP Solvers","author":[{"orcid":"0000-0002-4121-4668","last_name":"Bossek","id":"102979","full_name":"Bossek, Jakob","first_name":"Jakob"},{"first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","id":"100740","full_name":"Trautmann, Heike"}],"date_created":"2023-08-04T15:10:58Z","volume":10079,"publisher":"Springer International Publishing","date_updated":"2024-06-10T11:58:25Z"},{"user_id":"15504","series_title":"Lecture Notes in Computer Science","department":[{"_id":"34"},{"_id":"819"}],"_id":"46366","status":"public","editor":[{"first_name":"G","last_name":"Adorni","full_name":"Adorni, G"},{"first_name":"S","full_name":"Cagnoni, S","last_name":"Cagnoni"},{"first_name":"M","full_name":"Gori, M","last_name":"Gori"},{"first_name":"M","full_name":"Maratea, M","last_name":"Maratea"}],"type":"conference","doi":"10.1007/978-3-319-49130-1_1","author":[{"orcid":"0000-0002-4121-4668","last_name":"Bossek","id":"102979","full_name":"Bossek, Jakob","first_name":"Jakob"},{"last_name":"Trautmann","orcid":"0000-0002-9788-8282","full_name":"Trautmann, Heike","id":"100740","first_name":"Heike"}],"volume":10037,"date_updated":"2024-06-10T11:58:12Z","citation":{"mla":"Bossek, Jakob, and Heike Trautmann. “Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference.” <i>AI*IA 2016 Advances in Artificial Intelligence</i>, edited by G Adorni et al., vol. 10037, Springer, 2016, pp. 3–12, doi:<a href=\"https://doi.org/10.1007/978-3-319-49130-1_1\">10.1007/978-3-319-49130-1_1</a>.","bibtex":"@inproceedings{Bossek_Trautmann_2016, place={Cham}, series={Lecture Notes in Computer Science}, title={Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference}, volume={10037}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-49130-1_1\">10.1007/978-3-319-49130-1_1</a>}, booktitle={AI*IA 2016 Advances in Artificial Intelligence}, publisher={Springer}, author={Bossek, Jakob and Trautmann, Heike}, editor={Adorni, G and Cagnoni, S and Gori, M and Maratea, M}, year={2016}, pages={3–12}, collection={Lecture Notes in Computer Science} }","short":"J. Bossek, H. Trautmann, in: G. Adorni, S. Cagnoni, M. Gori, M. Maratea (Eds.), AI*IA 2016 Advances in Artificial Intelligence, Springer, Cham, 2016, pp. 3–12.","apa":"Bossek, J., &#38; Trautmann, H. (2016). Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference. In G. Adorni, S. Cagnoni, M. Gori, &#38; M. Maratea (Eds.), <i>AI*IA 2016 Advances in Artificial Intelligence</i> (Vol. 10037, pp. 3–12). Springer. <a href=\"https://doi.org/10.1007/978-3-319-49130-1_1\">https://doi.org/10.1007/978-3-319-49130-1_1</a>","chicago":"Bossek, Jakob, and Heike Trautmann. “Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference.” In <i>AI*IA 2016 Advances in Artificial Intelligence</i>, edited by G Adorni, S Cagnoni, M Gori, and M Maratea, 10037:3–12. Lecture Notes in Computer Science. Cham: Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-49130-1_1\">https://doi.org/10.1007/978-3-319-49130-1_1</a>.","ieee":"J. Bossek and H. Trautmann, “Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference,” in <i>AI*IA 2016 Advances in Artificial Intelligence</i>, 2016, vol. 10037, pp. 3–12, doi: <a href=\"https://doi.org/10.1007/978-3-319-49130-1_1\">10.1007/978-3-319-49130-1_1</a>.","ama":"Bossek J, Trautmann H. Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference. In: Adorni G, Cagnoni S, Gori M, Maratea M, eds. <i>AI*IA 2016 Advances in Artificial Intelligence</i>. Vol 10037. Lecture Notes in Computer Science. Springer; 2016:3–12. doi:<a href=\"https://doi.org/10.1007/978-3-319-49130-1_1\">10.1007/978-3-319-49130-1_1</a>"},"intvolume":"     10037","page":"3–12","place":"Cham","publication_identifier":{"isbn":["978-3-319-49129-5"]},"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"State of the Art inexact solvers of the NP-hard Traveling Salesperson Problem (TSP) are known to mostly yield high-quality solutions in reasonable computation times. With the purpose of understanding different levels of instance difficulties, instances for the current State of the Art heuristic TSP solvers LKH+restart and EAX+restart are presented which are evolved using a sophisticated evolutionary algorithm. More specifically, the performance differences of the respective solvers are maximized resulting in instances which are easier to solve for one solver and much more difficult for the other. Focusing on both optimization directions, instance features are identified which characterize both types of instances and increase the understanding of solver performance differences."}],"publication":"AI*IA 2016 Advances in Artificial Intelligence","title":"Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference","date_created":"2023-08-04T15:11:47Z","publisher":"Springer","year":"2016"}]