[{"abstract":[{"lang":"eng","text":"Until recently, customer service was exclusively provided over traditional channels. Cus- tomers could write an email or call a service center if they had questions or problems with a product or service. In recent times, this has changed dramatically as companies explore new channels to offer customer service. With the increasing popularity of social media, more companies thrive to provide customer service also over Facebook and Twitter. Companies aim to provide a better customer ex- perience by offering more convenient channels to contact a company. In addition, this unburdens traditional channels which are costly to maintain. This paper empirically evaluates the performance of customer service in social media by analysing a multitude of companies in the airline industry. We have collected several million customer service requests from Twitter and Facebook and auto- matically analyzed how efficient the service strategies of the respective companies are in terms of response rate and time."}],"publication":"Proceedings of the 17$^th$ Conference on Database Systems for Business, Technology, and Web (BTW ’17)","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","date_created":"2023-08-04T15:06:41Z","date_updated":"2023-10-16T13:36:58Z","author":[{"full_name":"Carnein, Matthias","last_name":"Carnein","first_name":"Matthias"},{"full_name":"Homann, Leschek","first_name":"Leschek","last_name":"Homann"},{"id":"100740","orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike"},{"full_name":"Vossen, Gottfried","last_name":"Vossen","first_name":"Gottfried"},{"last_name":"Kraume","first_name":"Karsten","full_name":"Kraume, Karsten"}],"publication_identifier":{"issn":["978-3-88579-660-2"]},"year":"2017","title":"Customer Service in Social Media — An Empirical Study of the Airline Industry","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Informatics (LNI)","citation":{"short":"M. Carnein, L. Homann, H. Trautmann, G. Vossen, K. Kraume, in: N. Ritter, H. Schwarz, M. Klettke, A. Thor, O. Kopp, M.W. Bernhard (Eds.), Proceedings of the 17$^th$ Conference on Database Systems for Business, Technology, and Web (BTW ’17), Gesellschaft für Informatik, Stuttgart, Germany, 2017, pp. 33–40.","chicago":"Carnein, Matthias, Leschek Homann, Heike Trautmann, Gottfried Vossen, and Karsten Kraume. “Customer Service in Social Media — An Empirical Study of the Airline Industry.” In <i>Proceedings of the 17$^th$ Conference on Database Systems for Business, Technology, and Web (BTW ’17)</i>, edited by Norbert Ritter, Holger Schwarz, Meike Klettke, Andreas Thor, Oliver Kopp, and Matthias Wieland Bernhard, P-266:33–40. Lecture Notes in Informatics (LNI). Stuttgart, Germany: Gesellschaft für Informatik, 2017.","ieee":"M. Carnein, L. Homann, H. Trautmann, G. Vossen, and K. Kraume, “Customer Service in Social Media — An Empirical Study of the Airline Industry,” in <i>Proceedings of the 17$^th$ Conference on Database Systems for Business, Technology, and Web (BTW ’17)</i>, 2017, vol. P-266, pp. 33–40.","apa":"Carnein, M., Homann, L., Trautmann, H., Vossen, G., &#38; Kraume, K. (2017). Customer Service in Social Media — An Empirical Study of the Airline Industry. In N. Ritter, H. Schwarz, M. Klettke, A. Thor, O. Kopp, &#38; M. W. Bernhard (Eds.), <i>Proceedings of the 17$^th$ Conference on Database Systems for Business, Technology, and Web (BTW ’17): Vol. P-266</i> (pp. 33–40). Gesellschaft für Informatik.","bibtex":"@inproceedings{Carnein_Homann_Trautmann_Vossen_Kraume_2017, place={Stuttgart, Germany}, series={Lecture Notes in Informatics (LNI)}, title={Customer Service in Social Media — An Empirical Study of the Airline Industry}, volume={P-266}, booktitle={Proceedings of the 17$^th$ Conference on Database Systems for Business, Technology, and Web (BTW ’17)}, publisher={Gesellschaft für Informatik}, author={Carnein, Matthias and Homann, Leschek and Trautmann, Heike and Vossen, Gottfried and Kraume, Karsten}, editor={Ritter, Norbert and Schwarz, Holger and Klettke, Meike and Thor, Andreas and Kopp, Oliver and Bernhard, Matthias Wieland}, year={2017}, pages={33–40}, collection={Lecture Notes in Informatics (LNI)} }","ama":"Carnein M, Homann L, Trautmann H, Vossen G, Kraume K. Customer Service in Social Media — An Empirical Study of the Airline Industry. In: Ritter N, Schwarz H, Klettke M, Thor A, Kopp O, Bernhard MW, eds. <i>Proceedings of the 17$^th$ Conference on Database Systems for Business, Technology, and Web (BTW ’17)</i>. Vol P-266. Lecture Notes in Informatics (LNI). Gesellschaft für Informatik; 2017:33–40.","mla":"Carnein, Matthias, et al. “Customer Service in Social Media — An Empirical Study of the Airline Industry.” <i>Proceedings of the 17$^th$ Conference on Database Systems for Business, Technology, and Web (BTW ’17)</i>, edited by Norbert Ritter et al., vol. P-266, Gesellschaft für Informatik, 2017, pp. 33–40."},"place":"Stuttgart, Germany","status":"public","volume":"P-266","editor":[{"last_name":"Ritter","first_name":"Norbert","full_name":"Ritter, Norbert"},{"full_name":"Schwarz, Holger","last_name":"Schwarz","first_name":"Holger"},{"first_name":"Meike","last_name":"Klettke","full_name":"Klettke, Meike"},{"full_name":"Thor, Andreas","last_name":"Thor","first_name":"Andreas"},{"first_name":"Oliver","last_name":"Kopp","full_name":"Kopp, Oliver"},{"full_name":"Bernhard, Matthias Wieland","first_name":"Matthias Wieland","last_name":"Bernhard"}],"user_id":"15504","_id":"46361","publisher":"Gesellschaft für Informatik","page":"33–40"},{"date_updated":"2023-10-16T13:35:17Z","publication_identifier":{"isbn":["978-3-319-54157-0"]},"author":[{"full_name":"Li, L","first_name":"L","last_name":"Li"},{"first_name":"I","last_name":"Yevseyeva","full_name":"Yevseyeva, I"},{"first_name":"V","last_name":"Basto-Fernandes","full_name":"Basto-Fernandes, V"},{"id":"100740","orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike"},{"full_name":"Jing, N","first_name":"N","last_name":"Jing"},{"full_name":"Emmerich, M","last_name":"Emmerich","first_name":"M"}],"title":"Building and Using an Ontology of Preference-Based Multiobjective Evolutionary Algorithms","year":"2017","doi":"10.1007/978-3-319-54157-0_28","language":[{"iso":"eng"}],"abstract":[{"text":"Integrating user preferences in Evolutionary Multiobjective Optimization (EMO) is currently a prevalent research topic. There is a large variety of preference handling methods (originated from Multicriteria decision making, MCDM) and EMO methods, which have been combined in various ways. This paper proposes a Web Ontology Language (OWL) ontology to model and systematize the knowledge of preference-based multiobjective evolutionary algorithms (PMOEAs). Detailed procedure is given on how to build and use the ontology with the help of Protégé. Different use-cases, including training new learners, querying and reasoning are exemplified and show remarkable benefit for both EMO and MCDM communities.","lang":"eng"}],"publication":"Evolutionary Multi-Criterion Optimization: 9$^th$ International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings","department":[{"_id":"34"},{"_id":"819"}],"type":"book_chapter","date_created":"2023-08-04T15:02:20Z","status":"public","editor":[{"full_name":"Trautmann, H","first_name":"H","last_name":"Trautmann"},{"first_name":"G","last_name":"Rudolph","full_name":"Rudolph, G"},{"full_name":"Klamroth, K","first_name":"K","last_name":"Klamroth"},{"last_name":"Schütze","first_name":"O","full_name":"Schütze, O"},{"first_name":"M","last_name":"Wiecek","full_name":"Wiecek, M"},{"first_name":"Y","last_name":"Jin","full_name":"Jin, Y"},{"first_name":"C","last_name":"Grimme","full_name":"Grimme, C"}],"user_id":"15504","publisher":"Springer International Publishing","_id":"46356","page":"406–421","citation":{"ieee":"L. Li, I. Yevseyeva, V. Basto-Fernandes, H. Trautmann, N. Jing, and M. Emmerich, “Building and Using an Ontology of Preference-Based Multiobjective Evolutionary Algorithms,” in <i>Evolutionary Multi-Criterion Optimization: 9$^th$ International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings</i>, H. Trautmann, G. Rudolph, K. Klamroth, O. Schütze, M. Wiecek, Y. Jin, and C. Grimme, Eds. Cham: Springer International Publishing, 2017, pp. 406–421.","apa":"Li, L., Yevseyeva, I., Basto-Fernandes, V., Trautmann, H., Jing, N., &#38; Emmerich, M. (2017). Building and Using an Ontology of Preference-Based Multiobjective Evolutionary Algorithms. In H. Trautmann, G. Rudolph, K. Klamroth, O. Schütze, M. Wiecek, Y. Jin, &#38; C. Grimme (Eds.), <i>Evolutionary Multi-Criterion Optimization: 9$^th$ International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings</i> (pp. 406–421). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-54157-0_28\">https://doi.org/10.1007/978-3-319-54157-0_28</a>","short":"L. Li, I. Yevseyeva, V. Basto-Fernandes, H. Trautmann, N. Jing, M. Emmerich, in: H. Trautmann, G. Rudolph, K. Klamroth, O. Schütze, M. Wiecek, Y. Jin, C. Grimme (Eds.), Evolutionary Multi-Criterion Optimization: 9$^th$ International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings, Springer International Publishing, Cham, 2017, pp. 406–421.","chicago":"Li, L, I Yevseyeva, V Basto-Fernandes, Heike Trautmann, N Jing, and M Emmerich. “Building and Using an Ontology of Preference-Based Multiobjective Evolutionary Algorithms.” In <i>Evolutionary Multi-Criterion Optimization: 9$^th$ International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings</i>, edited by H Trautmann, G Rudolph, K Klamroth, O Schütze, M Wiecek, Y Jin, and C Grimme, 406–421. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-54157-0_28\">https://doi.org/10.1007/978-3-319-54157-0_28</a>.","mla":"Li, L., et al. “Building and Using an Ontology of Preference-Based Multiobjective Evolutionary Algorithms.” <i>Evolutionary Multi-Criterion Optimization: 9$^th$ International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings</i>, edited by H Trautmann et al., Springer International Publishing, 2017, pp. 406–421, doi:<a href=\"https://doi.org/10.1007/978-3-319-54157-0_28\">10.1007/978-3-319-54157-0_28</a>.","bibtex":"@inbook{Li_Yevseyeva_Basto-Fernandes_Trautmann_Jing_Emmerich_2017, place={Cham}, title={Building and Using an Ontology of Preference-Based Multiobjective Evolutionary Algorithms}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-54157-0_28\">10.1007/978-3-319-54157-0_28</a>}, booktitle={Evolutionary Multi-Criterion Optimization: 9$^th$ International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings}, publisher={Springer International Publishing}, author={Li, L and Yevseyeva, I and Basto-Fernandes, V and Trautmann, Heike and Jing, N and Emmerich, M}, editor={Trautmann, H and Rudolph, G and Klamroth, K and Schütze, O and Wiecek, M and Jin, Y and Grimme, C}, year={2017}, pages={406–421} }","ama":"Li L, Yevseyeva I, Basto-Fernandes V, Trautmann H, Jing N, Emmerich M. Building and Using an Ontology of Preference-Based Multiobjective Evolutionary Algorithms. In: Trautmann H, Rudolph G, Klamroth K, et al., eds. <i>Evolutionary Multi-Criterion Optimization: 9$^th$ International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings</i>. Springer International Publishing; 2017:406–421. doi:<a href=\"https://doi.org/10.1007/978-3-319-54157-0_28\">10.1007/978-3-319-54157-0_28</a>"},"place":"Cham"},{"place":"Cham","citation":{"ieee":"K. Tierney, J. Handali, C. Grimme, and H. Trautmann, “Multi-objective Optimization for Liner Shipping Fleet Repositioning,” in <i>Evolutionary Multi-Criterion Optimization: 9$^th$ International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings</i>, H. Trautmann, G. Rudolph, K. Klamroth, O. Schütze, M. Wiecek, Y. Jin, and C. Grimme, Eds. Cham: Springer International Publishing, 2017, pp. 622–638.","apa":"Tierney, K., Handali, J., Grimme, C., &#38; Trautmann, H. (2017). Multi-objective Optimization for Liner Shipping Fleet Repositioning. In H. Trautmann, G. Rudolph, K. Klamroth, O. Schütze, M. Wiecek, Y. Jin, &#38; C. Grimme (Eds.), <i>Evolutionary Multi-Criterion Optimization: 9$^th$ International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings</i> (pp. 622–638). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-54157-0_42\">https://doi.org/10.1007/978-3-319-54157-0_42</a>","chicago":"Tierney, K, J Handali, C Grimme, and Heike Trautmann. “Multi-Objective Optimization for Liner Shipping Fleet Repositioning.” In <i>Evolutionary Multi-Criterion Optimization: 9$^th$ International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings</i>, edited by H Trautmann, G Rudolph, K Klamroth, O Schütze, M Wiecek, Y Jin, and C Grimme, 622–638. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-54157-0_42\">https://doi.org/10.1007/978-3-319-54157-0_42</a>.","short":"K. Tierney, J. Handali, C. Grimme, H. Trautmann, in: H. Trautmann, G. Rudolph, K. Klamroth, O. Schütze, M. Wiecek, Y. Jin, C. Grimme (Eds.), Evolutionary Multi-Criterion Optimization: 9$^th$ International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings, Springer International Publishing, Cham, 2017, pp. 622–638.","mla":"Tierney, K., et al. “Multi-Objective Optimization for Liner Shipping Fleet Repositioning.” <i>Evolutionary Multi-Criterion Optimization: 9$^th$ International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings</i>, edited by H Trautmann et al., Springer International Publishing, 2017, pp. 622–638, doi:<a href=\"https://doi.org/10.1007/978-3-319-54157-0_42\">10.1007/978-3-319-54157-0_42</a>.","bibtex":"@inbook{Tierney_Handali_Grimme_Trautmann_2017, place={Cham}, title={Multi-objective Optimization for Liner Shipping Fleet Repositioning}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-54157-0_42\">10.1007/978-3-319-54157-0_42</a>}, booktitle={Evolutionary Multi-Criterion Optimization: 9$^th$ International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings}, publisher={Springer International Publishing}, author={Tierney, K and Handali, J and Grimme, C and Trautmann, Heike}, editor={Trautmann, H and Rudolph, G and Klamroth, K and Schütze, O and Wiecek, M and Jin, Y and Grimme, C}, year={2017}, pages={622–638} }","ama":"Tierney K, Handali J, Grimme C, Trautmann H. Multi-objective Optimization for Liner Shipping Fleet Repositioning. In: Trautmann H, Rudolph G, Klamroth K, et al., eds. <i>Evolutionary Multi-Criterion Optimization: 9$^th$ International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings</i>. Springer International Publishing; 2017:622–638. doi:<a href=\"https://doi.org/10.1007/978-3-319-54157-0_42\">10.1007/978-3-319-54157-0_42</a>"},"user_id":"15504","editor":[{"first_name":"H","last_name":"Trautmann","full_name":"Trautmann, H"},{"first_name":"G","last_name":"Rudolph","full_name":"Rudolph, G"},{"full_name":"Klamroth, K","first_name":"K","last_name":"Klamroth"},{"last_name":"Schütze","first_name":"O","full_name":"Schütze, O"},{"full_name":"Wiecek, M","last_name":"Wiecek","first_name":"M"},{"last_name":"Jin","first_name":"Y","full_name":"Jin, Y"},{"full_name":"Grimme, C","first_name":"C","last_name":"Grimme"}],"page":"622–638","publisher":"Springer International Publishing","_id":"46357","status":"public","type":"book_chapter","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T15:03:17Z","abstract":[{"text":"The liner shipping fleet repositioning problem (LSFRP) is a central optimization problem within the container shipping industry. Several approaches exist for solving this problem using exact and heuristic techniques, however all of them use a single objective function for determining an optimal solution. We propose a multi-objective approach based on a simulated annealing heuristic so that repositioning coordinators can better balance profit making with cost-savings and environmental sustainability. As the first multi-objective approach in the area of liner shipping routing, we show that giving more options to decision makers need not be costly. Indeed, our approach requires no extra runtime than a weighted objective heuristic and provides a rich set of solutions along the Pareto front.","lang":"eng"}],"publication":"Evolutionary Multi-Criterion Optimization: 9$^th$ International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings","doi":"10.1007/978-3-319-54157-0_42","language":[{"iso":"eng"}],"date_updated":"2023-10-16T13:35:41Z","title":"Multi-objective Optimization for Liner Shipping Fleet Repositioning","year":"2017","author":[{"full_name":"Tierney, K","first_name":"K","last_name":"Tierney"},{"full_name":"Handali, J","last_name":"Handali","first_name":"J"},{"full_name":"Grimme, C","last_name":"Grimme","first_name":"C"},{"last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike","full_name":"Trautmann, Heike","id":"100740"}],"publication_identifier":{"isbn":["978-3-319-54157-0"]}},{"author":[{"full_name":"Carnein, Matthias","first_name":"Matthias","last_name":"Carnein"},{"last_name":"Assenmacher","first_name":"Dennis","full_name":"Assenmacher, Dennis"},{"last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike","full_name":"Trautmann, Heike","id":"100740"}],"publication_identifier":{"isbn":["978-3-319-70625-2"]},"year":"2017","title":"Stream Clustering of Chat Messages with Applications to Twitch Streams","date_updated":"2023-10-16T13:36:23Z","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-70625-2_8","publication":"Proceedings of the 36$^th$ International Conference on Conceptual Modeling (ER’17)","abstract":[{"text":"This paper proposes a new stream clustering algorithm for text streams. The algorithm combines concepts from stream clustering and text analysis in order to incrementally maintain a number of text droplets that represent topics within the stream. Our algorithm adapts to changes of topic over time and can handle noise and outliers gracefully by decaying the importance of irrelevant clusters. We demonstrate the performance of our approach by using more than one million real-world texts from the video streaming platform Twitch.tv.","lang":"eng"}],"date_created":"2023-08-04T15:04:57Z","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","status":"public","_id":"46359","publisher":"Springer International Publishing","page":"79–88","editor":[{"first_name":"Sergio","last_name":"de Cesare","full_name":"de Cesare, Sergio"},{"first_name":"Frank","last_name":"Ulrich","full_name":"Ulrich, Frank"}],"user_id":"15504","citation":{"chicago":"Carnein, Matthias, Dennis Assenmacher, and Heike Trautmann. “Stream Clustering of Chat Messages with Applications to Twitch Streams.” In <i>Proceedings of the 36$^th$ International Conference on Conceptual Modeling (ER’17)</i>, edited by Sergio de Cesare and Frank Ulrich, 79–88. Valencia, Spain: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-70625-2_8\">https://doi.org/10.1007/978-3-319-70625-2_8</a>.","short":"M. Carnein, D. Assenmacher, H. Trautmann, in: S. de Cesare, F. Ulrich (Eds.), Proceedings of the 36$^th$ International Conference on Conceptual Modeling (ER’17), Springer International Publishing, Valencia, Spain, 2017, pp. 79–88.","ieee":"M. Carnein, D. Assenmacher, and H. Trautmann, “Stream Clustering of Chat Messages with Applications to Twitch Streams,” in <i>Proceedings of the 36$^th$ International Conference on Conceptual Modeling (ER’17)</i>, 2017, pp. 79–88, doi: <a href=\"https://doi.org/10.1007/978-3-319-70625-2_8\">10.1007/978-3-319-70625-2_8</a>.","apa":"Carnein, M., Assenmacher, D., &#38; Trautmann, H. (2017). Stream Clustering of Chat Messages with Applications to Twitch Streams. In S. de Cesare &#38; F. Ulrich (Eds.), <i>Proceedings of the 36$^th$ International Conference on Conceptual Modeling (ER’17)</i> (pp. 79–88). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-70625-2_8\">https://doi.org/10.1007/978-3-319-70625-2_8</a>","bibtex":"@inproceedings{Carnein_Assenmacher_Trautmann_2017, place={Valencia, Spain}, title={Stream Clustering of Chat Messages with Applications to Twitch Streams}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-70625-2_8\">10.1007/978-3-319-70625-2_8</a>}, booktitle={Proceedings of the 36$^th$ International Conference on Conceptual Modeling (ER’17)}, publisher={Springer International Publishing}, author={Carnein, Matthias and Assenmacher, Dennis and Trautmann, Heike}, editor={de Cesare, Sergio and Ulrich, Frank}, year={2017}, pages={79–88} }","ama":"Carnein M, Assenmacher D, Trautmann H. Stream Clustering of Chat Messages with Applications to Twitch Streams. In: de Cesare S, Ulrich F, eds. <i>Proceedings of the 36$^th$ International Conference on Conceptual Modeling (ER’17)</i>. Springer International Publishing; 2017:79–88. doi:<a href=\"https://doi.org/10.1007/978-3-319-70625-2_8\">10.1007/978-3-319-70625-2_8</a>","mla":"Carnein, Matthias, et al. “Stream Clustering of Chat Messages with Applications to Twitch Streams.” <i>Proceedings of the 36$^th$ International Conference on Conceptual Modeling (ER’17)</i>, edited by Sergio de Cesare and Frank Ulrich, Springer International Publishing, 2017, pp. 79–88, doi:<a href=\"https://doi.org/10.1007/978-3-319-70625-2_8\">10.1007/978-3-319-70625-2_8</a>."},"place":"Valencia, Spain"},{"title":"Social Bots: Human-Like by Means of Human Control?","year":"2017","status":"public","author":[{"last_name":"Grimme","first_name":"C","full_name":"Grimme, C"},{"full_name":"Preuss, M","last_name":"Preuss","first_name":"M"},{"last_name":"Adam","first_name":"L","full_name":"Adam, L"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike","id":"100740"}],"date_updated":"2023-10-16T13:37:14Z","intvolume":"         5","page":"279–293","_id":"46362","language":[{"iso":"eng"}],"doi":"10.1089/big.2017.0044","user_id":"15504","volume":5,"publication":"Big Data","issue":"4","citation":{"chicago":"Grimme, C, M Preuss, L Adam, and Heike Trautmann. “Social Bots: Human-Like by Means of Human Control?” <i>Big Data</i> 5, no. 4 (2017): 279–293. <a href=\"https://doi.org/10.1089/big.2017.0044\">https://doi.org/10.1089/big.2017.0044</a>.","ama":"Grimme C, Preuss M, Adam L, Trautmann H. Social Bots: Human-Like by Means of Human Control? <i>Big Data</i>. 2017;5(4):279–293. doi:<a href=\"https://doi.org/10.1089/big.2017.0044\">10.1089/big.2017.0044</a>","short":"C. Grimme, M. Preuss, L. Adam, H. Trautmann, Big Data 5 (2017) 279–293.","bibtex":"@article{Grimme_Preuss_Adam_Trautmann_2017, title={Social Bots: Human-Like by Means of Human Control?}, volume={5}, DOI={<a href=\"https://doi.org/10.1089/big.2017.0044\">10.1089/big.2017.0044</a>}, number={4}, journal={Big Data}, author={Grimme, C and Preuss, M and Adam, L and Trautmann, Heike}, year={2017}, pages={279–293} }","mla":"Grimme, C., et al. “Social Bots: Human-Like by Means of Human Control?” <i>Big Data</i>, vol. 5, no. 4, 2017, pp. 279–293, doi:<a href=\"https://doi.org/10.1089/big.2017.0044\">10.1089/big.2017.0044</a>.","apa":"Grimme, C., Preuss, M., Adam, L., &#38; Trautmann, H. (2017). Social Bots: Human-Like by Means of Human Control? <i>Big Data</i>, <i>5</i>(4), 279–293. <a href=\"https://doi.org/10.1089/big.2017.0044\">https://doi.org/10.1089/big.2017.0044</a>","ieee":"C. Grimme, M. Preuss, L. Adam, and H. Trautmann, “Social Bots: Human-Like by Means of Human Control?,” <i>Big Data</i>, vol. 5, no. 4, pp. 279–293, 2017, doi: <a href=\"https://doi.org/10.1089/big.2017.0044\">10.1089/big.2017.0044</a>."},"abstract":[{"text":"Social bots are currently regarded an influential but also somewhat mysterious factor in public discourse and opinion making. They are considered to be capable of massively distributing propaganda in social and online media, and their application is even suspected to be partly responsible for recent election results. Astonishingly, the term social bot is not well defined and different scientific disciplines use divergent definitions. This work starts with a balanced definition attempt, before providing an overview of how social bots actually work (taking the example of Twitter) and what their current technical limitations are. Despite recent research progress in Deep Learning and Big Data, there are many activities bots cannot handle well. We then discuss how bot capabilities can be extended and controlled by integrating humans into the process and reason that this is currently the most promising way to realize meaningful interactions with other humans. This finally leads to the conclusion that hybridization is a challenge for current detection mechanisms and has to be handled with more sophisticated approaches to identify political propaganda distributed with social bots.","lang":"eng"}],"date_created":"2023-08-04T15:07:56Z","type":"journal_article","department":[{"_id":"34"},{"_id":"819"}]},{"date_updated":"2023-10-16T13:35:59Z","author":[{"first_name":"Matthias","last_name":"Carnein","full_name":"Carnein, Matthias"},{"full_name":"Assenmacher, Dennis","last_name":"Assenmacher","first_name":"Dennis"},{"full_name":"Trautmann, Heike","first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","id":"100740"}],"publication_identifier":{"isbn":["978-1-4503-4487-6/17/05"]},"year":"2017","title":"An Empirical Comparison of Stream Clustering Algorithms","status":"public","doi":"10.1145/3075564.3078887","user_id":"15504","_id":"46358","language":[{"iso":"eng"}],"page":"361–365","abstract":[{"lang":"eng","text":"Analysing streaming data has received considerable attention over the recent years. A key research area in this field is stream clustering which aims to recognize patterns in a possibly unbounded data stream of varying speed and structure. Over the past decades a multitude of new stream clustering algorithms have been proposed. However, to the best of our knowledge, no rigorous analysis and comparison of the different approaches has been performed. Our paper fills this gap and provides extensive experiments for a total of ten popular algorithms. We utilize a number of standard data sets of both, real and synthetic data and identify key weaknesses and strengths of the existing algorithms."}],"citation":{"ieee":"M. Carnein, D. Assenmacher, and H. Trautmann, “An Empirical Comparison of Stream Clustering Algorithms,” in <i>Proceedings of the ACM International Conference on Computing Frontiers (CF ’17)</i>, 2017, pp. 361–365, doi: <a href=\"https://doi.org/10.1145/3075564.3078887\">10.1145/3075564.3078887</a>.","apa":"Carnein, M., Assenmacher, D., &#38; Trautmann, H. (2017). An Empirical Comparison of Stream Clustering Algorithms. <i>Proceedings of the ACM International Conference on Computing Frontiers (CF ’17)</i>, 361–365. <a href=\"https://doi.org/10.1145/3075564.3078887\">https://doi.org/10.1145/3075564.3078887</a>","short":"M. Carnein, D. Assenmacher, H. Trautmann, in: Proceedings of the ACM International Conference on Computing Frontiers (CF ’17), Siena, Italy, 2017, pp. 361–365.","chicago":"Carnein, Matthias, Dennis Assenmacher, and Heike Trautmann. “An Empirical Comparison of Stream Clustering Algorithms.” In <i>Proceedings of the ACM International Conference on Computing Frontiers (CF ’17)</i>, 361–365. Siena, Italy, 2017. <a href=\"https://doi.org/10.1145/3075564.3078887\">https://doi.org/10.1145/3075564.3078887</a>.","mla":"Carnein, Matthias, et al. “An Empirical Comparison of Stream Clustering Algorithms.” <i>Proceedings of the ACM International Conference on Computing Frontiers (CF ’17)</i>, 2017, pp. 361–365, doi:<a href=\"https://doi.org/10.1145/3075564.3078887\">10.1145/3075564.3078887</a>.","bibtex":"@inproceedings{Carnein_Assenmacher_Trautmann_2017, place={Siena, Italy}, title={An Empirical Comparison of Stream Clustering Algorithms}, DOI={<a href=\"https://doi.org/10.1145/3075564.3078887\">10.1145/3075564.3078887</a>}, booktitle={Proceedings of the ACM International Conference on Computing Frontiers (CF ’17)}, author={Carnein, Matthias and Assenmacher, Dennis and Trautmann, Heike}, year={2017}, pages={361–365} }","ama":"Carnein M, Assenmacher D, Trautmann H. An Empirical Comparison of Stream Clustering Algorithms. In: <i>Proceedings of the ACM International Conference on Computing Frontiers (CF ’17)</i>. ; 2017:361–365. doi:<a href=\"https://doi.org/10.1145/3075564.3078887\">10.1145/3075564.3078887</a>"},"publication":"Proceedings of the ACM International Conference on Computing Frontiers (CF ’17)","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","place":"Siena, Italy","date_created":"2023-08-04T15:04:09Z"},{"date_created":"2023-11-14T15:58:55Z","type":"conference","keyword":["evolutionary optimization","software-tools"],"department":[{"_id":"819"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","abstract":[{"lang":"eng","text":"The novel R package ecr (version 2), short for Evolutionary Computation in R, provides a comprehensive collection of building blocks for constructing powerful evolutionary algorithms for single- and multi-objective continuous and combinatorial optimization problems. It allows to solve standard optimization tasks with few lines of code using a black-box approach. Moreover, rapid prototyping of non-standard ideas is possible via an explicit, white-box approach. This paper describes the design principles of the package and gives some introductory examples on how to use the package in practise."}],"extern":"1","series_title":"GECCO ’17","language":[{"iso":"eng"}],"doi":"10.1145/3067695.3082470","title":"Ecr 2.0: A Modular Framework for Evolutionary Computation in R","year":"2017","publication_identifier":{"isbn":["978-1-4503-4939-0"]},"author":[{"full_name":"Bossek, Jakob","first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","id":"102979"}],"date_updated":"2023-12-13T10:45:05Z","publication_status":"published","place":"New York, NY, USA","citation":{"ieee":"J. Bossek, “Ecr 2.0: A Modular Framework for Evolutionary Computation in R,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 2017, pp. 1187–1193, doi: <a href=\"https://doi.org/10.1145/3067695.3082470\">10.1145/3067695.3082470</a>.","apa":"Bossek, J. (2017). Ecr 2.0: A Modular Framework for Evolutionary Computation in R. <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 1187–1193. <a href=\"https://doi.org/10.1145/3067695.3082470\">https://doi.org/10.1145/3067695.3082470</a>","mla":"Bossek, Jakob. “Ecr 2.0: A Modular Framework for Evolutionary Computation in R.” <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Association for Computing Machinery, 2017, pp. 1187–1193, doi:<a href=\"https://doi.org/10.1145/3067695.3082470\">10.1145/3067695.3082470</a>.","bibtex":"@inproceedings{Bossek_2017, place={New York, NY, USA}, series={GECCO ’17}, title={Ecr 2.0: A Modular Framework for Evolutionary Computation in R}, DOI={<a href=\"https://doi.org/10.1145/3067695.3082470\">10.1145/3067695.3082470</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference Companion}, publisher={Association for Computing Machinery}, author={Bossek, Jakob}, year={2017}, pages={1187–1193}, collection={GECCO ’17} }","short":"J. Bossek, in: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery, New York, NY, USA, 2017, pp. 1187–1193.","ama":"Bossek J. Ecr 2.0: A Modular Framework for Evolutionary Computation in R. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>. GECCO ’17. Association for Computing Machinery; 2017:1187–1193. doi:<a href=\"https://doi.org/10.1145/3067695.3082470\">10.1145/3067695.3082470</a>","chicago":"Bossek, Jakob. “Ecr 2.0: A Modular Framework for Evolutionary Computation in R.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 1187–1193. GECCO ’17. New York, NY, USA: Association for Computing Machinery, 2017. <a href=\"https://doi.org/10.1145/3067695.3082470\">https://doi.org/10.1145/3067695.3082470</a>."},"page":"1187–1193","_id":"48863","publisher":"Association for Computing Machinery","user_id":"102979","status":"public"},{"user_id":"102979","doi":"10.1109/SSCI.2017.8285183","language":[{"iso":"eng"}],"_id":"48857","page":"1–8","publication_status":"published","date_updated":"2023-12-13T10:44:28Z","author":[{"id":"102979","full_name":"Bossek, Jakob","first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668"},{"full_name":"Grimme, Christian","first_name":"Christian","last_name":"Grimme"}],"status":"public","title":"A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem","year":"2017","department":[{"_id":"819"}],"type":"conference","keyword":["Convergence","Encoding","Euclidean distance","Evolutionary computation","Heating systems","Optimization","Standards"],"date_created":"2023-11-14T15:58:54Z","extern":"1","abstract":[{"text":"While finding minimum-cost spanning trees (MST) in undirected graphs is solvable in polynomial time, the multi-criteria minimum spanning tree problem (mcMST) is NP-hard. Interestingly, the mcMST problem has not been in focus of evolutionary computation research for a long period of time, although, its relevance for real world problems is easy to see. The available and most notable approaches by Zhou and Gen as well as by Knowles and Corne concentrate on solution encoding and on fairly dated selection mechanisms. In this work, we revisit the mcMST and focus on the mutation operators as exploratory components of evolutionary algorithms neglected so far. We investigate optimal solution characteristics to discuss current mutation strategies, identify shortcomings of these operators, and propose a sub-tree based operator which offers what we term Pareto-beneficial behavior: ensuring convergence and diversity at the same time. The operator is empirically evaluated inside modern standard evolutionary meta-heuristics for multi-criteria optimization and compared to hitherto applied mutation operators in the context of mcMST.","lang":"eng"}],"citation":{"chicago":"Bossek, Jakob, and Christian Grimme. “A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem.” In <i>2017 IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 1–8, 2017. <a href=\"https://doi.org/10.1109/SSCI.2017.8285183\">https://doi.org/10.1109/SSCI.2017.8285183</a>.","short":"J. Bossek, C. Grimme, in: 2017 IEEE Symposium Series on Computational Intelligence (SSCI), 2017, pp. 1–8.","ieee":"J. Bossek and C. Grimme, “A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem,” in <i>2017 IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 2017, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/SSCI.2017.8285183\">10.1109/SSCI.2017.8285183</a>.","apa":"Bossek, J., &#38; Grimme, C. (2017). A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem. <i>2017 IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 1–8. <a href=\"https://doi.org/10.1109/SSCI.2017.8285183\">https://doi.org/10.1109/SSCI.2017.8285183</a>","bibtex":"@inproceedings{Bossek_Grimme_2017, title={A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem}, DOI={<a href=\"https://doi.org/10.1109/SSCI.2017.8285183\">10.1109/SSCI.2017.8285183</a>}, booktitle={2017 IEEE Symposium Series on Computational Intelligence (SSCI)}, author={Bossek, Jakob and Grimme, Christian}, year={2017}, pages={1–8} }","ama":"Bossek J, Grimme C. A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem. In: <i>2017 IEEE Symposium Series on Computational Intelligence (SSCI)</i>. ; 2017:1–8. doi:<a href=\"https://doi.org/10.1109/SSCI.2017.8285183\">10.1109/SSCI.2017.8285183</a>","mla":"Bossek, Jakob, and Christian Grimme. “A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem.” <i>2017 IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 2017, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/SSCI.2017.8285183\">10.1109/SSCI.2017.8285183</a>."},"publication":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)"},{"publication_status":"published","date_updated":"2023-12-13T10:44:36Z","title":"An Extended Mutation-Based Priority-Rule Integration Concept for Multi-Objective Machine Scheduling","year":"2017","status":"public","author":[{"full_name":"Bossek, Jakob","first_name":"Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek","id":"102979"},{"last_name":"Grimme","first_name":"Christian","full_name":"Grimme, Christian"}],"user_id":"102979","doi":"10.1109/SSCI.2017.8285224","page":"1–8","_id":"48856","language":[{"iso":"eng"}],"extern":"1","abstract":[{"text":"There exist many optimal or heuristic priority rules for machine scheduling problems, which can easily be integrated into single-objective evolutionary algorithms via mutation operators. However, in the multi-objective case, simultaneously applying different priorities for different objectives may cause severe disruptions in the genome and may lead to inferior solutions. In this paper, we combine an existing mutation operator concept with new insights from detailed observation of the structure of solutions for multi-objective machine scheduling problems. This allows the comprehensive integration of priority rules to produce better Pareto-front approximations. We evaluate the extended operator concept compared to standard swap mutation and the stand-alone components of our hybrid scheme, which performs best in all evaluated cases.","lang":"eng"}],"publication":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","citation":{"chicago":"Bossek, Jakob, and Christian Grimme. “An Extended Mutation-Based Priority-Rule Integration Concept for Multi-Objective Machine Scheduling.” In <i>2017 IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 1–8, 2017. <a href=\"https://doi.org/10.1109/SSCI.2017.8285224\">https://doi.org/10.1109/SSCI.2017.8285224</a>.","short":"J. Bossek, C. Grimme, in: 2017 IEEE Symposium Series on Computational Intelligence (SSCI), 2017, pp. 1–8.","ama":"Bossek J, Grimme C. An Extended Mutation-Based Priority-Rule Integration Concept for Multi-Objective Machine Scheduling. In: <i>2017 IEEE Symposium Series on Computational Intelligence (SSCI)</i>. ; 2017:1–8. doi:<a href=\"https://doi.org/10.1109/SSCI.2017.8285224\">10.1109/SSCI.2017.8285224</a>","bibtex":"@inproceedings{Bossek_Grimme_2017, title={An Extended Mutation-Based Priority-Rule Integration Concept for Multi-Objective Machine Scheduling}, DOI={<a href=\"https://doi.org/10.1109/SSCI.2017.8285224\">10.1109/SSCI.2017.8285224</a>}, booktitle={2017 IEEE Symposium Series on Computational Intelligence (SSCI)}, author={Bossek, Jakob and Grimme, Christian}, year={2017}, pages={1–8} }","mla":"Bossek, Jakob, and Christian Grimme. “An Extended Mutation-Based Priority-Rule Integration Concept for Multi-Objective Machine Scheduling.” <i>2017 IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 2017, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/SSCI.2017.8285224\">10.1109/SSCI.2017.8285224</a>.","apa":"Bossek, J., &#38; Grimme, C. (2017). An Extended Mutation-Based Priority-Rule Integration Concept for Multi-Objective Machine Scheduling. <i>2017 IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 1–8. <a href=\"https://doi.org/10.1109/SSCI.2017.8285224\">https://doi.org/10.1109/SSCI.2017.8285224</a>","ieee":"J. Bossek and C. Grimme, “An Extended Mutation-Based Priority-Rule Integration Concept for Multi-Objective Machine Scheduling,” in <i>2017 IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 2017, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/SSCI.2017.8285224\">10.1109/SSCI.2017.8285224</a>."},"type":"conference","keyword":["Evolutionary computation","Processor scheduling","Schedules","Scheduling","Sociology","Standards","Statistics"],"department":[{"_id":"819"}],"date_created":"2023-11-14T15:58:54Z"},{"date_created":"2023-11-14T15:58:55Z","type":"journal_article","department":[{"_id":"819"}],"issue":"17","publication":"Journal of Open Source Software","citation":{"ieee":"J. Bossek, “mcMST: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem,” <i>Journal of Open Source Software</i>, vol. 2, no. 17, p. 374, 2017, doi: <a href=\"https://doi.org/10.21105/joss.00374\">10.21105/joss.00374</a>.","apa":"Bossek, J. (2017). mcMST: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem. <i>Journal of Open Source Software</i>, <i>2</i>(17), 374. <a href=\"https://doi.org/10.21105/joss.00374\">https://doi.org/10.21105/joss.00374</a>","short":"J. Bossek, Journal of Open Source Software 2 (2017) 374.","chicago":"Bossek, Jakob. “McMST: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem.” <i>Journal of Open Source Software</i> 2, no. 17 (2017): 374. <a href=\"https://doi.org/10.21105/joss.00374\">https://doi.org/10.21105/joss.00374</a>.","mla":"Bossek, Jakob. “McMST: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem.” <i>Journal of Open Source Software</i>, vol. 2, no. 17, 2017, p. 374, doi:<a href=\"https://doi.org/10.21105/joss.00374\">10.21105/joss.00374</a>.","bibtex":"@article{Bossek_2017, title={mcMST: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem}, volume={2}, DOI={<a href=\"https://doi.org/10.21105/joss.00374\">10.21105/joss.00374</a>}, number={17}, journal={Journal of Open Source Software}, author={Bossek, Jakob}, year={2017}, pages={374} }","ama":"Bossek J. mcMST: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem. <i>Journal of Open Source Software</i>. 2017;2(17):374. doi:<a href=\"https://doi.org/10.21105/joss.00374\">10.21105/joss.00374</a>"},"abstract":[{"lang":"eng","text":"Bossek, (2017), mcMST: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem, Journal of Open Source Software, 2(17), 374, doi:10.21105/joss.00374"}],"page":"374","_id":"48864","language":[{"iso":"eng"}],"doi":"10.21105/joss.00374","user_id":"102979","volume":2,"year":"2017","title":"mcMST: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem","status":"public","author":[{"id":"102979","last_name":"Bossek","orcid":"0000-0002-4121-4668","first_name":"Jakob","full_name":"Bossek, Jakob"}],"publication_identifier":{"issn":["2475-9066"]},"date_updated":"2023-12-13T10:52:04Z","intvolume":"         2"},{"publication":"The R Journal","issue":"1","citation":{"mla":"Bossek, Jakob. “Smoof: Single- and Multi-Objective Optimization Test Functions.” <i>The R Journal</i>, vol. 9, no. 1, 2017, pp. 103–113.","ama":"Bossek J. Smoof: Single- and Multi-Objective Optimization Test Functions. <i>The R Journal</i>. 2017;9(1):103–113.","bibtex":"@article{Bossek_2017, title={Smoof: Single- and Multi-Objective Optimization Test Functions}, volume={9}, number={1}, journal={The R Journal}, author={Bossek, Jakob}, year={2017}, pages={103–113} }","apa":"Bossek, J. (2017). Smoof: Single- and Multi-Objective Optimization Test Functions. <i>The R Journal</i>, <i>9</i>(1), 103–113.","ieee":"J. Bossek, “Smoof: Single- and Multi-Objective Optimization Test Functions,” <i>The R Journal</i>, vol. 9, no. 1, pp. 103–113, 2017.","chicago":"Bossek, Jakob. “Smoof: Single- and Multi-Objective Optimization Test Functions.” <i>The R Journal</i> 9, no. 1 (2017): 103–113.","short":"J. Bossek, The R Journal 9 (2017) 103–113."},"date_created":"2023-11-14T15:58:56Z","type":"journal_article","department":[{"_id":"819"}],"year":"2017","title":"Smoof: Single- and Multi-Objective Optimization Test Functions","status":"public","publication_identifier":{"issn":["2073-4859"]},"author":[{"id":"102979","last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob"}],"date_updated":"2023-12-13T10:51:57Z","intvolume":"         9","page":"103–113","language":[{"iso":"eng"}],"_id":"48865","user_id":"102979","volume":9},{"publication":"CoRR","citation":{"apa":"Bischl, B., Richter, J., Bossek, J., Horn, D., Thomas, J., &#38; Lang, M. (2017). mlrMBO: A Modular Framework for Model-Based Optimization of Expensive Black-Box Functions. <i>CoRR</i>.","ieee":"B. Bischl, J. Richter, J. Bossek, D. Horn, J. Thomas, and M. Lang, “mlrMBO: A Modular Framework for Model-Based Optimization of Expensive Black-Box Functions,” <i>CoRR</i>, 2017.","chicago":"Bischl, Bernd, Jakob Richter, Jakob Bossek, Daniel Horn, Janek Thomas, and Michel Lang. “MlrMBO: A Modular Framework for Model-Based Optimization of Expensive Black-Box Functions.” <i>CoRR</i>, 2017.","short":"B. Bischl, J. Richter, J. Bossek, D. Horn, J. Thomas, M. Lang, CoRR (2017).","mla":"Bischl, Bernd, et al. “MlrMBO: A Modular Framework for Model-Based Optimization of Expensive Black-Box Functions.” <i>CoRR</i>, 2017.","ama":"Bischl B, Richter J, Bossek J, Horn D, Thomas J, Lang M. mlrMBO: A Modular Framework for Model-Based Optimization of Expensive Black-Box Functions. <i>CoRR</i>. Published online 2017.","bibtex":"@article{Bischl_Richter_Bossek_Horn_Thomas_Lang_2017, title={mlrMBO: A Modular Framework for Model-Based Optimization of Expensive Black-Box Functions}, journal={CoRR}, author={Bischl, Bernd and Richter, Jakob and Bossek, Jakob and Horn, Daniel and Thomas, Janek and Lang, Michel}, year={2017} }"},"date_created":"2023-11-14T15:58:51Z","type":"journal_article","department":[{"_id":"819"}],"status":"public","title":"mlrMBO: A Modular Framework for Model-Based Optimization of Expensive Black-Box Functions","year":"2017","author":[{"first_name":"Bernd","last_name":"Bischl","full_name":"Bischl, Bernd"},{"last_name":"Richter","first_name":"Jakob","full_name":"Richter, Jakob"},{"id":"102979","last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob"},{"full_name":"Horn, Daniel","first_name":"Daniel","last_name":"Horn"},{"full_name":"Thomas, Janek","first_name":"Janek","last_name":"Thomas"},{"first_name":"Michel","last_name":"Lang","full_name":"Lang, Michel"}],"date_updated":"2023-12-13T10:52:31Z","language":[{"iso":"eng"}],"_id":"48837","user_id":"102979"},{"year":"2016","title":"MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework","author":[{"last_name":"Blot","first_name":"A","full_name":"Blot, A"},{"full_name":"Hoos, H","first_name":"H","last_name":"Hoos"},{"first_name":"L","last_name":"Jourdan","full_name":"Jourdan, L"},{"first_name":"M","last_name":"Marmion","full_name":"Marmion, M"},{"id":"100740","full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike"}],"date_updated":"2023-10-16T13:37:50Z","intvolume":"     10079","language":[{"iso":"eng"}],"series_title":"LNTCS","doi":"10.1007/978-3-319-50349-3_3","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"}],"date_created":"2023-08-04T15:10:09Z","type":"conference","department":[{"_id":"34"},{"_id":"819"}],"status":"public","page":"32–47","_id":"46364","publisher":"Springer International Publishing","user_id":"15504","editor":[{"full_name":"et al. Joaquin, Vanschooren","last_name":"et al. Joaquin","first_name":"Vanschooren"}],"volume":10079,"citation":{"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>.","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} }","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>.","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>","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.","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>."},"place":"Cham"},{"department":[{"_id":"34"},{"_id":"819"}],"type":"book_chapter","date_created":"2023-08-04T15:09:14Z","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."}],"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","language":[{"iso":"eng"}],"date_updated":"2023-10-16T13:37:33Z","author":[{"full_name":"Rudolph, G","last_name":"Rudolph","first_name":"G"},{"full_name":"Schütze, O","last_name":"Schütze","first_name":"O"},{"id":"100740","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike"}],"publication_identifier":{"isbn":["978-3-319-31153-1"]},"title":"On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front","year":"2016","place":"Cham","citation":{"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>.","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>","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} }","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>","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.","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.","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>."},"editor":[{"full_name":"Squillero, G","last_name":"Squillero","first_name":"G"},{"full_name":"Burelli, P","first_name":"P","last_name":"Burelli"}],"user_id":"15504","_id":"46363","publisher":"Springer International Publishing","page":"42–55","status":"public"},{"type":"conference","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T15:16:02Z","place":"Edinburgh, Scotland","abstract":[{"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.","lang":"eng"}],"publication":"Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV)","citation":{"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>","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>.","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>.","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.","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>.","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>","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} }"},"user_id":"15504","doi":"10.1007/978-3-319-45823-6_90","page":"962–972","_id":"46369","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","publisher":"Springer","date_updated":"2023-10-16T13:39:42Z","title":"Towards Analyzing Multimodality of Multiobjective Landscapes","year":"2016","status":"public","author":[{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, 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é","last_name":"Deutz","full_name":"Deutz, André"},{"last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike","full_name":"Trautmann, Heike","id":"100740"},{"last_name":"Emmerich","first_name":"Michael","full_name":"Emmerich, Michael"}]},{"citation":{"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>","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} }","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>.","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.","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>.","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>","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>."},"publication":"Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation","abstract":[{"lang":"eng","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."}],"place":"Denver, CO, USA","date_created":"2023-08-04T15:14:06Z","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","publication_identifier":{"isbn":["978-1-4503-4206-3"]},"author":[{"last_name":"Kerschke","first_name":"Pascal","full_name":"Kerschke, Pascal"},{"full_name":"Preuss, Mike","first_name":"Mike","last_name":"Preuss"},{"full_name":"Wessing, Simon","first_name":"Simon","last_name":"Wessing"},{"id":"100740","orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike"}],"title":"Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models","year":"2016","status":"public","date_updated":"2023-10-16T13:38:47Z","language":[{"iso":"eng"}],"_id":"46367","page":"229–236","doi":"10.1145/2908812.2908845","user_id":"15504"},{"date_updated":"2023-10-16T13:40:21Z","intvolume":"        64","title":"Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results","year":"2016","status":"public","author":[{"full_name":"Rudolph, G","last_name":"Rudolph","first_name":"G"},{"full_name":"Schütze, O","first_name":"O","last_name":"Schütze"},{"first_name":"C","last_name":"Grimme","full_name":"Grimme, C"},{"full_name":"Domínguez-Medina, C","first_name":"C","last_name":"Domínguez-Medina"},{"full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","id":"100740"}],"user_id":"15504","doi":"10.1007/s10589-015-9815-8","volume":64,"page":"589–618","language":[{"iso":"eng"}],"_id":"46371","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"}],"publication":"Computational Optimization and Applications (Comput. Optim. Appl.)","issue":"2","citation":{"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>","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>.","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>.","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.","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>","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>.","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} }"},"type":"journal_article","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T15:17:48Z"},{"date_created":"2023-08-04T15:19:11Z","department":[{"_id":"34"},{"_id":"819"}],"type":"journal_article","citation":{"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>.","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>","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} }","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>","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>."},"publication":"Journal of Heuristics","issue":"3","abstract":[{"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.","lang":"eng"}],"_id":"46372","language":[{"iso":"eng"}],"page":"273–300","volume":22,"doi":"10.1007/s10732-016-9310-0","user_id":"15504","author":[{"last_name":"Schütze","first_name":"O","full_name":"Schütze, O"},{"first_name":"Hernandez VA","last_name":"Sosa","full_name":"Sosa, Hernandez VA"},{"id":"100740","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike"},{"first_name":"G","last_name":"Rudolph","full_name":"Rudolph, G"}],"year":"2016","title":"The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems","status":"public","intvolume":"        22","date_updated":"2023-10-16T13:40:43Z"},{"language":[{"iso":"eng"}],"_id":"46368","doi":"10.1109/CEC.2016.7748359","user_id":"15504","title":"The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems","year":"2016","status":"public","author":[{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"},{"full_name":"Trautmann, Heike","first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","id":"100740"}],"date_updated":"2023-10-16T13:39:06Z","place":"Vancouver, BC, Kanada","date_created":"2023-08-04T15:14:52Z","type":"conference","department":[{"_id":"34"},{"_id":"819"}],"publication":"Proceedings of the IEEE Congress on Evolutionary Computation (CEC)","citation":{"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>","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} }","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>.","short":"P. Kerschke, H. Trautmann, in: Proceedings of the IEEE Congress on Evolutionary Computation (CEC), Vancouver, BC, Kanada, 2016.","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>.","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>","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>."},"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."}]},{"language":[{"iso":"eng"}],"_id":"46370","page":"78–79","volume":5,"user_id":"15504","doi":"10.4230/DagRep.5.5.57","author":[{"full_name":"Neumann, F","last_name":"Neumann","first_name":"F"},{"id":"100740","full_name":"Trautmann, Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike"}],"title":"Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211)","status":"public","year":"2016","intvolume":"         5","date_updated":"2023-10-16T13:40:00Z","date_created":"2023-08-04T15:17:00Z","department":[{"_id":"34"},{"_id":"819"}],"type":"journal_article","citation":{"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>.","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} }","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>.","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>","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>.","short":"F. Neumann, H. Trautmann, Dagstuhl Reports 5 (2016) 78–79."},"publication":"Dagstuhl Reports","issue":"5","abstract":[{"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.","lang":"eng"}]}]