[{"user_id":"11871","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1712.05956"}],"_id":"6722","language":[{"iso":"eng"}],"date_updated":"2022-10-17T11:36:12Z","status":"public","title":"Overview of the Wikidata Vandalism Detection Task at WSDM Cup 2017","year":"2017","author":[{"id":"11871","full_name":"Heindorf, Stefan","first_name":"Stefan","orcid":"0000-0002-4525-6865","last_name":"Heindorf"},{"last_name":"Potthast","first_name":"Martin","full_name":"Potthast, Martin"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels","id":"107"},{"last_name":"Stein","first_name":"Benno","full_name":"Stein, Benno"}],"type":"conference","oa":"1","department":[{"_id":"66"}],"date_created":"2019-01-15T08:57:40Z","abstract":[{"text":"We report on the Wikidata vandalism detection task at the WSDM Cup 2017. The\r\ntask received five submissions for which this paper describes their evaluation\r\nand a comparison to state of the art baselines. Unlike previous work, we recast\r\nWikidata vandalism detection as an online learning problem, requiring\r\nparticipant software to predict vandalism in near real-time. The\r\nbest-performing approach achieves a ROC-AUC of 0.947 at a PR-AUC of 0.458. In\r\nparticular, this task was organized as a software submission task: to maximize\r\nreproducibility as well as to foster future research and development on this\r\ntask, the participants were asked to submit their working software to the TIRA\r\nexperimentation platform along with the source code for open source release.","lang":"eng"}],"publication":"WSDM Cup 2017 Notebook Papers","citation":{"ama":"Heindorf S, Potthast M, Engels G, Stein B. Overview of the Wikidata Vandalism Detection Task at WSDM Cup 2017. In: <i>WSDM Cup 2017 Notebook Papers</i>. ; 2017.","bibtex":"@inproceedings{Heindorf_Potthast_Engels_Stein_2017, title={Overview of the Wikidata Vandalism Detection Task at WSDM Cup 2017}, booktitle={WSDM Cup 2017 Notebook Papers}, author={Heindorf, Stefan and Potthast, Martin and Engels, Gregor and Stein, Benno}, year={2017} }","mla":"Heindorf, Stefan, et al. “Overview of the Wikidata Vandalism Detection Task at WSDM Cup 2017.” <i>WSDM Cup 2017 Notebook Papers</i>, 2017.","chicago":"Heindorf, Stefan, Martin Potthast, Gregor Engels, and Benno Stein. “Overview of the Wikidata Vandalism Detection Task at WSDM Cup 2017.” In <i>WSDM Cup 2017 Notebook Papers</i>, 2017.","short":"S. Heindorf, M. Potthast, G. Engels, B. Stein, in: WSDM Cup 2017 Notebook Papers, 2017.","apa":"Heindorf, S., Potthast, M., Engels, G., &#38; Stein, B. (2017). Overview of the Wikidata Vandalism Detection Task at WSDM Cup 2017. <i>WSDM Cup 2017 Notebook Papers</i>.","ieee":"S. Heindorf, M. Potthast, G. Engels, and B. Stein, “Overview of the Wikidata Vandalism Detection Task at WSDM Cup 2017,” 2017."}},{"date_created":"2022-10-15T19:14:01Z","external_id":{"arxiv":["1712.09528"]},"department":[{"_id":"66"}],"type":"preprint","citation":{"apa":"Potthast, M., Heindorf, S., &#38; Bast, H. (2017). Proceedings of the WSDM Cup 2017: Vandalism Detection and Triple Scoring. In <i>arXiv:1712.09528</i>.","ieee":"M. Potthast, S. Heindorf, and H. Bast, “Proceedings of the WSDM Cup 2017: Vandalism Detection and Triple Scoring,” <i>arXiv:1712.09528</i>. 2017.","chicago":"Potthast, Martin, Stefan Heindorf, and Hannah Bast. “Proceedings of the WSDM Cup 2017: Vandalism Detection and Triple Scoring.” <i>ArXiv:1712.09528</i>, 2017.","short":"M. Potthast, S. Heindorf, H. Bast, ArXiv:1712.09528 (2017).","mla":"Potthast, Martin, et al. “Proceedings of the WSDM Cup 2017: Vandalism Detection and Triple Scoring.” <i>ArXiv:1712.09528</i>, 2017.","ama":"Potthast M, Heindorf S, Bast H. Proceedings of the WSDM Cup 2017: Vandalism Detection and Triple Scoring. <i>arXiv:171209528</i>. Published online 2017.","bibtex":"@article{Potthast_Heindorf_Bast_2017, title={Proceedings of the WSDM Cup 2017: Vandalism Detection and Triple Scoring}, journal={arXiv:1712.09528}, author={Potthast, Martin and Heindorf, Stefan and Bast, Hannah}, year={2017} }"},"publication":"arXiv:1712.09528","abstract":[{"lang":"eng","text":"The WSDM Cup 2017 was a data mining challenge held in conjunction with the\r\n10th International Conference on Web Search and Data Mining (WSDM). It\r\naddressed key challenges of knowledge bases today: quality assurance and entity\r\nsearch. For quality assurance, we tackle the task of vandalism detection, based\r\non a dataset of more than 82 million user-contributed revisions of the Wikidata\r\nknowledge base, all of which annotated with regard to whether or not they are\r\nvandalism. For entity search, we tackle the task of triple scoring, using a\r\ndataset that comprises relevance scores for triples from type-like relations\r\nincluding occupation and country of citizenship, based on about 10,000 human\r\nrelevance judgements. For reproducibility sake, participants were asked to\r\nsubmit their software on TIRA, a cloud-based evaluation platform, and they were\r\nincentivized to share their approaches open source."}],"language":[{"iso":"eng"}],"_id":"33732","user_id":"11871","author":[{"full_name":"Potthast, Martin","first_name":"Martin","last_name":"Potthast"},{"first_name":"Stefan","last_name":"Heindorf","orcid":"0000-0002-4525-6865","full_name":"Heindorf, Stefan","id":"11871"},{"first_name":"Hannah","last_name":"Bast","full_name":"Bast, Hannah"}],"title":"Proceedings of the WSDM Cup 2017: Vandalism Detection and Triple Scoring","status":"public","year":"2017","date_updated":"2022-10-17T11:21:00Z"},{"language":[{"iso":"eng"}],"_id":"48305","publisher":"Association for Computational Linguistics","user_id":"15504","doi":"10.18653/v1/p17-2039","author":[{"first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning"},{"full_name":"Naderi, Nona","last_name":"Naderi","first_name":"Nona"},{"last_name":"Habernal","first_name":"Ivan","full_name":"Habernal, Ivan","id":"101881"},{"last_name":"Hou","first_name":"Yufang","full_name":"Hou, Yufang"},{"first_name":"Graeme","last_name":"Hirst","full_name":"Hirst, Graeme"},{"full_name":"Gurevych, Iryna","first_name":"Iryna","last_name":"Gurevych"},{"last_name":"Stein","first_name":"Benno","full_name":"Stein, Benno"}],"year":"2017","title":"Argumentation Quality Assessment: Theory vs. Practice","status":"public","publication_status":"published","date_updated":"2023-10-19T12:08:34Z","date_created":"2023-10-19T08:30:11Z","department":[{"_id":"34"},{"_id":"820"}],"type":"conference","citation":{"mla":"Wachsmuth, Henning, et al. “Argumentation Quality Assessment: Theory vs. Practice.” <i>Proceedings of the 55th Annual Meeting of the Association for          Computational Linguistics (Volume 2: Short Papers)</i>, Association for Computational Linguistics, 2017, doi:<a href=\"https://doi.org/10.18653/v1/p17-2039\">10.18653/v1/p17-2039</a>.","bibtex":"@inproceedings{Wachsmuth_Naderi_Habernal_Hou_Hirst_Gurevych_Stein_2017, title={Argumentation Quality Assessment: Theory vs. Practice}, DOI={<a href=\"https://doi.org/10.18653/v1/p17-2039\">10.18653/v1/p17-2039</a>}, booktitle={Proceedings of the 55th Annual Meeting of the Association for          Computational Linguistics (Volume 2: Short Papers)}, publisher={Association for Computational Linguistics}, author={Wachsmuth, Henning and Naderi, Nona and Habernal, Ivan and Hou, Yufang and Hirst, Graeme and Gurevych, Iryna and Stein, Benno}, year={2017} }","ama":"Wachsmuth H, Naderi N, Habernal I, et al. Argumentation Quality Assessment: Theory vs. Practice. In: <i>Proceedings of the 55th Annual Meeting of the Association for          Computational Linguistics (Volume 2: Short Papers)</i>. Association for Computational Linguistics; 2017. doi:<a href=\"https://doi.org/10.18653/v1/p17-2039\">10.18653/v1/p17-2039</a>","ieee":"H. Wachsmuth <i>et al.</i>, “Argumentation Quality Assessment: Theory vs. Practice,” 2017, doi: <a href=\"https://doi.org/10.18653/v1/p17-2039\">10.18653/v1/p17-2039</a>.","apa":"Wachsmuth, H., Naderi, N., Habernal, I., Hou, Y., Hirst, G., Gurevych, I., &#38; Stein, B. (2017). Argumentation Quality Assessment: Theory vs. Practice. <i>Proceedings of the 55th Annual Meeting of the Association for          Computational Linguistics (Volume 2: Short Papers)</i>. <a href=\"https://doi.org/10.18653/v1/p17-2039\">https://doi.org/10.18653/v1/p17-2039</a>","short":"H. Wachsmuth, N. Naderi, I. Habernal, Y. Hou, G. Hirst, I. Gurevych, B. Stein, in: Proceedings of the 55th Annual Meeting of the Association for          Computational Linguistics (Volume 2: Short Papers), Association for Computational Linguistics, 2017.","chicago":"Wachsmuth, Henning, Nona Naderi, Ivan Habernal, Yufang Hou, Graeme Hirst, Iryna Gurevych, and Benno Stein. “Argumentation Quality Assessment: Theory vs. Practice.” In <i>Proceedings of the 55th Annual Meeting of the Association for          Computational Linguistics (Volume 2: Short Papers)</i>. Association for Computational Linguistics, 2017. <a href=\"https://doi.org/10.18653/v1/p17-2039\">https://doi.org/10.18653/v1/p17-2039</a>."},"publication":"Proceedings of the 55th Annual Meeting of the Association for          Computational Linguistics (Volume 2: Short Papers)"},{"department":[{"_id":"34"},{"_id":"819"}],"type":"book_chapter","date_created":"2023-08-04T15:01:27Z","abstract":[{"lang":"eng","text":"In this chapter we present the adaptions of the recently proposed Directed Search method to the context of unconstrained parameter dependent multi-objective optimization problems (PMOPs). The new method, called 𝜆-DS, is capable of performing a movement both toward and along the solution set of a given differentiable PMOP. We first discuss the basic variants of the method that use gradient information and describe subsequently modifications that allow for a gradient free realization. Finally, we show that 𝜆-DS can be used to understand the behavior of stochastic local search within PMOPs to a certain extent which might be interesting for the development of future local search engines, or evolutionary strategies, for the treatment of such problems. We underline all our statements with several numerical results indicating the strength of the novel approach."}],"publication":"NEO 15","doi":"10.1007/978-3-319-44003-3_12","language":[{"iso":"eng"}],"date_updated":"2023-10-16T13:34:49Z","author":[{"last_name":"Adrián","first_name":"Sosa Hernández V","full_name":"Adrián, Sosa Hernández V"},{"full_name":"Lara, A","first_name":"A","last_name":"Lara"},{"orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike","id":"100740"},{"first_name":"G","last_name":"Rudolph","full_name":"Rudolph, G"},{"full_name":"Schütze, O","last_name":"Schütze","first_name":"O"}],"publication_identifier":{"isbn":["978-3-319-44003-3"]},"title":"The Directed Search Method for Unconstrained Parameter Dependent Multi-objective Optimization Problems","year":"2017","place":"Cham","citation":{"short":"S.H.V. Adrián, A. Lara, H. Trautmann, G. Rudolph, O. Schütze, in: O. Schütze, L. Trujillo, P. Legrand, Y. Maldonado (Eds.), NEO 15, Springer International Publishing, Cham, 2017, pp. 281–330.","chicago":"Adrián, Sosa Hernández V, A Lara, Heike Trautmann, G Rudolph, and O Schütze. “The Directed Search Method for Unconstrained Parameter Dependent Multi-Objective Optimization Problems.” In <i>NEO 15</i>, edited by O Schütze, L Trujillo, P Legrand, and Y Maldonado, 281–330. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-44003-3_12\">https://doi.org/10.1007/978-3-319-44003-3_12</a>.","ieee":"S. H. V. Adrián, A. Lara, H. Trautmann, G. Rudolph, and O. Schütze, “The Directed Search Method for Unconstrained Parameter Dependent Multi-objective Optimization Problems,” in <i>NEO 15</i>, O. Schütze, L. Trujillo, P. Legrand, and Y. Maldonado, Eds. Cham: Springer International Publishing, 2017, pp. 281–330.","apa":"Adrián, S. H. V., Lara, A., Trautmann, H., Rudolph, G., &#38; Schütze, O. (2017). The Directed Search Method for Unconstrained Parameter Dependent Multi-objective Optimization Problems. In O. Schütze, L. Trujillo, P. Legrand, &#38; Y. Maldonado (Eds.), <i>NEO 15</i> (pp. 281–330). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-44003-3_12\">https://doi.org/10.1007/978-3-319-44003-3_12</a>","bibtex":"@inbook{Adrián_Lara_Trautmann_Rudolph_Schütze_2017, place={Cham}, title={The Directed Search Method for Unconstrained Parameter Dependent Multi-objective Optimization Problems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-44003-3_12\">10.1007/978-3-319-44003-3_12</a>}, booktitle={NEO 15}, publisher={Springer International Publishing}, author={Adrián, Sosa Hernández V and Lara, A and Trautmann, Heike and Rudolph, G and Schütze, O}, editor={Schütze, O and Trujillo, L and Legrand, P and Maldonado, Y}, year={2017}, pages={281–330} }","ama":"Adrián SHV, Lara A, Trautmann H, Rudolph G, Schütze O. The Directed Search Method for Unconstrained Parameter Dependent Multi-objective Optimization Problems. In: Schütze O, Trujillo L, Legrand P, Maldonado Y, eds. <i>NEO 15</i>. Springer International Publishing; 2017:281–330. doi:<a href=\"https://doi.org/10.1007/978-3-319-44003-3_12\">10.1007/978-3-319-44003-3_12</a>","mla":"Adrián, Sosa Hernández V., et al. “The Directed Search Method for Unconstrained Parameter Dependent Multi-Objective Optimization Problems.” <i>NEO 15</i>, edited by O Schütze et al., Springer International Publishing, 2017, pp. 281–330, doi:<a href=\"https://doi.org/10.1007/978-3-319-44003-3_12\">10.1007/978-3-319-44003-3_12</a>."},"editor":[{"full_name":"Schütze, O","last_name":"Schütze","first_name":"O"},{"full_name":"Trujillo, L","first_name":"L","last_name":"Trujillo"},{"full_name":"Legrand, P","last_name":"Legrand","first_name":"P"},{"full_name":"Maldonado, Y","first_name":"Y","last_name":"Maldonado"}],"user_id":"15504","publisher":"Springer International Publishing","_id":"46355","page":"281–330","status":"public"},{"author":[{"full_name":"Carnein, Matthias","last_name":"Carnein","first_name":"Matthias"},{"full_name":"Heuchert, Markus","last_name":"Heuchert","first_name":"Markus"},{"last_name":"Homann","first_name":"Leschek","full_name":"Homann, Leschek"},{"id":"100740","full_name":"Trautmann, Heike","first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann"},{"last_name":"Vossen","first_name":"Gottfried","full_name":"Vossen, Gottfried"},{"last_name":"Becker","first_name":"Jörg","full_name":"Becker, Jörg"},{"full_name":"Kraume, Karsten","first_name":"Karsten","last_name":"Kraume"}],"publication_identifier":{"isbn":["978-3-319-70625-2"]},"title":"Towards Efficient and Informative Omni-Channel Customer Relationship Management","year":"2017","intvolume":"     10651","date_updated":"2023-10-16T13:36:40Z","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-70625-2_7","publication":"Proceedings of the 36$^th$ International Conference on Conceptual Modeling (ER’17)","abstract":[{"text":"Nowadays customers expect a seamless interaction with companies throughout all available communication channels. However, many companies rely on different software solutions to handle each channel, which leads to heterogeneous IT infrastructures and isolated data sources. Omni-Channel CRM is a holistic approach towards a unified view on the customer across all channels. This paper introduces three case studies which demonstrate challenges of omni-channel CRM and the value it can provide. The first case study shows how to integrate and visualise data from different sources which can support operational and strategic decision. In the second case study, a social media analysis approach is discussed which provides benefits by offering reports of service performance across channels. The third case study applies customer segmentation to an online fashion retailer in order to identify customer profiles.","lang":"eng"}],"date_created":"2023-08-04T15:05:43Z","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","status":"public","_id":"46360","publisher":"Springer International Publishing","page":"69–78","editor":[{"last_name":"de Cesare","first_name":"Sergio","full_name":"de Cesare, Sergio"},{"full_name":"Ulrich, Frank","first_name":"Frank","last_name":"Ulrich"}],"volume":10651,"user_id":"15504","citation":{"apa":"Carnein, M., Heuchert, M., Homann, L., Trautmann, H., Vossen, G., Becker, J., &#38; Kraume, K. (2017). Towards Efficient and Informative Omni-Channel Customer Relationship Management. In S. de Cesare &#38; F. Ulrich (Eds.), <i>Proceedings of the 36$^th$ International Conference on Conceptual Modeling (ER’17)</i> (Vol. 10651, pp. 69–78). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-70625-2_7\">https://doi.org/10.1007/978-3-319-70625-2_7</a>","ieee":"M. Carnein <i>et al.</i>, “Towards Efficient and Informative Omni-Channel Customer Relationship Management,” in <i>Proceedings of the 36$^th$ International Conference on Conceptual Modeling (ER’17)</i>, 2017, vol. 10651, pp. 69–78, doi: <a href=\"https://doi.org/10.1007/978-3-319-70625-2_7\">10.1007/978-3-319-70625-2_7</a>.","short":"M. Carnein, M. Heuchert, L. Homann, H. Trautmann, G. Vossen, J. Becker, K. Kraume, 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. 69–78.","chicago":"Carnein, Matthias, Markus Heuchert, Leschek Homann, Heike Trautmann, Gottfried Vossen, Jörg Becker, and Karsten Kraume. “Towards Efficient and Informative Omni-Channel Customer Relationship Management.” In <i>Proceedings of the 36$^th$ International Conference on Conceptual Modeling (ER’17)</i>, edited by Sergio de Cesare and Frank Ulrich, 10651:69–78. Lecture Notes in Computer Science. Valencia, Spain: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-70625-2_7\">https://doi.org/10.1007/978-3-319-70625-2_7</a>.","mla":"Carnein, Matthias, et al. “Towards Efficient and Informative Omni-Channel Customer Relationship Management.” <i>Proceedings of the 36$^th$ International Conference on Conceptual Modeling (ER’17)</i>, edited by Sergio de Cesare and Frank Ulrich, vol. 10651, Springer International Publishing, 2017, pp. 69–78, doi:<a href=\"https://doi.org/10.1007/978-3-319-70625-2_7\">10.1007/978-3-319-70625-2_7</a>.","ama":"Carnein M, Heuchert M, Homann L, et al. Towards Efficient and Informative Omni-Channel Customer Relationship Management. In: de Cesare S, Ulrich F, eds. <i>Proceedings of the 36$^th$ International Conference on Conceptual Modeling (ER’17)</i>. Vol 10651. Lecture Notes in Computer Science. Springer International Publishing; 2017:69–78. doi:<a href=\"https://doi.org/10.1007/978-3-319-70625-2_7\">10.1007/978-3-319-70625-2_7</a>","bibtex":"@inproceedings{Carnein_Heuchert_Homann_Trautmann_Vossen_Becker_Kraume_2017, place={Valencia, Spain}, series={Lecture Notes in Computer Science}, title={Towards Efficient and Informative Omni-Channel Customer Relationship Management}, volume={10651}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-70625-2_7\">10.1007/978-3-319-70625-2_7</a>}, booktitle={Proceedings of the 36$^th$ International Conference on Conceptual Modeling (ER’17)}, publisher={Springer International Publishing}, author={Carnein, Matthias and Heuchert, Markus and Homann, Leschek and Trautmann, Heike and Vossen, Gottfried and Becker, Jörg and Kraume, Karsten}, editor={de Cesare, Sergio and Ulrich, Frank}, year={2017}, pages={69–78}, collection={Lecture Notes in Computer Science} }"},"place":"Valencia, Spain"},{"place":"Stuttgart, Germany","citation":{"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.","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.","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.","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."},"page":"33–40","_id":"46361","publisher":"Gesellschaft für Informatik","user_id":"15504","editor":[{"full_name":"Ritter, Norbert","first_name":"Norbert","last_name":"Ritter"},{"full_name":"Schwarz, Holger","last_name":"Schwarz","first_name":"Holger"},{"full_name":"Klettke, Meike","first_name":"Meike","last_name":"Klettke"},{"last_name":"Thor","first_name":"Andreas","full_name":"Thor, Andreas"},{"full_name":"Kopp, Oliver","last_name":"Kopp","first_name":"Oliver"},{"last_name":"Bernhard","first_name":"Matthias Wieland","full_name":"Bernhard, Matthias Wieland"}],"volume":"P-266","status":"public","date_created":"2023-08-04T15:06:41Z","type":"conference","department":[{"_id":"34"},{"_id":"819"}],"publication":"Proceedings of the 17$^th$ Conference on Database Systems for Business, Technology, and Web (BTW ’17)","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."}],"series_title":"Lecture Notes in Informatics (LNI)","language":[{"iso":"eng"}],"year":"2017","title":"Customer Service in Social Media — An Empirical Study of the Airline Industry","publication_identifier":{"issn":["978-3-88579-660-2"]},"author":[{"first_name":"Matthias","last_name":"Carnein","full_name":"Carnein, Matthias"},{"first_name":"Leschek","last_name":"Homann","full_name":"Homann, Leschek"},{"id":"100740","last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike","full_name":"Trautmann, Heike"},{"first_name":"Gottfried","last_name":"Vossen","full_name":"Vossen, Gottfried"},{"full_name":"Kraume, Karsten","last_name":"Kraume","first_name":"Karsten"}],"date_updated":"2023-10-16T13:36:58Z"},{"date_updated":"2023-10-16T13:35:17Z","author":[{"first_name":"L","last_name":"Li","full_name":"Li, L"},{"full_name":"Yevseyeva, I","last_name":"Yevseyeva","first_name":"I"},{"full_name":"Basto-Fernandes, V","first_name":"V","last_name":"Basto-Fernandes"},{"first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","full_name":"Trautmann, Heike","id":"100740"},{"first_name":"N","last_name":"Jing","full_name":"Jing, N"},{"full_name":"Emmerich, M","last_name":"Emmerich","first_name":"M"}],"publication_identifier":{"isbn":["978-3-319-54157-0"]},"year":"2017","title":"Building and Using an Ontology of Preference-Based Multiobjective Evolutionary Algorithms","doi":"10.1007/978-3-319-54157-0_28","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","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."}],"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"},{"last_name":"Rudolph","first_name":"G","full_name":"Rudolph, G"},{"first_name":"K","last_name":"Klamroth","full_name":"Klamroth, K"},{"full_name":"Schütze, O","first_name":"O","last_name":"Schütze"},{"last_name":"Wiecek","first_name":"M","full_name":"Wiecek, M"},{"first_name":"Y","last_name":"Jin","full_name":"Jin, Y"},{"full_name":"Grimme, C","last_name":"Grimme","first_name":"C"}],"user_id":"15504","publisher":"Springer International Publishing","_id":"46356","page":"406–421","citation":{"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>","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>","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>.","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."},"place":"Cham"},{"date_created":"2023-08-04T15:03:17Z","department":[{"_id":"34"},{"_id":"819"}],"type":"book_chapter","publication":"Evolutionary Multi-Criterion Optimization: 9$^th$ International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings","abstract":[{"lang":"eng","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."}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-54157-0_42","publication_identifier":{"isbn":["978-3-319-54157-0"]},"author":[{"first_name":"K","last_name":"Tierney","full_name":"Tierney, K"},{"full_name":"Handali, J","first_name":"J","last_name":"Handali"},{"last_name":"Grimme","first_name":"C","full_name":"Grimme, C"},{"id":"100740","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike"}],"year":"2017","title":"Multi-objective Optimization for Liner Shipping Fleet Repositioning","date_updated":"2023-10-16T13:35:41Z","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>"},"_id":"46357","publisher":"Springer International Publishing","page":"622–638","editor":[{"last_name":"Trautmann","first_name":"H","full_name":"Trautmann, H"},{"full_name":"Rudolph, G","last_name":"Rudolph","first_name":"G"},{"last_name":"Klamroth","first_name":"K","full_name":"Klamroth, K"},{"last_name":"Schütze","first_name":"O","full_name":"Schütze, O"},{"full_name":"Wiecek, M","last_name":"Wiecek","first_name":"M"},{"first_name":"Y","last_name":"Jin","full_name":"Jin, Y"},{"full_name":"Grimme, C","last_name":"Grimme","first_name":"C"}],"user_id":"15504","status":"public"},{"page":"79–88","_id":"46359","publisher":"Springer International Publishing","user_id":"15504","editor":[{"full_name":"de Cesare, Sergio","first_name":"Sergio","last_name":"de Cesare"},{"full_name":"Ulrich, Frank","last_name":"Ulrich","first_name":"Frank"}],"status":"public","place":"Valencia, Spain","citation":{"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>","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.","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>.","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>"},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-70625-2_8","year":"2017","title":"Stream Clustering of Chat Messages with Applications to Twitch Streams","publication_identifier":{"isbn":["978-3-319-70625-2"]},"author":[{"full_name":"Carnein, Matthias","first_name":"Matthias","last_name":"Carnein"},{"last_name":"Assenmacher","first_name":"Dennis","full_name":"Assenmacher, Dennis"},{"id":"100740","full_name":"Trautmann, Heike","first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann"}],"date_updated":"2023-10-16T13:36:23Z","date_created":"2023-08-04T15:04:57Z","type":"conference","department":[{"_id":"34"},{"_id":"819"}],"publication":"Proceedings of the 36$^th$ International Conference on Conceptual Modeling (ER’17)","abstract":[{"lang":"eng","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."}]},{"type":"journal_article","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T15:07:56Z","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"}],"publication":"Big Data","issue":"4","citation":{"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>.","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>","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} }","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."},"doi":"10.1089/big.2017.0044","user_id":"15504","volume":5,"page":"279–293","language":[{"iso":"eng"}],"_id":"46362","date_updated":"2023-10-16T13:37:14Z","intvolume":"         5","title":"Social Bots: Human-Like by Means of Human Control?","status":"public","year":"2017","author":[{"full_name":"Grimme, C","first_name":"C","last_name":"Grimme"},{"full_name":"Preuss, M","first_name":"M","last_name":"Preuss"},{"first_name":"L","last_name":"Adam","full_name":"Adam, L"},{"id":"100740","full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann"}]},{"page":"361–365","_id":"46358","language":[{"iso":"eng"}],"user_id":"15504","doi":"10.1145/3075564.3078887","year":"2017","title":"An Empirical Comparison of Stream Clustering Algorithms","status":"public","publication_identifier":{"isbn":["978-1-4503-4487-6/17/05"]},"author":[{"full_name":"Carnein, Matthias","first_name":"Matthias","last_name":"Carnein"},{"last_name":"Assenmacher","first_name":"Dennis","full_name":"Assenmacher, Dennis"},{"id":"100740","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike"}],"date_updated":"2023-10-16T13:35:59Z","date_created":"2023-08-04T15:04:09Z","place":"Siena, Italy","type":"conference","department":[{"_id":"34"},{"_id":"819"}],"publication":"Proceedings of the ACM International Conference on Computing Frontiers (CF ’17)","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>","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>.","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.","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>"},"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."}]},{"place":"New York, NY, USA","citation":{"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} }","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>.","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>","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>."},"user_id":"102979","page":"1187–1193","publisher":"Association for Computing Machinery","_id":"48863","status":"public","keyword":["evolutionary optimization","software-tools"],"type":"conference","department":[{"_id":"819"}],"date_created":"2023-11-14T15:58:55Z","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","publication":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","doi":"10.1145/3067695.3082470","language":[{"iso":"eng"}],"series_title":"GECCO ’17","date_updated":"2023-12-13T10:45:05Z","publication_status":"published","title":"Ecr 2.0: A Modular Framework for Evolutionary Computation in R","year":"2017","author":[{"id":"102979","first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob"}],"publication_identifier":{"isbn":["978-1-4503-4939-0"]}},{"department":[{"_id":"819"}],"keyword":["Convergence","Encoding","Euclidean distance","Evolutionary computation","Heating systems","Optimization","Standards"],"type":"conference","date_created":"2023-11-14T15:58:54Z","abstract":[{"lang":"eng","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."}],"extern":"1","citation":{"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>.","short":"J. Bossek, C. Grimme, in: 2017 IEEE Symposium Series on Computational Intelligence (SSCI), 2017, pp. 1–8.","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>.","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>"},"publication":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","doi":"10.1109/SSCI.2017.8285183","user_id":"102979","language":[{"iso":"eng"}],"_id":"48857","page":"1–8","date_updated":"2023-12-13T10:44:28Z","publication_status":"published","author":[{"id":"102979","full_name":"Bossek, Jakob","last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668"},{"first_name":"Christian","last_name":"Grimme","full_name":"Grimme, Christian"}],"status":"public","title":"A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem","year":"2017"},{"citation":{"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>.","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>","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} }","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>","short":"J. Bossek, C. Grimme, in: 2017 IEEE Symposium Series on Computational Intelligence (SSCI), 2017, pp. 1–8.","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>."},"publication":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","extern":"1","abstract":[{"lang":"eng","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."}],"date_created":"2023-11-14T15:58:54Z","department":[{"_id":"819"}],"type":"conference","keyword":["Evolutionary computation","Processor scheduling","Schedules","Scheduling","Sociology","Standards","Statistics"],"author":[{"last_name":"Bossek","orcid":"0000-0002-4121-4668","first_name":"Jakob","full_name":"Bossek, Jakob","id":"102979"},{"full_name":"Grimme, Christian","last_name":"Grimme","first_name":"Christian"}],"title":"An Extended Mutation-Based Priority-Rule Integration Concept for Multi-Objective Machine Scheduling","year":"2017","status":"public","publication_status":"published","date_updated":"2023-12-13T10:44:36Z","language":[{"iso":"eng"}],"_id":"48856","page":"1–8","user_id":"102979","doi":"10.1109/SSCI.2017.8285224"},{"citation":{"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>.","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>","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>.","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>","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} }","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>."},"publication":"Journal of Open Source Software","issue":"17","abstract":[{"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","lang":"eng"}],"date_created":"2023-11-14T15:58:55Z","department":[{"_id":"819"}],"type":"journal_article","publication_identifier":{"issn":["2475-9066"]},"author":[{"full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","first_name":"Jakob","last_name":"Bossek","id":"102979"}],"title":"mcMST: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem","year":"2017","status":"public","intvolume":"         2","date_updated":"2023-12-13T10:52:04Z","language":[{"iso":"eng"}],"_id":"48864","page":"374","volume":2,"user_id":"102979","doi":"10.21105/joss.00374"},{"publication":"The R Journal","issue":"1","citation":{"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} }","mla":"Bossek, Jakob. “Smoof: Single- and Multi-Objective Optimization Test Functions.” <i>The R Journal</i>, vol. 9, no. 1, 2017, pp. 103–113.","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.","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."},"type":"journal_article","department":[{"_id":"819"}],"date_created":"2023-11-14T15:58:56Z","date_updated":"2023-12-13T10:51:57Z","intvolume":"         9","title":"Smoof: Single- and Multi-Objective Optimization Test Functions","year":"2017","status":"public","publication_identifier":{"issn":["2073-4859"]},"author":[{"id":"102979","full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob"}],"user_id":"102979","volume":9,"page":"103–113","_id":"48865","language":[{"iso":"eng"}]},{"publication":"CoRR","citation":{"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.","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>.","short":"B. Bischl, J. Richter, J. Bossek, D. Horn, J. Thomas, M. Lang, CoRR (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.","mla":"Bischl, Bernd, et al. “MlrMBO: A Modular Framework for Model-Based Optimization of Expensive Black-Box Functions.” <i>CoRR</i>, 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} }","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."},"date_created":"2023-11-14T15:58:51Z","type":"journal_article","department":[{"_id":"819"}],"status":"public","year":"2017","title":"mlrMBO: A Modular Framework for Model-Based Optimization of Expensive Black-Box Functions","author":[{"first_name":"Bernd","last_name":"Bischl","full_name":"Bischl, Bernd"},{"last_name":"Richter","first_name":"Jakob","full_name":"Richter, Jakob"},{"id":"102979","full_name":"Bossek, Jakob","first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668"},{"full_name":"Horn, Daniel","last_name":"Horn","first_name":"Daniel"},{"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","_id":"48837","language":[{"iso":"eng"}],"user_id":"102979"},{"publication":"WSDM","citation":{"bibtex":"@inproceedings{Heindorf_Potthast_Bast_Buchhold_Haussmann_2017, title={WSDM Cup 2017: Vandalism Detection and Triple Scoring}, DOI={<a href=\"https://doi.org/10.1145/3018661.3022762\">10.1145/3018661.3022762</a>}, booktitle={WSDM}, publisher={ACM}, author={Heindorf, Stefan and Potthast, Martin and Bast, Hannah and Buchhold, Björn and Haussmann, Elmar}, year={2017}, pages={827–828} }","ama":"Heindorf S, Potthast M, Bast H, Buchhold B, Haussmann E. WSDM Cup 2017: Vandalism Detection and Triple Scoring. In: <i>WSDM</i>. ACM; 2017:827-828. doi:<a href=\"https://doi.org/10.1145/3018661.3022762\">10.1145/3018661.3022762</a>","mla":"Heindorf, Stefan, et al. “WSDM Cup 2017: Vandalism Detection and Triple Scoring.” <i>WSDM</i>, ACM, 2017, pp. 827–28, doi:<a href=\"https://doi.org/10.1145/3018661.3022762\">10.1145/3018661.3022762</a>.","chicago":"Heindorf, Stefan, Martin Potthast, Hannah Bast, Björn Buchhold, and Elmar Haussmann. “WSDM Cup 2017: Vandalism Detection and Triple Scoring.” In <i>WSDM</i>, 827–28. ACM, 2017. <a href=\"https://doi.org/10.1145/3018661.3022762\">https://doi.org/10.1145/3018661.3022762</a>.","short":"S. Heindorf, M. Potthast, H. Bast, B. Buchhold, E. Haussmann, in: WSDM, ACM, 2017, pp. 827–828.","ieee":"S. Heindorf, M. Potthast, H. Bast, B. Buchhold, and E. Haussmann, “WSDM Cup 2017: Vandalism Detection and Triple Scoring,” in <i>WSDM</i>, 2017, pp. 827–828, doi: <a href=\"https://doi.org/10.1145/3018661.3022762\">10.1145/3018661.3022762</a>.","apa":"Heindorf, S., Potthast, M., Bast, H., Buchhold, B., &#38; Haussmann, E. (2017). WSDM Cup 2017: Vandalism Detection and Triple Scoring. <i>WSDM</i>, 827–828. <a href=\"https://doi.org/10.1145/3018661.3022762\">https://doi.org/10.1145/3018661.3022762</a>"},"date_created":"2019-01-15T08:54:23Z","type":"conference","department":[{"_id":"66"}],"oa":"1","status":"public","title":"WSDM Cup 2017: Vandalism Detection and Triple Scoring","year":"2017","author":[{"id":"11871","full_name":"Heindorf, Stefan","last_name":"Heindorf","orcid":"0000-0002-4525-6865","first_name":"Stefan"},{"full_name":"Potthast, Martin","last_name":"Potthast","first_name":"Martin"},{"full_name":"Bast, Hannah","first_name":"Hannah","last_name":"Bast"},{"last_name":"Buchhold","first_name":"Björn","full_name":"Buchhold, Björn"},{"last_name":"Haussmann","first_name":"Elmar","full_name":"Haussmann, Elmar"}],"date_updated":"2024-05-26T19:15:24Z","main_file_link":[{"open_access":"1","url":"https://cs.uni-paderborn.de/fileadmin/informatik/fg/dbis/Publikationen/2017/heindorf2017_WSDM.pdf"}],"page":"827-828","_id":"6721","publisher":"ACM","language":[{"iso":"eng"}],"user_id":"11871","doi":"10.1145/3018661.3022762"},{"date_created":"2023-09-22T12:50:32Z","department":[{"_id":"34"},{"_id":"858"}],"type":"conference","citation":{"bibtex":"@inproceedings{Derr_Bugiel_Fahl_Acar_Backes_2017, title={Keep me Updated: An Empirical Study of Third-Party Library Updatability on Android}, DOI={<a href=\"https://doi.org/10.1145/3133956.3134059\">10.1145/3133956.3134059</a>}, booktitle={Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security}, publisher={ACM}, author={Derr, Erik and Bugiel, Sven and Fahl, Sascha and Acar, Yasemin and Backes, Michael}, year={2017} }","ama":"Derr E, Bugiel S, Fahl S, Acar Y, Backes M. Keep me Updated: An Empirical Study of Third-Party Library Updatability on Android. In: <i>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</i>. ACM; 2017. doi:<a href=\"https://doi.org/10.1145/3133956.3134059\">10.1145/3133956.3134059</a>","mla":"Derr, Erik, et al. “Keep Me Updated: An Empirical Study of Third-Party Library Updatability on Android.” <i>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</i>, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3133956.3134059\">10.1145/3133956.3134059</a>.","chicago":"Derr, Erik, Sven Bugiel, Sascha Fahl, Yasemin Acar, and Michael Backes. “Keep Me Updated: An Empirical Study of Third-Party Library Updatability on Android.” In <i>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3133956.3134059\">https://doi.org/10.1145/3133956.3134059</a>.","short":"E. Derr, S. Bugiel, S. Fahl, Y. Acar, M. Backes, in: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM, 2017.","ieee":"E. Derr, S. Bugiel, S. Fahl, Y. Acar, and M. Backes, “Keep me Updated: An Empirical Study of Third-Party Library Updatability on Android,” 2017, doi: <a href=\"https://doi.org/10.1145/3133956.3134059\">10.1145/3133956.3134059</a>.","apa":"Derr, E., Bugiel, S., Fahl, S., Acar, Y., &#38; Backes, M. (2017). Keep me Updated: An Empirical Study of Third-Party Library Updatability on Android. <i>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</i>. <a href=\"https://doi.org/10.1145/3133956.3134059\">https://doi.org/10.1145/3133956.3134059</a>"},"publication":"Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security","extern":"1","_id":"47249","publisher":"ACM","language":[{"iso":"eng"}],"doi":"10.1145/3133956.3134059","user_id":"14931","author":[{"last_name":"Derr","first_name":"Erik","full_name":"Derr, Erik"},{"first_name":"Sven","last_name":"Bugiel","full_name":"Bugiel, Sven"},{"full_name":"Fahl, Sascha","last_name":"Fahl","first_name":"Sascha"},{"id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin","last_name":"Acar"},{"last_name":"Backes","first_name":"Michael","full_name":"Backes, Michael"}],"title":"Keep me Updated: An Empirical Study of Third-Party Library Updatability on Android","status":"public","year":"2017","date_updated":"2024-06-05T13:09:19Z","publication_status":"published"},{"extern":"1","publication":"IEEE Secur. Priv.","issue":"2","citation":{"ieee":"Y. Acar, M. Backes, S. Fahl, D. Kim, M. L. Mazurek, and C. Stransky, “How Internet Resources Might Be Helping You Develop Faster but Less Securely,” <i>IEEE Secur. Priv.</i>, vol. 15, no. 2, pp. 50–60, 2017, doi: <a href=\"https://doi.org/10.1109/MSP.2017.24\">10.1109/MSP.2017.24</a>.","apa":"Acar, Y., Backes, M., Fahl, S., Kim, D., Mazurek, M. L., &#38; Stransky, C. (2017). How Internet Resources Might Be Helping You Develop Faster but Less Securely. <i>IEEE Secur. Priv.</i>, <i>15</i>(2), 50–60. <a href=\"https://doi.org/10.1109/MSP.2017.24\">https://doi.org/10.1109/MSP.2017.24</a>","chicago":"Acar, Yasemin, Michael Backes, Sascha Fahl, Doowon Kim, Michelle L. Mazurek, and Christian Stransky. “How Internet Resources Might Be Helping You Develop Faster but Less Securely.” <i>IEEE Secur. Priv.</i> 15, no. 2 (2017): 50–60. <a href=\"https://doi.org/10.1109/MSP.2017.24\">https://doi.org/10.1109/MSP.2017.24</a>.","short":"Y. Acar, M. Backes, S. Fahl, D. Kim, M.L. Mazurek, C. Stransky, IEEE Secur. Priv. 15 (2017) 50–60.","mla":"Acar, Yasemin, et al. “How Internet Resources Might Be Helping You Develop Faster but Less Securely.” <i>IEEE Secur. Priv.</i>, vol. 15, no. 2, 2017, pp. 50–60, doi:<a href=\"https://doi.org/10.1109/MSP.2017.24\">10.1109/MSP.2017.24</a>.","bibtex":"@article{Acar_Backes_Fahl_Kim_Mazurek_Stransky_2017, title={How Internet Resources Might Be Helping You Develop Faster but Less Securely}, volume={15}, DOI={<a href=\"https://doi.org/10.1109/MSP.2017.24\">10.1109/MSP.2017.24</a>}, number={2}, journal={IEEE Secur. Priv.}, author={Acar, Yasemin and Backes, Michael and Fahl, Sascha and Kim, Doowon and Mazurek, Michelle L. and Stransky, Christian}, year={2017}, pages={50–60} }","ama":"Acar Y, Backes M, Fahl S, Kim D, Mazurek ML, Stransky C. How Internet Resources Might Be Helping You Develop Faster but Less Securely. <i>IEEE Secur Priv</i>. 2017;15(2):50–60. doi:<a href=\"https://doi.org/10.1109/MSP.2017.24\">10.1109/MSP.2017.24</a>"},"type":"journal_article","department":[{"_id":"34"},{"_id":"858"}],"date_created":"2023-09-22T13:39:01Z","date_updated":"2024-06-05T13:09:42Z","intvolume":"        15","year":"2017","title":"How Internet Resources Might Be Helping You Develop Faster but Less Securely","status":"public","author":[{"id":"94636","first_name":"Yasemin","last_name":"Acar","full_name":"Acar, Yasemin"},{"last_name":"Backes","first_name":"Michael","full_name":"Backes, Michael"},{"last_name":"Fahl","first_name":"Sascha","full_name":"Fahl, Sascha"},{"full_name":"Kim, Doowon","first_name":"Doowon","last_name":"Kim"},{"first_name":"Michelle L.","last_name":"Mazurek","full_name":"Mazurek, Michelle L."},{"first_name":"Christian","last_name":"Stransky","full_name":"Stransky, Christian"}],"user_id":"14931","doi":"10.1109/MSP.2017.24","volume":15,"page":"50–60","_id":"47309","language":[{"iso":"eng"}]}]