[{"supervisor":[{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"citation":{"mla":"König, Jürgen. <i>On the Membership and Correctness Problem for State Serializability and Value Opacity</i>. 2023.","bibtex":"@book{König_2023, title={On the Membership and Correctness Problem for State Serializability and Value Opacity}, author={König, Jürgen}, year={2023} }","ama":"König J. <i>On the Membership and Correctness Problem for State Serializability and Value Opacity</i>.; 2023.","ieee":"J. König, <i>On the Membership and Correctness Problem for State Serializability and Value Opacity</i>. 2023.","apa":"König, J. (2023). <i>On the Membership and Correctness Problem for State Serializability and Value Opacity</i>.","chicago":"König, Jürgen. <i>On the Membership and Correctness Problem for State Serializability and Value Opacity</i>, 2023.","short":"J. König, On the Membership and Correctness Problem for State Serializability and Value Opacity, 2023."},"project":[{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B3: SFB 901 - Subproject B3","_id":"11"}],"date_created":"2023-10-06T12:41:35Z","type":"dissertation","department":[{"_id":"77"}],"title":"On the Membership and Correctness Problem for State Serializability and Value Opacity","year":"2023","status":"public","author":[{"last_name":"König","first_name":"Jürgen","full_name":"König, Jürgen"}],"date_updated":"2023-10-06T12:41:42Z","_id":"47833","language":[{"iso":"eng"}],"user_id":"15504"},{"oa":"1","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"9","grant_number":"160364472","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)"}],"file_date_updated":"2024-04-30T12:34:35Z","citation":{"bibtex":"@article{Kersting_Maoro_Geierhos_2023, title={Towards comparable ratings: Exploring bias in German physician reviews}, volume={148}, DOI={<a href=\"https://doi.org/10.1016/j.datak.2023.102235\">10.1016/j.datak.2023.102235</a>}, number={102235}, journal={Data &#38; Knowledge Engineering}, publisher={Elsevier}, author={Kersting, Joschka and Maoro, Falk and Geierhos, Michaela}, year={2023} }","ama":"Kersting J, Maoro F, Geierhos M. Towards comparable ratings: Exploring bias in German physician reviews. <i>Data &#38; Knowledge Engineering</i>. 2023;148. doi:<a href=\"https://doi.org/10.1016/j.datak.2023.102235\">10.1016/j.datak.2023.102235</a>","mla":"Kersting, Joschka, et al. “Towards Comparable Ratings: Exploring Bias in German Physician Reviews.” <i>Data &#38; Knowledge Engineering</i>, vol. 148, 102235, Elsevier, 2023, doi:<a href=\"https://doi.org/10.1016/j.datak.2023.102235\">10.1016/j.datak.2023.102235</a>.","short":"J. Kersting, F. Maoro, M. Geierhos, Data &#38; Knowledge Engineering 148 (2023).","chicago":"Kersting, Joschka, Falk Maoro, and Michaela Geierhos. “Towards Comparable Ratings: Exploring Bias in German Physician Reviews.” <i>Data &#38; Knowledge Engineering</i> 148 (2023). <a href=\"https://doi.org/10.1016/j.datak.2023.102235\">https://doi.org/10.1016/j.datak.2023.102235</a>.","ieee":"J. Kersting, F. Maoro, and M. Geierhos, “Towards comparable ratings: Exploring bias in German physician reviews,” <i>Data &#38; Knowledge Engineering</i>, vol. 148, Art. no. 102235, 2023, doi: <a href=\"https://doi.org/10.1016/j.datak.2023.102235\">10.1016/j.datak.2023.102235</a>.","apa":"Kersting, J., Maoro, F., &#38; Geierhos, M. (2023). Towards comparable ratings: Exploring bias in German physician reviews. <i>Data &#38; Knowledge Engineering</i>, <i>148</i>, Article 102235. <a href=\"https://doi.org/10.1016/j.datak.2023.102235\">https://doi.org/10.1016/j.datak.2023.102235</a>"},"user_id":"58701","ddc":["004"],"volume":148,"funded_apc":"1","_id":"53801","publisher":"Elsevier","has_accepted_license":"1","status":"public","keyword":["Language model fairness","Aspect phrase classification","Grade prediction","Physician reviews"],"type":"journal_article","department":[{"_id":"579"}],"file":[{"file_name":"Kersting 2023.pdf","file_size":1381398,"access_level":"closed","relation":"main_file","date_updated":"2024-04-30T12:34:35Z","file_id":"53802","success":1,"content_type":"application/pdf","creator":"jkers","date_created":"2024-04-30T12:34:35Z"}],"date_created":"2024-04-30T12:30:56Z","abstract":[{"lang":"eng","text":"In this study, we evaluate the impact of gender-biased data from German-language physician reviews on the fairness of fine-tuned language models. For two different downstream tasks, we use data reported to be gender biased and aggregate it with annotations. First, we propose a new approach to aspect-based sentiment analysis that allows identifying, extracting, and classifying implicit and explicit aspect phrases and their polarity within a single model. The second task we present is grade prediction, where we predict the overall grade of a review on the basis of the review text. For both tasks, we train numerous transformer models and evaluate their performance. The aggregation of sensitive attributes, such as a physician’s gender and migration background, with individual text reviews allows us to measure the performance of the models with respect to these sensitive groups. These group-wise performance measures act as extrinsic bias measures for our downstream tasks. In addition, we translate several gender-specific templates of the intrinsic bias metrics into the German language and evaluate our fine-tuned models. Based on this set of tasks, fine-tuned models, and intrinsic and extrinsic bias measures, we perform correlation analyses between intrinsic and extrinsic bias measures. In terms of sensitive groups and effect sizes, our bias measure results show different directions. Furthermore, correlations between measures of intrinsic and extrinsic bias can be observed in different directions. This leads us to conclude that gender-biased data does not inherently lead to biased models. Other variables, such as template dependency for intrinsic measures and label distribution in the data, must be taken into account as they strongly influence the metric results. Therefore, we suggest that metrics and templates should be chosen according to the given task and the biases to be assessed. "}],"publication":"Data & Knowledge Engineering","doi":"10.1016/j.datak.2023.102235","article_number":"102235","main_file_link":[{"open_access":"1","url":" https://doi.org/10.1016/j.datak.2023.102235 "}],"language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2024-04-30T12:41:14Z","article_type":"original","intvolume":"       148","title":"Towards comparable ratings: Exploring bias in German physician reviews","year":"2023","publication_identifier":{"issn":["0169-023X"]},"author":[{"id":"58701","full_name":"Kersting, Joschka","last_name":"Kersting","first_name":"Joschka"},{"last_name":"Maoro","first_name":"Falk","full_name":"Maoro, Falk"},{"full_name":"Geierhos, Michaela","last_name":"Geierhos","first_name":"Michaela"}]},{"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","language":[{"iso":"eng"}],"doi":"10.5281/zenodo.8068583","author":[{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"},{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco","id":"398"},{"id":"59256","orcid":"0000-0003-3470-3647","first_name":"Eric","last_name":"Bodden","full_name":"Bodden, Eric"},{"first_name":"Philipp ","last_name":"Schubert","full_name":"Schubert, Philipp "},{"id":"22398","full_name":"Pauck, Felix","last_name":"Pauck","first_name":"Felix"},{"full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine","last_name":"Jakobs"}],"title":"Verifying Software and Reconfigurable Hardware Services","year":"2023","intvolume":"       412","date_updated":"2024-05-02T10:29:31Z","date_created":"2023-07-07T08:01:23Z","file":[{"file_size":840964,"access_level":"open_access","file_name":"B4-Chapter-SFB-Buch-Final.pdf","date_updated":"2023-07-07T11:18:59Z","relation":"main_file","content_type":"application/pdf","file_id":"45889","creator":"florida","date_created":"2023-07-07T08:01:12Z"}],"department":[{"_id":"7"},{"_id":"78"}],"type":"book_chapter","publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","publisher":"Heinz Nixdorf Institut, Universität Paderborn","_id":"45888","page":"125-144","editor":[{"last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"volume":412,"ddc":["004"],"user_id":"398","status":"public","has_accepted_license":"1","place":"Paderborn","oa":"1","citation":{"short":"H. Wehrheim, M. Platzner, E. Bodden, P. Schubert, F. Pauck, M.-C. Jakobs, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 125–144.","chicago":"Wehrheim, Heike, Marco Platzner, Eric Bodden, Philipp  Schubert, Felix Pauck, and Marie-Christine Jakobs. “Verifying Software and Reconfigurable Hardware Services.” In <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:125–44. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.5281/zenodo.8068583\">https://doi.org/10.5281/zenodo.8068583</a>.","ieee":"H. Wehrheim, M. Platzner, E. Bodden, P. Schubert, F. Pauck, and M.-C. Jakobs, “Verifying Software and Reconfigurable Hardware Services,” in <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 125–144.","apa":"Wehrheim, H., Platzner, M., Bodden, E., Schubert, P., Pauck, F., &#38; Jakobs, M.-C. (2023). Verifying Software and Reconfigurable Hardware Services. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 125–144). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8068583\">https://doi.org/10.5281/zenodo.8068583</a>","bibtex":"@inbook{Wehrheim_Platzner_Bodden_Schubert_Pauck_Jakobs_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Verifying Software and Reconfigurable Hardware Services}, volume={412}, DOI={<a href=\"https://doi.org/10.5281/zenodo.8068583\">10.5281/zenodo.8068583</a>}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Wehrheim, Heike and Platzner, Marco and Bodden, Eric and Schubert, Philipp  and Pauck, Felix and Jakobs, Marie-Christine}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={125–144}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","ama":"Wehrheim H, Platzner M, Bodden E, Schubert P, Pauck F, Jakobs M-C. Verifying Software and Reconfigurable Hardware Services. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:125-144. doi:<a href=\"https://doi.org/10.5281/zenodo.8068583\">10.5281/zenodo.8068583</a>","mla":"Wehrheim, Heike, et al. “Verifying Software and Reconfigurable Hardware Services.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 125–44, doi:<a href=\"https://doi.org/10.5281/zenodo.8068583\">10.5281/zenodo.8068583</a>."},"file_date_updated":"2023-07-07T11:18:59Z","project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"}]},{"language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","doi":"10.17619/UNIPB/1-1797","alternative_title":["Collaborative Research Centre 901 (2011 – 2023)"],"year":"2023","title":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","publication_identifier":{"unknown":["978-3-947647-31-6"]},"author":[{"id":"20801","first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"},{"first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900"},{"id":"573","full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"date_updated":"2024-07-12T12:07:59Z","intvolume":"       412","file":[{"creator":"ups","date_created":"2023-07-05T07:15:55Z","relation":"main_file","date_updated":"2023-07-05T07:19:14Z","file_name":"SFB-Buch-Final.pdf","access_level":"open_access","file_size":15480050,"file_id":"45864","content_type":"application/pdf"}],"date_created":"2023-07-05T07:16:51Z","type":"book","department":[{"_id":"7"},{"_id":"78"},{"_id":"26"}],"abstract":[{"text":"In the proposal for our CRC in 2011, we formulated a vision of markets for\r\nIT services that describes an approach to the provision of such services\r\nthat was novel at that time and, to a large extent, remains so today:\r\n„Our vision of on-the-fly computing is that of IT services individually and\r\nautomatically configured and brought to execution from flexibly combinable\r\nservices traded on markets. At the same time, we aim at organizing\r\nmarkets whose participants maintain a lively market of services through\r\nappropriate entrepreneurial actions.“\r\nOver the last 12 years, we have developed methods and techniques to\r\naddress problems critical to the convenient, efficient, and secure use of\r\non-the-fly computing. Among other things, we have made the description\r\nof services more convenient by allowing natural language input,\r\nincreased the quality of configured services through (natural language)\r\ninteraction and more efficient configuration processes and analysis\r\nprocedures, made the quality of (the products of) providers in the\r\nmarketplace transparent through reputation systems, and increased the\r\nresource efficiency of execution through reconfigurable heterogeneous\r\ncomputing nodes and an integrated treatment of service description and\r\nconfiguration. We have also developed network infrastructures that have\r\na high degree of adaptivity, scalability, efficiency, and reliability, and\r\nprovide cryptographic guarantees of anonymity and security for market\r\nparticipants and their products and services.\r\nTo demonstrate the pervasiveness of the OTF computing approach, we\r\nhave implemented a proof-of-concept for OTF computing that can run\r\ntypical scenarios of an OTF market. We illustrated the approach using\r\na cutting-edge application scenario – automated machine learning (AutoML).\r\nFinally, we have been pushing our work for the perpetuation of\r\nOn-The-Fly Computing beyond the SFB and sharing the expertise gained\r\nin the SFB in events with industry partners as well as transfer projects.\r\nThis work required a broad spectrum of expertise. Computer scientists\r\nand economists with research interests such as computer networks and\r\ndistributed algorithms, security and cryptography, software engineering\r\nand verification, configuration and machine learning, computer engineering\r\nand HPC, microeconomics and game theory, business informatics\r\nand management have successfully collaborated here.","lang":"eng"}],"page":"247","_id":"45863","publisher":"Heinz Nixdorf Institut, Universität Paderborn","user_id":"1112","ddc":["000"],"volume":412,"status":"public","has_accepted_license":"1","place":"Paderborn","oa":"1","file_date_updated":"2023-07-05T07:19:14Z","citation":{"apa":"Haake, C.-J., Meyer auf der Heide, F., Platzner, M., Wachsmuth, H., &#38; Wehrheim, H. (2023). <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-1797\">https://doi.org/10.17619/UNIPB/1-1797</a>","mla":"Haake, Claus-Jochen, et al. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Heinz Nixdorf Institut, Universität Paderborn, 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1797\">10.17619/UNIPB/1-1797</a>.","ieee":"C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023.","chicago":"Haake, Claus-Jochen, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol. 412. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1797\">https://doi.org/10.17619/UNIPB/1-1797</a>.","ama":"Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Heinz Nixdorf Institut, Universität Paderborn; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1797\">10.17619/UNIPB/1-1797</a>","short":"C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim, On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023.","bibtex":"@book{Haake_Meyer auf der Heide_Platzner_Wachsmuth_Wehrheim_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, volume={412}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1797\">10.17619/UNIPB/1-1797</a>}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }"},"project":[{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"82","name":"SFB 901 - T: SFB 901 - Project Area T"},{"grant_number":"160364472","_id":"5","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)"},{"name":"SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation (Subproject A3)","grant_number":"160364472","_id":"7"},{"_id":"8","grant_number":"160364472","name":"SFB 901 - A4: SFB 901 - Empirische Analysen in Märkten für OTF Dienstleistungen (Subproject A4)"},{"_id":"9","grant_number":"160364472","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)"},{"_id":"10","grant_number":"160364472","name":"SFB 901 - B2: Konfiguration und Bewertung (B02)"},{"_id":"11","name":"SFB 901 - B3: SFB 901 - Subproject B3"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"_id":"13","grant_number":"160364472","name":"SFB 901 - C1: SFB 901 - Subproject C1"},{"_id":"14","grant_number":"160364472","name":"SFB 901 - C2: SFB 901 - On-The-Fly Compute Centers I: Heterogene Ausführungsumgebungen (Subproject C2)"},{"name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","grant_number":"160364472","_id":"16"},{"_id":"17","name":"SFB 901 - C5: SFB 901 - Subproject C5"},{"name":"SFB 901 - T1: SFB 901 -Subproject T1","_id":"83"},{"grant_number":"160364472","_id":"84","name":"SFB 901 - T2: SFB 901 -Subproject T2"}]},{"status":"public","title":"Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?","year":"2023","author":[{"full_name":"Richter, Cedric","first_name":"Cedric","last_name":"Richter","id":"50003"},{"id":"44413","first_name":"Jan Frederik","last_name":"Haltermann","full_name":"Haltermann, Jan Frederik"},{"full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine","last_name":"Jakobs"},{"full_name":"Pauck, Felix","first_name":"Felix","last_name":"Pauck","id":"22398"},{"id":"54847","full_name":"Schott, Stefan","first_name":"Stefan","last_name":"Schott"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"date_updated":"2023-01-19T13:50:18Z","publication_status":"published","main_file_link":[{"url":"https://doi.org/10.1145/3551349.3561156","open_access":"1"}],"language":[{"iso":"eng"}],"_id":"35426","publisher":"ACM","doi":"10.1145/3551349.3561156","user_id":"477","publication":"37th IEEE/ACM International Conference on Automated Software Engineering","citation":{"apa":"Richter, C., Haltermann, J. F., Jakobs, M.-C., Pauck, F., Schott, S., &#38; Wehrheim, H. (2023). Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs? <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>. <a href=\"https://doi.org/10.1145/3551349.3561156\">https://doi.org/10.1145/3551349.3561156</a>","mla":"Richter, Cedric, et al. “Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?” <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>, ACM, 2023, doi:<a href=\"https://doi.org/10.1145/3551349.3561156\">10.1145/3551349.3561156</a>.","ieee":"C. Richter, J. F. Haltermann, M.-C. Jakobs, F. Pauck, S. Schott, and H. Wehrheim, “Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?,” 2023, doi: <a href=\"https://doi.org/10.1145/3551349.3561156\">10.1145/3551349.3561156</a>.","chicago":"Richter, Cedric, Jan Frederik Haltermann, Marie-Christine Jakobs, Felix Pauck, Stefan Schott, and Heike Wehrheim. “Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?” In <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>. ACM, 2023. <a href=\"https://doi.org/10.1145/3551349.3561156\">https://doi.org/10.1145/3551349.3561156</a>.","ama":"Richter C, Haltermann JF, Jakobs M-C, Pauck F, Schott S, Wehrheim H. Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs? In: <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>. ACM; 2023. doi:<a href=\"https://doi.org/10.1145/3551349.3561156\">10.1145/3551349.3561156</a>","short":"C. Richter, J.F. Haltermann, M.-C. Jakobs, F. Pauck, S. Schott, H. Wehrheim, in: 37th IEEE/ACM International Conference on Automated Software Engineering, ACM, 2023.","bibtex":"@inproceedings{Richter_Haltermann_Jakobs_Pauck_Schott_Wehrheim_2023, title={Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?}, DOI={<a href=\"https://doi.org/10.1145/3551349.3561156\">10.1145/3551349.3561156</a>}, booktitle={37th IEEE/ACM International Conference on Automated Software Engineering}, publisher={ACM}, author={Richter, Cedric and Haltermann, Jan Frederik and Jakobs, Marie-Christine and Pauck, Felix and Schott, Stefan and Wehrheim, Heike}, year={2023} }"},"project":[{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901: SFB 901","_id":"1"}],"date_created":"2023-01-09T06:28:44Z","type":"conference","oa":"1","department":[{"_id":"77"}]},{"year":"2023","title":"Scaling Arbitrary Android App Analyses","status":"public","author":[{"id":"22398","first_name":"Felix","last_name":"Pauck","full_name":"Pauck, Felix"}],"publication_status":"published","date_updated":"2023-01-19T13:49:52Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3551349.3561339"}],"publisher":"ACM","_id":"35427","language":[{"iso":"eng"}],"user_id":"477","doi":"10.1145/3551349.3561339","publication":"37th IEEE/ACM International Conference on Automated Software Engineering","citation":{"short":"F. Pauck, in: 37th IEEE/ACM International Conference on Automated Software Engineering, ACM, 2023.","chicago":"Pauck, Felix. “Scaling Arbitrary Android App Analyses.” In <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>. ACM, 2023. <a href=\"https://doi.org/10.1145/3551349.3561339\">https://doi.org/10.1145/3551349.3561339</a>.","ieee":"F. Pauck, “Scaling Arbitrary Android App Analyses,” 2023, doi: <a href=\"https://doi.org/10.1145/3551349.3561339\">10.1145/3551349.3561339</a>.","apa":"Pauck, F. (2023). Scaling Arbitrary Android App Analyses. <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>. <a href=\"https://doi.org/10.1145/3551349.3561339\">https://doi.org/10.1145/3551349.3561339</a>","bibtex":"@inproceedings{Pauck_2023, title={Scaling Arbitrary Android App Analyses}, DOI={<a href=\"https://doi.org/10.1145/3551349.3561339\">10.1145/3551349.3561339</a>}, booktitle={37th IEEE/ACM International Conference on Automated Software Engineering}, publisher={ACM}, author={Pauck, Felix}, year={2023} }","ama":"Pauck F. Scaling Arbitrary Android App Analyses. In: <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>. ACM; 2023. doi:<a href=\"https://doi.org/10.1145/3551349.3561339\">10.1145/3551349.3561339</a>","mla":"Pauck, Felix. “Scaling Arbitrary Android App Analyses.” <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>, ACM, 2023, doi:<a href=\"https://doi.org/10.1145/3551349.3561339\">10.1145/3551349.3561339</a>."},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"}],"date_created":"2023-01-09T06:32:33Z","type":"conference","department":[{"_id":"77"}],"oa":"1"},{"oa":"1","project":[{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"name":"SFB 901: SFB 901","_id":"1"}],"file_date_updated":"2023-05-10T13:52:14Z","citation":{"chicago":"Ahmed, Qazi Arbab, Muhammad Awais, and Marco Platzner. “MAAS: Hiding Trojans in Approximate Circuits.” In <i>The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA</i>, 2023.","short":"Q.A. Ahmed, M. Awais, M. Platzner, in: The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA, 2023.","ieee":"Q. A. Ahmed, M. Awais, and M. Platzner, “MAAS: Hiding Trojans in Approximate Circuits,” presented at the The 24th International Symposium on Quality Electronic Design (ISQED’23), San Fransico CA 94023-0607, USA, 2023.","apa":"Ahmed, Q. A., Awais, M., &#38; Platzner, M. (2023). MAAS: Hiding Trojans in Approximate Circuits. <i>The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA</i>. The 24th International Symposium on Quality Electronic Design (ISQED’23), San Fransico CA 94023-0607, USA.","bibtex":"@inproceedings{Ahmed_Awais_Platzner_2023, title={MAAS: Hiding Trojans in Approximate Circuits}, booktitle={The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA}, author={Ahmed, Qazi Arbab and Awais, Muhammad and Platzner, Marco}, year={2023} }","ama":"Ahmed QA, Awais M, Platzner M. MAAS: Hiding Trojans in Approximate Circuits. In: <i>The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA</i>. ; 2023.","mla":"Ahmed, Qazi Arbab, et al. “MAAS: Hiding Trojans in Approximate Circuits.” <i>The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA</i>, 2023."},"user_id":"72764","ddc":["620"],"_id":"44194","has_accepted_license":"1","status":"public","conference":{"end_date":"2023-04-07","name":"The 24th International Symposium on Quality Electronic Design (ISQED'23)","start_date":"2023-04-05","location":"San Fransico CA 94023-0607, USA"},"type":"conference","department":[{"_id":"78"}],"file":[{"content_type":"application/pdf","file_id":"44196","access_level":"open_access","file_size":614626,"file_name":"s4Bp4-041.pdf","date_updated":"2023-05-10T13:52:14Z","relation":"main_file","date_created":"2023-04-26T13:03:54Z","creator":"qazi"}],"date_created":"2023-04-26T13:04:56Z","publication":"The 24th International Symposium on Quality Electronic Design (ISQED'23), San Francisco, Califorina USA","language":[{"iso":"eng"}],"date_updated":"2023-05-10T13:52:14Z","title":"MAAS: Hiding Trojans in Approximate Circuits","year":"2023","author":[{"full_name":"Ahmed, Qazi Arbab","last_name":"Ahmed","first_name":"Qazi Arbab","orcid":"0000-0002-1837-2254","id":"72764"},{"full_name":"Awais, Muhammad","first_name":"Muhammad","last_name":"Awais"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}]},{"publisher":"Paderborn University","_id":"43108","language":[{"iso":"eng"}],"doi":"10.17619/UNIPB/1-1698","user_id":"22398","year":"2023","status":"public","title":"Cooperative Android App Analysis","author":[{"id":"22398","last_name":"Pauck","first_name":"Felix","full_name":"Pauck, Felix"}],"date_updated":"2023-05-22T04:57:42Z","date_created":"2023-03-27T07:39:35Z","type":"dissertation","department":[{"_id":"77"}],"supervisor":[{"id":"573","first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"citation":{"bibtex":"@book{Pauck_2023, title={Cooperative Android App Analysis}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1698\">10.17619/UNIPB/1-1698</a>}, publisher={Paderborn University}, author={Pauck, Felix}, year={2023} }","ama":"Pauck F. <i>Cooperative Android App Analysis</i>. Paderborn University; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1698\">10.17619/UNIPB/1-1698</a>","mla":"Pauck, Felix. <i>Cooperative Android App Analysis</i>. Paderborn University, 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1698\">10.17619/UNIPB/1-1698</a>.","short":"F. Pauck, Cooperative Android App Analysis, Paderborn University, 2023.","chicago":"Pauck, Felix. <i>Cooperative Android App Analysis</i>. Paderborn University, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1698\">https://doi.org/10.17619/UNIPB/1-1698</a>.","ieee":"F. Pauck, <i>Cooperative Android App Analysis</i>. Paderborn University, 2023.","apa":"Pauck, F. (2023). <i>Cooperative Android App Analysis</i>. Paderborn University. <a href=\"https://doi.org/10.17619/UNIPB/1-1698\">https://doi.org/10.17619/UNIPB/1-1698</a>"},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"}]},{"project":[{"name":"SFB 901: SFB 901","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"9","grant_number":"160364472","name":"SFB 901 - B1: SFB 901 - Subproject B1"}],"abstract":[{"lang":"eng","text":"Reading between the lines has so far been reserved for humans. The present dissertation addresses this research gap using machine learning methods.\r\nImplicit expressions are not comprehensible by computers and cannot be localized in the text. However, many texts arise on interpersonal topics that, unlike commercial evaluation texts, often imply information only by means of longer phrases. Examples are the kindness and the attentiveness of a doctor, which are only paraphrased (“he didn’t even look me in the eye”). The analysis of such data, especially the identification and localization of implicit statements, is a research gap (1). This work uses so-called Aspect-based Sentiment Analysis as a method for this purpose. It remains open how the aspect categories to be extracted can be discovered and thematically delineated based on the data (2). Furthermore, it is not yet explored how a collection of tools should look like, with which implicit phrases can be identified and thus made explicit\r\n(3). Last, it is an open question how to correlate the identified phrases from the text data with other data, including the investigation of the relationship between quantitative scores (e.g., school grades) and the thematically related text (4). Based on these research gaps, the research question is posed as follows: Using text mining methods, how can implicit rating content be properly interpreted and thus made explicit before it is automatically categorized and quantified?\r\nThe uniqueness of this dissertation is based on the automated recognition of implicit linguistic statements alongside explicit statements. These are identified in unstructured text data so that features expressed only in the text can later be compared across data sources, even though they were not included in rating categories such as stars or school grades. German-language physician ratings from websites in three countries serve as the sample domain. The solution approach consists of data creation, a pipeline for text processing and analyses based on this. In the data creation, aspect classes are identified and delineated across platforms and marked in text data. This results in six datasets with over 70,000 annotated sentences and detailed guidelines. The models that were created based on the training data extract and categorize the aspects. In addition, the sentiment polarity and the evaluation weight, i. e., the importance of each phrase, are determined. The models, which are combined in a pipeline, are used in a prototype in the form of a web application. The analyses built on the pipeline quantify the rating contents by linking the obtained information with further data, thus allowing new insights.\r\nAs a result, a toolbox is provided to identify quantifiable rating content and categories using text mining for a sample domain. This is used to evaluate the approach, which in principle can also be adapted to any other domain."}],"related_material":{"link":[{"url":"https://athene-forschung.unibw.de/145003","relation":"supplementary_material"}]},"supervisor":[{"full_name":"Geierhos, Michaela","orcid":"0000-0002-8180-5606","first_name":"Michaela","last_name":"Geierhos","id":"42496"}],"citation":{"ieee":"J. Kersting, <i>Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining</i>. Neubiberg: Universität der Bundeswehr München , 2023.","apa":"Kersting, J. (2023). <i>Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining</i>. Universität der Bundeswehr München .","short":"J. Kersting, Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining, Universität der Bundeswehr München , Neubiberg, 2023.","chicago":"Kersting, Joschka. <i>Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining</i>. Neubiberg: Universität der Bundeswehr München , 2023.","mla":"Kersting, Joschka. <i>Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining</i>. Universität der Bundeswehr München , 2023.","bibtex":"@book{Kersting_2023, place={Neubiberg}, title={Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining}, publisher={Universität der Bundeswehr München }, author={Kersting, Joschka}, year={2023} }","ama":"Kersting J. <i>Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining</i>. Universität der Bundeswehr München ; 2023."},"department":[{"_id":"579"},{"_id":"7"}],"type":"dissertation","place":"Neubiberg","date_created":"2023-05-02T12:54:00Z","date_updated":"2023-07-03T12:29:50Z","publication_status":"published","author":[{"id":"58701","full_name":"Kersting, Joschka","first_name":"Joschka","last_name":"Kersting"}],"year":"2023","title":"Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining","status":"public","user_id":"58701","publisher":"Universität der Bundeswehr München ","_id":"44323","language":[{"iso":"ger"}],"page":"208"},{"place":"Paderborn","oa":"1","citation":{"short":"F.S. Bäumer, W.-F. Chen, M. Geierhos, J. Kersting, H. Wachsmuth, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 65–84.","chicago":"Bäumer, Frederik Simon, Wei-Fan Chen, Michaela Geierhos, Joschka Kersting, and Henning Wachsmuth. “Dialogue-Based Requirement Compensation and Style-Adjusted Data-to-Text Generation.” In <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:65–84. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.5281/zenodo.8068456\">https://doi.org/10.5281/zenodo.8068456</a>.","apa":"Bäumer, F. S., Chen, W.-F., Geierhos, M., Kersting, J., &#38; Wachsmuth, H. (2023). Dialogue-based Requirement Compensation and Style-adjusted Data-to-text Generation. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 65–84). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8068456\">https://doi.org/10.5281/zenodo.8068456</a>","ieee":"F. S. Bäumer, W.-F. Chen, M. Geierhos, J. Kersting, and H. Wachsmuth, “Dialogue-based Requirement Compensation and Style-adjusted Data-to-text Generation,” in <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 65–84.","ama":"Bäumer FS, Chen W-F, Geierhos M, Kersting J, Wachsmuth H. Dialogue-based Requirement Compensation and Style-adjusted Data-to-text Generation. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:65-84. doi:<a href=\"https://doi.org/10.5281/zenodo.8068456\">10.5281/zenodo.8068456</a>","bibtex":"@inbook{Bäumer_Chen_Geierhos_Kersting_Wachsmuth_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Dialogue-based Requirement Compensation and Style-adjusted Data-to-text Generation}, volume={412}, DOI={<a href=\"https://doi.org/10.5281/zenodo.8068456\">10.5281/zenodo.8068456</a>}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Bäumer, Frederik Simon and Chen, Wei-Fan and Geierhos, Michaela and Kersting, Joschka and Wachsmuth, Henning}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={65–84}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","mla":"Bäumer, Frederik Simon, et al. “Dialogue-Based Requirement Compensation and Style-Adjusted Data-to-Text Generation.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 65–84, doi:<a href=\"https://doi.org/10.5281/zenodo.8068456\">10.5281/zenodo.8068456</a>."},"file_date_updated":"2023-07-07T11:20:52Z","project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"grant_number":"160364472","_id":"9","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)"}],"publisher":"Heinz Nixdorf Institut, Universität Paderborn","_id":"45882","page":"65-84","volume":412,"editor":[{"last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"},{"full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"user_id":"477","ddc":["004"],"status":"public","has_accepted_license":"1","date_created":"2023-07-07T07:29:13Z","file":[{"creator":"florida","date_created":"2023-07-07T07:28:58Z","relation":"main_file","date_updated":"2023-07-07T11:20:52Z","file_name":"B1-Chapter-SFB-Buch-Final.pdf","access_level":"open_access","file_size":1342718,"file_id":"45883","content_type":"application/pdf"}],"department":[{"_id":"7"},{"_id":"369"}],"type":"book_chapter","publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","language":[{"iso":"eng"}],"doi":"10.5281/zenodo.8068456","author":[{"full_name":"Bäumer, Frederik Simon","last_name":"Bäumer","first_name":"Frederik Simon","id":"38837"},{"full_name":"Chen, Wei-Fan","first_name":"Wei-Fan","last_name":"Chen","id":"82920"},{"full_name":"Geierhos, Michaela","last_name":"Geierhos","first_name":"Michaela","orcid":"0000-0002-8180-5606","id":"42496"},{"id":"58701","last_name":"Kersting","first_name":"Joschka","full_name":"Kersting, Joschka"},{"first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning"}],"title":"Dialogue-based Requirement Compensation and Style-adjusted Data-to-text Generation","year":"2023","intvolume":"       412","date_updated":"2023-07-07T11:20:52Z"},{"type":"book_chapter","department":[{"_id":"7"}],"file":[{"date_created":"2023-07-07T07:50:34Z","creator":"florida","file_id":"45885","content_type":"application/pdf","relation":"main_file","date_updated":"2023-07-07T11:20:11Z","file_name":"B2-Chapter-SFB-Buch-Final.pdf","access_level":"open_access","file_size":895091}],"date_created":"2023-07-07T07:50:53Z","publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","doi":"10.5281/zenodo.8068466","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","date_updated":"2023-07-07T11:20:12Z","intvolume":"       412","year":"2023","title":"Configuration and Evaluation","author":[{"full_name":"Hanselle, Jonas Manuel","first_name":"Jonas Manuel","last_name":"Hanselle","orcid":"0000-0002-1231-4985","id":"43980"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"},{"last_name":"Mohr","first_name":"Felix","full_name":"Mohr, Felix"},{"id":"65716","first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille"},{"id":"67234","full_name":"Sherif, Mohamed","first_name":"Mohamed","last_name":"Sherif","orcid":"https://orcid.org/0000-0002-9927-2203"},{"full_name":"Tornede, Alexander","last_name":"Tornede","first_name":"Alexander","id":"38209"},{"id":"33176","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik"}],"oa":"1","place":"Paderborn","project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"10","grant_number":"160364472","name":"SFB 901 - B2: Konfiguration und Bewertung (B02)"}],"file_date_updated":"2023-07-07T11:20:11Z","citation":{"chicago":"Hanselle, Jonas Manuel, Eyke Hüllermeier, Felix Mohr, Axel-Cyrille Ngonga Ngomo, Mohamed Sherif, Alexander Tornede, and Marcel Dominik Wever. “Configuration and Evaluation.” In <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:85–104. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.5281/zenodo.8068466\">https://doi.org/10.5281/zenodo.8068466</a>.","short":"J.M. Hanselle, E. Hüllermeier, F. Mohr, A.-C. Ngonga Ngomo, M. Sherif, A. Tornede, M.D. Wever, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 85–104.","apa":"Hanselle, J. M., Hüllermeier, E., Mohr, F., Ngonga Ngomo, A.-C., Sherif, M., Tornede, A., &#38; Wever, M. D. (2023). Configuration and Evaluation. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 85–104). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8068466\">https://doi.org/10.5281/zenodo.8068466</a>","ieee":"J. M. Hanselle <i>et al.</i>, “Configuration and Evaluation,” in <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 85–104.","ama":"Hanselle JM, Hüllermeier E, Mohr F, et al. Configuration and Evaluation. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:85-104. doi:<a href=\"https://doi.org/10.5281/zenodo.8068466\">10.5281/zenodo.8068466</a>","bibtex":"@inbook{Hanselle_Hüllermeier_Mohr_Ngonga Ngomo_Sherif_Tornede_Wever_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Configuration and Evaluation}, volume={412}, DOI={<a href=\"https://doi.org/10.5281/zenodo.8068466\">10.5281/zenodo.8068466</a>}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Hanselle, Jonas Manuel and Hüllermeier, Eyke and Mohr, Felix and Ngonga Ngomo, Axel-Cyrille and Sherif, Mohamed and Tornede, Alexander and Wever, Marcel Dominik}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={85–104}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","mla":"Hanselle, Jonas Manuel, et al. “Configuration and Evaluation.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 85–104, doi:<a href=\"https://doi.org/10.5281/zenodo.8068466\">10.5281/zenodo.8068466</a>."},"user_id":"477","ddc":["040"],"volume":412,"editor":[{"full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"},{"last_name":"Wachsmuth","first_name":"Henning","full_name":"Wachsmuth, Henning"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"page":"85-104","_id":"45884","publisher":"Heinz Nixdorf Institut, Universität Paderborn","has_accepted_license":"1","status":"public"},{"page":"105-123","_id":"45886","publisher":"Heinz Nixdorf Institut, Universität Paderborn","ddc":["004"],"user_id":"477","editor":[{"full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"},{"full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"volume":412,"status":"public","has_accepted_license":"1","place":"Paderborn","oa":"1","file_date_updated":"2023-07-07T11:19:40Z","citation":{"chicago":"Wehrheim, Heike, Eyke Hüllermeier, Steffen Becker, Matthias Becker, Cedric Richter, and Arnab Sharma. “Composition Analysis in Unknown Contexts.” In <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:105–23. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.5281/zenodo.8068510\">https://doi.org/10.5281/zenodo.8068510</a>.","short":"H. Wehrheim, E. Hüllermeier, S. Becker, M. Becker, C. Richter, A. Sharma, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 105–123.","ieee":"H. Wehrheim, E. Hüllermeier, S. Becker, M. Becker, C. Richter, and A. Sharma, “Composition Analysis in Unknown Contexts,” in <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 105–123.","apa":"Wehrheim, H., Hüllermeier, E., Becker, S., Becker, M., Richter, C., &#38; Sharma, A. (2023). Composition Analysis in Unknown Contexts. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 105–123). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8068510\">https://doi.org/10.5281/zenodo.8068510</a>","bibtex":"@inbook{Wehrheim_Hüllermeier_Becker_Becker_Richter_Sharma_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Composition Analysis in Unknown Contexts}, volume={412}, DOI={<a href=\"https://doi.org/10.5281/zenodo.8068510\">10.5281/zenodo.8068510</a>}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Wehrheim, Heike and Hüllermeier, Eyke and Becker, Steffen and Becker, Matthias and Richter, Cedric and Sharma, Arnab}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={105–123}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","ama":"Wehrheim H, Hüllermeier E, Becker S, Becker M, Richter C, Sharma A. Composition Analysis in Unknown Contexts. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:105-123. doi:<a href=\"https://doi.org/10.5281/zenodo.8068510\">10.5281/zenodo.8068510</a>","mla":"Wehrheim, Heike, et al. “Composition Analysis in Unknown Contexts.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 105–23, doi:<a href=\"https://doi.org/10.5281/zenodo.8068510\">10.5281/zenodo.8068510</a>."},"project":[{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B3: SFB 901 - Subproject B3","_id":"11"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","language":[{"iso":"eng"}],"doi":"10.5281/zenodo.8068510","year":"2023","title":"Composition Analysis in Unknown Contexts","author":[{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"},{"id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"},{"last_name":"Becker","first_name":"Steffen","full_name":"Becker, Steffen"},{"first_name":"Matthias","last_name":"Becker","full_name":"Becker, Matthias"},{"id":"50003","full_name":"Richter, Cedric","last_name":"Richter","first_name":"Cedric"},{"first_name":"Arnab","last_name":"Sharma","full_name":"Sharma, Arnab","id":"67200"}],"date_updated":"2023-07-07T11:19:40Z","intvolume":"       412","file":[{"creator":"florida","date_created":"2023-07-07T07:55:57Z","file_size":370888,"access_level":"open_access","file_name":"B3-Chapter-SFB-Buch-Final.pdf","date_updated":"2023-07-07T11:19:40Z","relation":"main_file","content_type":"application/pdf","file_id":"45887"}],"date_created":"2023-07-07T07:56:08Z","type":"book_chapter","department":[{"_id":"7"}],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets"},{"abstract":[{"text":"We present a concept for quantifying evaluative phrases to later compare rating texts numerically instead of just relying on stars or grades. We achievethis by combining deep learning models in an aspect-based sentiment analysis pipeline along with sentiment weighting, polarity, and correlation analyses that combine deep learning results with metadata. The results provide new insights for the medical field. Our application domain, physician reviews, shows that there are millions of review texts on the Internet that cannot yet be comprehensively analyzed because previous studies have focused on explicit aspects from other domains (e.g., products). We identify, extract, and classify implicit and explicit aspect phrases equally from German-language review texts. To do so, we annotated aspect phrases representing reviews on numerous aspects of a physician, medical practice, or practice staff. We apply the best performing transformer model, XLM-RoBERTa, to a large physician review dataset and correlate the results with existing metadata. As a result, we can show different correlations between the sentiment polarity of certain aspect classes (e.g., friendliness, practice equipment) and physicians’ professions (e.g., surgeon, ophthalmologist). As a result, we have individual numerical scores that contain a variety of information based on deep learning algorithms that extract textual (evaluative) information and metadata from the Web.","lang":"eng"}],"publication":"Data Management Technologies and Applications","department":[{"_id":"579"}],"type":"book_chapter","date_created":"2023-07-28T15:03:14Z","file":[{"creator":"jkers","date_created":"2023-07-28T15:10:48Z","file_name":"Kersting and Geierhos (2023), Kersting2023b.pdf","access_level":"closed","file_size":746336,"relation":"main_file","date_updated":"2023-07-28T15:10:48Z","file_id":"46207","content_type":"application/pdf","success":1}],"intvolume":"      1860","date_updated":"2023-07-28T15:11:10Z","publication_status":"published","publication_identifier":{"isbn":["9783031378898","9783031378904"],"issn":["1865-0929","1865-0937"]},"author":[{"full_name":"Kersting, Joschka","first_name":"Joschka","last_name":"Kersting","id":"58701"},{"full_name":"Geierhos, Michaela","orcid":"0000-0002-8180-5606","last_name":"Geierhos","first_name":"Michaela","id":"42496"}],"year":"2023","title":"Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews","doi":"10.1007/978-3-031-37890-4_3","language":[{"iso":"eng"}],"series_title":"Communications in Computer and Information Science","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"grant_number":"160364472","_id":"9","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"citation":{"short":"J. Kersting, M. Geierhos, in: A. Cuzzocrea, O. Gusikhin, S. Hammoudi, C. Quix (Eds.), Data Management Technologies and Applications, Springer Nature Switzerland, Cham, 2023, pp. 45–65.","chicago":"Kersting, Joschka, and Michaela Geierhos. “Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews.” In <i>Data Management Technologies and Applications</i>, edited by Alfredo Cuzzocrea, Oleg Gusikhin, Slimane Hammoudi, and Christoph Quix, 1860:45–65. Communications in Computer and Information Science. Cham: Springer Nature Switzerland, 2023. <a href=\"https://doi.org/10.1007/978-3-031-37890-4_3\">https://doi.org/10.1007/978-3-031-37890-4_3</a>.","apa":"Kersting, J., &#38; Geierhos, M. (2023). Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews. In A. Cuzzocrea, O. Gusikhin, S. Hammoudi, &#38; C. Quix (Eds.), <i>Data Management Technologies and Applications</i> (Vol. 1860, pp. 45–65). Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-37890-4_3\">https://doi.org/10.1007/978-3-031-37890-4_3</a>","ieee":"J. Kersting and M. Geierhos, “Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews,” in <i>Data Management Technologies and Applications</i>, vol. 1860, A. Cuzzocrea, O. Gusikhin, S. Hammoudi, and C. Quix, Eds. Cham: Springer Nature Switzerland, 2023, pp. 45–65.","ama":"Kersting J, Geierhos M. Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews. In: Cuzzocrea A, Gusikhin O, Hammoudi S, Quix C, eds. <i>Data Management Technologies and Applications</i>. Vol 1860. Communications in Computer and Information Science. Springer Nature Switzerland; 2023:45-65. doi:<a href=\"https://doi.org/10.1007/978-3-031-37890-4_3\">10.1007/978-3-031-37890-4_3</a>","bibtex":"@inbook{Kersting_Geierhos_2023, place={Cham}, series={Communications in Computer and Information Science}, title={Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews}, volume={1860}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-37890-4_3\">10.1007/978-3-031-37890-4_3</a>}, booktitle={Data Management Technologies and Applications}, publisher={Springer Nature Switzerland}, author={Kersting, Joschka and Geierhos, Michaela}, editor={Cuzzocrea, Alfredo and Gusikhin, Oleg and Hammoudi, Slimane and Quix, Christoph}, year={2023}, pages={45–65}, collection={Communications in Computer and Information Science} }","mla":"Kersting, Joschka, and Michaela Geierhos. “Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews.” <i>Data Management Technologies and Applications</i>, edited by Alfredo Cuzzocrea et al., vol. 1860, Springer Nature Switzerland, 2023, pp. 45–65, doi:<a href=\"https://doi.org/10.1007/978-3-031-37890-4_3\">10.1007/978-3-031-37890-4_3</a>."},"file_date_updated":"2023-07-28T15:10:48Z","place":"Cham","has_accepted_license":"1","status":"public","editor":[{"last_name":"Cuzzocrea","first_name":"Alfredo","full_name":"Cuzzocrea, Alfredo"},{"full_name":"Gusikhin, Oleg","last_name":"Gusikhin","first_name":"Oleg"},{"full_name":"Hammoudi, Slimane","last_name":"Hammoudi","first_name":"Slimane"},{"full_name":"Quix, Christoph","last_name":"Quix","first_name":"Christoph"}],"volume":1860,"ddc":["004"],"user_id":"58701","publisher":"Springer Nature Switzerland","_id":"46205","page":"45-65"},{"date_updated":"2023-08-04T06:01:49Z","title":"Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions","year":"2023","author":[{"full_name":"Tornede, Alexander","last_name":"Tornede","first_name":"Alexander","id":"38209"}],"doi":"10.17619/UNIPB/1-1780 ","language":[{"iso":"eng"}],"type":"dissertation","department":[{"_id":"355"}],"file":[{"creator":"ahetzer","date_created":"2023-07-24T08:40:35Z","relation":"main_file","date_updated":"2023-07-24T08:42:01Z","file_name":"dissertation_alexander_tornede_final_publishing_compressed.pdf","access_level":"open_access","file_size":4300633,"title":" Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions","file_id":"46118","content_type":"application/pdf"}],"date_created":"2023-06-27T05:20:14Z","has_accepted_license":"1","status":"public","user_id":"15504","ddc":["006"],"_id":"45780","project":[{"name":"SFB 901 - B2: Konfiguration und Bewertung (B02)","grant_number":"160364472","_id":"10"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "}],"file_date_updated":"2023-07-24T08:42:01Z","citation":{"chicago":"Tornede, Alexander. <i>Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions</i>, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1780 \">https://doi.org/10.17619/UNIPB/1-1780 </a>.","ama":"Tornede A. <i>Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions</i>.; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1780 \">10.17619/UNIPB/1-1780 </a>","short":"A. Tornede, Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions, 2023.","bibtex":"@book{Tornede_2023, title={Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1780 \">10.17619/UNIPB/1-1780 </a>}, author={Tornede, Alexander}, year={2023} }","apa":"Tornede, A. (2023). <i>Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1780 \">https://doi.org/10.17619/UNIPB/1-1780 </a>","mla":"Tornede, Alexander. <i>Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions</i>. 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1780 \">10.17619/UNIPB/1-1780 </a>.","ieee":"A. Tornede, <i>Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions</i>. 2023."},"supervisor":[{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"}],"oa":"1"},{"title":"Search Space Characterization for Approximate Logic Synthesis ","year":"2022","status":"public","conference":{"location":"San Francisco, USA","start_date":"2022-07-10","name":"2022 59th ACM/IEEE Design Automation Conference (DAC)","end_date":"2022-07-14"},"author":[{"id":"49051","full_name":"Witschen, Linus Matthias","last_name":"Witschen","first_name":"Linus Matthias"},{"id":"3118","full_name":"Wiersema, Tobias","last_name":"Wiersema","first_name":"Tobias"},{"full_name":"Reuter, Lucas David","first_name":"Lucas David","last_name":"Reuter"},{"full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner","id":"398"}],"date_updated":"2022-02-22T07:51:42Z","publication_status":"accepted","language":[{"iso":"eng"}],"_id":"29945","user_id":"49051","publication":"2022 59th ACM/IEEE Design Automation Conference (DAC)","citation":{"chicago":"Witschen, Linus Matthias, Tobias Wiersema, Lucas David Reuter, and Marco Platzner. “Search Space Characterization for Approximate Logic Synthesis .” In <i>2022 59th ACM/IEEE Design Automation Conference (DAC)</i>, n.d.","short":"L.M. Witschen, T. Wiersema, L.D. Reuter, M. Platzner, in: 2022 59th ACM/IEEE Design Automation Conference (DAC), n.d.","ieee":"L. M. Witschen, T. Wiersema, L. D. Reuter, and M. Platzner, “Search Space Characterization for Approximate Logic Synthesis ,” presented at the 2022 59th ACM/IEEE Design Automation Conference (DAC), San Francisco, USA.","apa":"Witschen, L. M., Wiersema, T., Reuter, L. D., &#38; Platzner, M. (n.d.). Search Space Characterization for Approximate Logic Synthesis . <i>2022 59th ACM/IEEE Design Automation Conference (DAC)</i>. 2022 59th ACM/IEEE Design Automation Conference (DAC), San Francisco, USA.","bibtex":"@inproceedings{Witschen_Wiersema_Reuter_Platzner, title={Search Space Characterization for Approximate Logic Synthesis }, booktitle={2022 59th ACM/IEEE Design Automation Conference (DAC)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Reuter, Lucas David and Platzner, Marco} }","ama":"Witschen LM, Wiersema T, Reuter LD, Platzner M. Search Space Characterization for Approximate Logic Synthesis . In: <i>2022 59th ACM/IEEE Design Automation Conference (DAC)</i>.","mla":"Witschen, Linus Matthias, et al. “Search Space Characterization for Approximate Logic Synthesis .” <i>2022 59th ACM/IEEE Design Automation Conference (DAC)</i>."},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"}],"date_created":"2022-02-22T07:51:38Z","type":"conference","department":[{"_id":"78"}]},{"user_id":"49051","language":[{"iso":"eng"}],"_id":"29865","date_updated":"2022-02-22T07:52:01Z","publication_status":"accepted","status":"public","title":"MUSCAT: MUS-based Circuit Approximation Technique","year":"2022","conference":{"location":"Online","name":"Design, Automation and Test in Europe (DATE)"},"author":[{"id":"49051","last_name":"Witschen","first_name":"Linus Matthias","full_name":"Witschen, Linus Matthias"},{"id":"3118","full_name":"Wiersema, Tobias","last_name":"Wiersema","first_name":"Tobias"},{"last_name":"Artmann","first_name":"Matthias","full_name":"Artmann, Matthias"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco","id":"398"}],"type":"conference","department":[{"_id":"78"}],"date_created":"2022-02-16T16:22:23Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"publication":"Design, Automation and Test in Europe (DATE)","citation":{"bibtex":"@inproceedings{Witschen_Wiersema_Artmann_Platzner, title={MUSCAT: MUS-based Circuit Approximation Technique}, booktitle={Design, Automation and Test in Europe (DATE)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Artmann, Matthias and Platzner, Marco} }","short":"L.M. Witschen, T. Wiersema, M. Artmann, M. Platzner, in: Design, Automation and Test in Europe (DATE), n.d.","ama":"Witschen LM, Wiersema T, Artmann M, Platzner M. MUSCAT: MUS-based Circuit Approximation Technique. In: <i>Design, Automation and Test in Europe (DATE)</i>.","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Matthias Artmann, and Marco Platzner. “MUSCAT: MUS-Based Circuit Approximation Technique.” In <i>Design, Automation and Test in Europe (DATE)</i>, n.d.","ieee":"L. M. Witschen, T. Wiersema, M. Artmann, and M. Platzner, “MUSCAT: MUS-based Circuit Approximation Technique,” presented at the Design, Automation and Test in Europe (DATE), Online.","mla":"Witschen, Linus Matthias, et al. “MUSCAT: MUS-Based Circuit Approximation Technique.” <i>Design, Automation and Test in Europe (DATE)</i>.","apa":"Witschen, L. M., Wiersema, T., Artmann, M., &#38; Platzner, M. (n.d.). MUSCAT: MUS-based Circuit Approximation Technique. <i>Design, Automation and Test in Europe (DATE)</i>. Design, Automation and Test in Europe (DATE), Online."}},{"publication":"arXiv:2202.01651","citation":{"apa":"Schede, E., Brandt, J., Tornede, A., Wever, M. D., Bengs, V., Hüllermeier, E., &#38; Tierney, K. (2022). A Survey of Methods for Automated Algorithm Configuration. In <i>arXiv:2202.01651</i>.","ieee":"E. Schede <i>et al.</i>, “A Survey of Methods for Automated Algorithm Configuration,” <i>arXiv:2202.01651</i>. 2022.","chicago":"Schede, Elias, Jasmin Brandt, Alexander Tornede, Marcel Dominik Wever, Viktor Bengs, Eyke Hüllermeier, and Kevin Tierney. “A Survey of Methods for Automated Algorithm Configuration.” <i>ArXiv:2202.01651</i>, 2022.","short":"E. Schede, J. Brandt, A. Tornede, M.D. Wever, V. Bengs, E. Hüllermeier, K. Tierney, ArXiv:2202.01651 (2022).","mla":"Schede, Elias, et al. “A Survey of Methods for Automated Algorithm Configuration.” <i>ArXiv:2202.01651</i>, 2022.","ama":"Schede E, Brandt J, Tornede A, et al. A Survey of Methods for Automated Algorithm Configuration. <i>arXiv:220201651</i>. Published online 2022.","bibtex":"@article{Schede_Brandt_Tornede_Wever_Bengs_Hüllermeier_Tierney_2022, title={A Survey of Methods for Automated Algorithm Configuration}, journal={arXiv:2202.01651}, author={Schede, Elias and Brandt, Jasmin and Tornede, Alexander and Wever, Marcel Dominik and Bengs, Viktor and Hüllermeier, Eyke and Tierney, Kevin}, year={2022} }"},"abstract":[{"text":"Algorithm configuration (AC) is concerned with the automated search of the\r\nmost suitable parameter configuration of a parametrized algorithm. There is\r\ncurrently a wide variety of AC problem variants and methods proposed in the\r\nliterature. Existing reviews do not take into account all derivatives of the AC\r\nproblem, nor do they offer a complete classification scheme. To this end, we\r\nintroduce taxonomies to describe the AC problem and features of configuration\r\nmethods, respectively. We review existing AC literature within the lens of our\r\ntaxonomies, outline relevant design choices of configuration approaches,\r\ncontrast methods and problem variants against each other, and describe the\r\nstate of AC in industry. Finally, our review provides researchers and\r\npractitioners with a look at future research directions in the field of AC.","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - B2: SFB 901 - Subproject B2"}],"external_id":{"arxiv":["2202.01651"]},"date_created":"2022-04-12T12:00:08Z","type":"preprint","department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}],"status":"public","title":"A Survey of Methods for Automated Algorithm Configuration","year":"2022","author":[{"last_name":"Schede","first_name":"Elias","full_name":"Schede, Elias"},{"last_name":"Brandt","first_name":"Jasmin","full_name":"Brandt, Jasmin"},{"id":"38209","full_name":"Tornede, Alexander","first_name":"Alexander","last_name":"Tornede"},{"full_name":"Wever, Marcel Dominik","last_name":"Wever","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","id":"33176"},{"full_name":"Bengs, Viktor","first_name":"Viktor","last_name":"Bengs","id":"76599"},{"id":"48129","last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke"},{"full_name":"Tierney, Kevin","last_name":"Tierney","first_name":"Kevin"}],"date_updated":"2022-04-12T12:01:15Z","language":[{"iso":"eng"}],"_id":"30868","user_id":"38209"},{"date_created":"2022-07-01T11:18:03Z","department":[{"_id":"7"}],"type":"conference","citation":{"chicago":"Sharma, Arnab, Vitaly Melnikov, Eyke Hüllermeier, and Heike Wehrheim. “Property-Driven Testing of Black-Box Functions.” In <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>, 113–23. IEEE, 2022.","ama":"Sharma A, Melnikov V, Hüllermeier E, Wehrheim H. Property-Driven Testing of Black-Box Functions. In: <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>. IEEE; 2022:113-123.","short":"A. Sharma, V. Melnikov, E. Hüllermeier, H. Wehrheim, in: Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE), IEEE, 2022, pp. 113–123.","bibtex":"@inproceedings{Sharma_Melnikov_Hüllermeier_Wehrheim_2022, title={Property-Driven Testing of Black-Box Functions}, booktitle={Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)}, publisher={IEEE}, author={Sharma, Arnab and Melnikov, Vitaly and Hüllermeier, Eyke and Wehrheim, Heike}, year={2022}, pages={113–123} }","apa":"Sharma, A., Melnikov, V., Hüllermeier, E., &#38; Wehrheim, H. (2022). Property-Driven Testing of Black-Box Functions. <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>, 113–123.","mla":"Sharma, Arnab, et al. “Property-Driven Testing of Black-Box Functions.” <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>, IEEE, 2022, pp. 113–23.","ieee":"A. Sharma, V. Melnikov, E. Hüllermeier, and H. Wehrheim, “Property-Driven Testing of Black-Box Functions,” in <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>, 2022, pp. 113–123."},"publication":"Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B3: SFB 901 - Subproject B3","_id":"11"}],"abstract":[{"text":"Testing is one of the most frequent means of quality assurance for software. Property-based testing aims at generating test suites for checking code against user-defined properties. Test input generation is, however, most often independent of the property to be checked, and is instead based on random or user-defined data generation.In this paper, we present property-driven unit testing of functions with numerical inputs and outputs. Alike property-based testing, it allows users to define the properties to be tested for. Contrary to property-based testing, it also uses the property for a targeted generation of test inputs. Our approach is a form of learning-based testing where we first of all learn a model of a given black-box function using standard machine learning algorithms, and in a second step use model and property for test input generation. This allows us to test both predefined functions as well as machine learned regression models. Our experimental evaluation shows that our property-driven approach is more effective than standard property-based testing techniques.","lang":"eng"}],"publisher":"IEEE","_id":"32311","language":[{"iso":"eng"}],"page":"113-123","user_id":"477","author":[{"first_name":"Arnab","last_name":"Sharma","full_name":"Sharma, Arnab","id":"67200"},{"id":"58747","full_name":"Melnikov, Vitaly","last_name":"Melnikov","first_name":"Vitaly"},{"id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"title":"Property-Driven Testing of Black-Box Functions","status":"public","year":"2022","date_updated":"2022-07-01T11:21:36Z"},{"type":"conference","external_id":{"arxiv":["2210.17341"]},"date_created":"2022-11-17T12:57:40Z","abstract":[{"lang":"eng","text":"It is well known that different algorithms perform differently well on an\r\ninstance of an algorithmic problem, motivating algorithm selection (AS): Given\r\nan instance of an algorithmic problem, which is the most suitable algorithm to\r\nsolve it? As such, the AS problem has received considerable attention resulting\r\nin various approaches - many of which either solve a regression or ranking\r\nproblem under the hood. Although both of these formulations yield very natural\r\nways to tackle AS, they have considerable weaknesses. On the one hand,\r\ncorrectly predicting the performance of an algorithm on an instance is a\r\nsufficient, but not a necessary condition to produce a correct ranking over\r\nalgorithms and in particular ranking the best algorithm first. On the other\r\nhand, classical ranking approaches often do not account for concrete\r\nperformance values available in the training data, but only leverage rankings\r\ncomposed from such data. We propose HARRIS- Hybrid rAnking and RegRessIon\r\nforeSts - a new algorithm selector leveraging special forests, combining the\r\nstrengths of both approaches while alleviating their weaknesses. HARRIS'\r\ndecisions are based on a forest model, whose trees are created based on splits\r\noptimized on a hybrid ranking and regression loss function. As our preliminary\r\nexperimental study on ASLib shows, HARRIS improves over standard algorithm\r\nselection approaches on some scenarios showing that combining ranking and\r\nregression in trees is indeed promising for AS."}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B2: SFB 901 - Subproject B2","_id":"10"}],"publication":"Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022","citation":{"chicago":"Fehring, Lukass, Jonas Manuel Hanselle, and Alexander Tornede. “HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection.” In <i>Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022</i>, 2022.","short":"L. Fehring, J.M. Hanselle, A. Tornede, in: Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, 2022.","ieee":"L. Fehring, J. M. Hanselle, and A. Tornede, “HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection,” presented at the Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, Baltimore, 2022.","apa":"Fehring, L., Hanselle, J. M., &#38; Tornede, A. (2022). HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection. <i>Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022</i>. Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, Baltimore.","bibtex":"@inproceedings{Fehring_Hanselle_Tornede_2022, title={HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection}, booktitle={Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022}, author={Fehring, Lukass and Hanselle, Jonas Manuel and Tornede, Alexander}, year={2022} }","ama":"Fehring L, Hanselle JM, Tornede A. HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection. In: <i>Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022</i>. ; 2022.","mla":"Fehring, Lukass, et al. “HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection.” <i>Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022</i>, 2022."},"user_id":"38209","language":[{"iso":"eng"}],"_id":"34103","date_updated":"2022-11-17T13:00:53Z","title":"HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection","status":"public","year":"2022","author":[{"last_name":"Fehring","first_name":"Lukass","full_name":"Fehring, Lukass"},{"full_name":"Hanselle, Jonas Manuel","last_name":"Hanselle","first_name":"Jonas Manuel","orcid":"0000-0002-1231-4985","id":"43980"},{"id":"38209","full_name":"Tornede, Alexander","last_name":"Tornede","first_name":"Alexander"}],"conference":{"name":"Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022","location":"Baltimore"}},{"department":[{"_id":"77"}],"type":"conference","date_created":"2022-08-08T07:40:04Z","project":[{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"citation":{"apa":"Richter, C., &#38; Wehrheim, H. (2022). Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 162–173. <a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">https://doi.org/10.1109/ICST53961.2022.00027</a>","mla":"Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors.” <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 2022, pp. 162–73, doi:<a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>.","ieee":"C. Richter and H. Wehrheim, “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors,” in <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 2022, pp. 162–173, doi: <a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>.","chicago":"Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors.” In <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 162–73, 2022. <a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">https://doi.org/10.1109/ICST53961.2022.00027</a>.","ama":"Richter C, Wehrheim H. Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. In: <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>. ; 2022:162-173. doi:<a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>","short":"C. Richter, H. Wehrheim, in: 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–173.","bibtex":"@inproceedings{Richter_Wehrheim_2022, title={Learning Realistic Mutations: Bug Creation for Neural Bug Detectors}, DOI={<a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>}, booktitle={2022 IEEE Conference on Software Testing, Verification and Validation (ICST)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={162–173} }"},"publication":"2022 IEEE Conference on Software Testing, Verification and Validation (ICST)","user_id":"477","doi":"10.1109/ICST53961.2022.00027","language":[{"iso":"eng"}],"_id":"32590","page":"162-173","date_updated":"2022-11-18T09:45:40Z","author":[{"id":"50003","last_name":"Richter","first_name":"Cedric","full_name":"Richter, Cedric"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"year":"2022","title":"Learning Realistic Mutations: Bug Creation for Neural Bug Detectors","status":"public"}]