[{"page":"418-422","language":[{"iso":"eng"}],"_id":"32591","doi":"10.1145/3524842.3528505","user_id":"477","title":"TSSB-3M: Mining single statement bugs at massive scale","status":"public","year":"2022","author":[{"id":"50003","full_name":"Richter, Cedric","last_name":"Richter","first_name":"Cedric"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"date_updated":"2022-11-18T09:45:05Z","date_created":"2022-08-08T07:42:19Z","type":"conference","department":[{"_id":"77"}],"publication":"2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)","citation":{"ieee":"C. Richter and H. Wehrheim, “TSSB-3M: Mining single statement bugs at massive scale,” in <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 2022, pp. 418–422, doi: <a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>.","apa":"Richter, C., &#38; Wehrheim, H. (2022). TSSB-3M: Mining single statement bugs at massive scale. <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 418–422. <a href=\"https://doi.org/10.1145/3524842.3528505\">https://doi.org/10.1145/3524842.3528505</a>","short":"C. Richter, H. Wehrheim, in: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–422.","chicago":"Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs at Massive Scale.” In <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 418–22, 2022. <a href=\"https://doi.org/10.1145/3524842.3528505\">https://doi.org/10.1145/3524842.3528505</a>.","mla":"Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs at Massive Scale.” <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 2022, pp. 418–22, doi:<a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>.","bibtex":"@inproceedings{Richter_Wehrheim_2022, title={TSSB-3M: Mining single statement bugs at massive scale}, DOI={<a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>}, booktitle={2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={418–422} }","ama":"Richter C, Wehrheim H. TSSB-3M: Mining single statement bugs at massive scale. In: <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>. ; 2022:418-422. doi:<a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>"},"project":[{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"}]},{"doi":"10.1145/3511095.3531287","ddc":["000"],"user_id":"477","language":[{"iso":"eng"}],"_id":"31806","date_updated":"2022-11-18T10:11:38Z","year":"2022","status":"public","title":"ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning","conference":{"start_date":"2022-06-28","name":"HT ’22: 33rd ACM Conference on Hypertext and Social Media","location":"Barcelona (Spain)","end_date":"2022-07-01"},"author":[{"id":"78256","first_name":"Kevin","last_name":"Dreßler","full_name":"Dreßler, Kevin"},{"first_name":"Mohamed","last_name":"Sherif","full_name":"Sherif, Mohamed","id":"67234"},{"first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716"}],"keyword":["2022 RAKI SFB901 deer dice kevin knowgraphs limes ngonga sherif simba"],"type":"conference","department":[{"_id":"34"}],"date_created":"2022-06-08T08:47:33Z","abstract":[{"text":"The creation of an RDF knowledge graph for a particular application commonly involves a pipeline of tools that transform a set ofinput data sources into an RDF knowledge graph in a process called dataset augmentation. The components of such augmentation pipelines often require extensive configuration to lead to satisfactory results. Thus, non-experts are often unable to use them. Wepresent an efficient supervised algorithm based on genetic programming for learning knowledge graph augmentation pipelines of arbitrary length. Our approach uses multi-expression learning to learn augmentation pipelines able to achieve a high F-measure on the training data. Our evaluation suggests that our approach can efficiently learn a larger class of RDF dataset augmentation tasks than the state of the art while using only a single training example. Even on the most complex augmentation problem we posed, our approach consistently achieves an average F1-measure of 99% in under 500 iterations with an average runtime of 16 seconds","lang":"eng"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B2: SFB 901 - Subproject B2","_id":"10"}],"publication":"Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia","citation":{"ieee":"K. Dreßler, M. Sherif, and A.-C. Ngonga Ngomo, “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning,” presented at the HT ’22: 33rd ACM Conference on Hypertext and Social Media, Barcelona (Spain), 2022, doi: <a href=\"https://doi.org/10.1145/3511095.3531287\">10.1145/3511095.3531287</a>.","apa":"Dreßler, K., Sherif, M., &#38; Ngonga Ngomo, A.-C. (2022). ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning. <i>Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia</i>. HT ’22: 33rd ACM Conference on Hypertext and Social Media, Barcelona (Spain). <a href=\"https://doi.org/10.1145/3511095.3531287\">https://doi.org/10.1145/3511095.3531287</a>","chicago":"Dreßler, Kevin, Mohamed Sherif, and Axel-Cyrille Ngonga Ngomo. “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-Expression Learning.” In <i>Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia</i>, 2022. <a href=\"https://doi.org/10.1145/3511095.3531287\">https://doi.org/10.1145/3511095.3531287</a>.","short":"K. Dreßler, M. Sherif, A.-C. Ngonga Ngomo, in: Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia, 2022.","mla":"Dreßler, Kevin, et al. “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-Expression Learning.” <i>Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia</i>, 2022, doi:<a href=\"https://doi.org/10.1145/3511095.3531287\">10.1145/3511095.3531287</a>.","bibtex":"@inproceedings{Dreßler_Sherif_Ngonga Ngomo_2022, title={ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning}, DOI={<a href=\"https://doi.org/10.1145/3511095.3531287\">10.1145/3511095.3531287</a>}, booktitle={Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia}, author={Dreßler, Kevin and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}, year={2022} }","ama":"Dreßler K, Sherif M, Ngonga Ngomo A-C. ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning. In: <i>Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia</i>. ; 2022. doi:<a href=\"https://doi.org/10.1145/3511095.3531287\">10.1145/3511095.3531287</a>"}},{"status":"public","title":"Analyzing Culture-Specific Argument Structures in Learner Essays","year":"2022","author":[{"first_name":"Wei-Fan","last_name":"Chen","full_name":"Chen, Wei-Fan","id":"82920"},{"full_name":"Chen, Mei-Hua","last_name":"Chen","first_name":"Mei-Hua"},{"first_name":"Garima","last_name":"Mudgal","full_name":"Mudgal, Garima"},{"id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"}],"date_updated":"2022-11-18T09:56:17Z","page":"51 - 61","_id":"33274","language":[{"iso":"eng"}],"user_id":"477","publication":"Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)","citation":{"bibtex":"@inproceedings{Chen_Chen_Mudgal_Wachsmuth_2022, title={Analyzing Culture-Specific Argument Structures in Learner Essays}, booktitle={Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)}, author={Chen, Wei-Fan and Chen, Mei-Hua and Mudgal, Garima and Wachsmuth, Henning}, year={2022}, pages={51–61} }","ama":"Chen W-F, Chen M-H, Mudgal G, Wachsmuth H. Analyzing Culture-Specific Argument Structures in Learner Essays. In: <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>. ; 2022:51-61.","mla":"Chen, Wei-Fan, et al. “Analyzing Culture-Specific Argument Structures in Learner Essays.” <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 2022, pp. 51–61.","short":"W.-F. Chen, M.-H. Chen, G. Mudgal, H. Wachsmuth, in: Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022), 2022, pp. 51–61.","chicago":"Chen, Wei-Fan, Mei-Hua Chen, Garima Mudgal, and Henning Wachsmuth. “Analyzing Culture-Specific Argument Structures in Learner Essays.” In <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 51–61, 2022.","ieee":"W.-F. Chen, M.-H. Chen, G. Mudgal, and H. Wachsmuth, “Analyzing Culture-Specific Argument Structures in Learner Essays,” in <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 2022, pp. 51–61.","apa":"Chen, W.-F., Chen, M.-H., Mudgal, G., &#38; Wachsmuth, H. (2022). Analyzing Culture-Specific Argument Structures in Learner Essays. <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 51–61."},"project":[{"name":"SFB 901 - B1: SFB 901 - Subproject B1","_id":"9"},{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"}],"date_created":"2022-09-06T13:51:23Z","type":"conference","department":[{"_id":"600"}]},{"conference":{"location":"Virtual","start_date":"2022-06-26","name":"24th International Conference on Human-Computer Interaction (HCII 2022)","end_date":"2022-07-01"},"status":"public","has_accepted_license":"1","_id":"32179","publisher":"Springer International Publishing","page":"419--426","volume":1580,"editor":[{"last_name":"Stephanidis","first_name":"Constantine","full_name":"Stephanidis, Constantine"},{"full_name":"Antona, Margherita","first_name":"Margherita","last_name":"Antona"},{"first_name":"Stavroula","last_name":"Ntoa","full_name":"Ntoa, Stavroula"}],"user_id":"58701","ddc":["004"],"citation":{"ama":"Kersting J, Ahmed M, Geierhos M. Chatbot-Enhanced Requirements Resolution for Automated Service Compositions. In: Stephanidis C, Antona M, Ntoa S, eds. <i>HCI International 2022 Posters</i>. Vol 1580. Communications in Computer and Information Science (CCIS). Springer International Publishing; 2022:419--426. doi:<a href=\"https://doi.org/10.1007/978-3-031-06417-3_56\">10.1007/978-3-031-06417-3_56</a>","bibtex":"@inbook{Kersting_Ahmed_Geierhos_2022, place={Cham, Switzerland}, series={Communications in Computer and Information Science (CCIS)}, title={Chatbot-Enhanced Requirements Resolution for Automated Service Compositions}, volume={1580}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-06417-3_56\">10.1007/978-3-031-06417-3_56</a>}, booktitle={HCI International 2022 Posters}, publisher={Springer International Publishing}, author={Kersting, Joschka and Ahmed, Mobeen and Geierhos, Michaela}, editor={Stephanidis, Constantine and Antona, Margherita and Ntoa, Stavroula}, year={2022}, pages={419--426}, collection={Communications in Computer and Information Science (CCIS)} }","mla":"Kersting, Joschka, et al. “Chatbot-Enhanced Requirements Resolution for Automated Service Compositions.” <i>HCI International 2022 Posters</i>, edited by Constantine Stephanidis et al., vol. 1580, Springer International Publishing, 2022, pp. 419--426, doi:<a href=\"https://doi.org/10.1007/978-3-031-06417-3_56\">10.1007/978-3-031-06417-3_56</a>.","short":"J. Kersting, M. Ahmed, M. Geierhos, in: C. Stephanidis, M. Antona, S. Ntoa (Eds.), HCI International 2022 Posters, Springer International Publishing, Cham, Switzerland, 2022, pp. 419--426.","chicago":"Kersting, Joschka, Mobeen Ahmed, and Michaela Geierhos. “Chatbot-Enhanced Requirements Resolution for Automated Service Compositions.” In <i>HCI International 2022 Posters</i>, edited by Constantine Stephanidis, Margherita Antona, and Stavroula Ntoa, 1580:419--426. Communications in Computer and Information Science (CCIS). Cham, Switzerland: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-031-06417-3_56\">https://doi.org/10.1007/978-3-031-06417-3_56</a>.","apa":"Kersting, J., Ahmed, M., &#38; Geierhos, M. (2022). Chatbot-Enhanced Requirements Resolution for Automated Service Compositions. In C. Stephanidis, M. Antona, &#38; S. Ntoa (Eds.), <i>HCI International 2022 Posters</i> (Vol. 1580, pp. 419--426). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-031-06417-3_56\">https://doi.org/10.1007/978-3-031-06417-3_56</a>","ieee":"J. Kersting, M. Ahmed, and M. Geierhos, “Chatbot-Enhanced Requirements Resolution for Automated Service Compositions,” in <i>HCI International 2022 Posters</i>, vol. 1580, C. Stephanidis, M. Antona, and S. Ntoa, Eds. Cham, Switzerland: Springer International Publishing, 2022, pp. 419--426."},"file_date_updated":"2022-11-28T13:21:32Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"9","name":"SFB 901 - B1: SFB 901 - Subproject B1"}],"place":"Cham, Switzerland","author":[{"last_name":"Kersting","first_name":"Joschka","full_name":"Kersting, Joschka","id":"58701"},{"last_name":"Ahmed","first_name":"Mobeen","full_name":"Ahmed, Mobeen"},{"full_name":"Geierhos, Michaela","orcid":"0000-0002-8180-5606","first_name":"Michaela","last_name":"Geierhos","id":"42496"}],"publication_identifier":{"issn":["1865-0929","1865-0937"],"isbn":["9783031064166","9783031064173"]},"year":"2022","title":"Chatbot-Enhanced Requirements Resolution for Automated Service Compositions","intvolume":"      1580","publication_status":"published","date_updated":"2022-11-28T13:22:16Z","series_title":"Communications in Computer and Information Science (CCIS)","language":[{"iso":"eng"}],"doi":"10.1007/978-3-031-06417-3_56","publication":"HCI International 2022 Posters","abstract":[{"text":"This work addresses the automatic resolution of software requirements. In the vision of On-The-Fly Computing, software services should be composed on demand, based solely on natural language input from human users. To enable this, we build a chatbot solution that works with human-in-the-loop support to receive, analyze, correct, and complete their software requirements. The chatbot is equipped with a natural language processing pipeline and a large knowledge base, as well as sophisticated dialogue management skills to enhance the user experience. Previous solutions have focused on analyzing software requirements to point out errors such as vagueness, ambiguity, or incompleteness. Our work shows how apps can collaborate with users to efficiently produce correct requirements. We developed and compared three different chatbot apps that can work with built-in knowledge. We rely on ChatterBot, DialoGPT and Rasa for this purpose. While DialoGPT provides its own knowledge base, Rasa is the best system to combine the text mining and knowledge solutions at our disposal. The evaluation shows that users accept 73% of the suggested answers from Rasa, while they accept only 63% from DialoGPT or even 36% from ChatterBot.","lang":"eng"}],"related_material":{"link":[{"relation":"confirmation","url":"https://link.springer.com/chapter/10.1007/978-3-031-06417-3_56"}]},"date_created":"2022-06-27T09:27:06Z","file":[{"file_id":"34150","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2022-11-28T13:21:32Z","file_name":"Kersting et al. (2022), Kersting2022.pdf","file_size":1153017,"access_level":"closed","date_created":"2022-11-28T13:21:32Z","creator":"jkers"}],"department":[{"_id":"579"}],"type":"book_chapter","keyword":["On-The-Fly Computing","Chatbot","Knowledge Base"]},{"place":"Barcelona, Spain","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"9","name":"SFB 901 - B1: SFB 901 - Subproject B1"}],"file_date_updated":"2022-12-01T13:39:48Z","citation":{"ieee":"J. Kersting and F. S. Bäumer, “Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis,” in <i>Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications</i>, Barcelona, Spain, 2022, pp. 5–9.","apa":"Kersting, J., &#38; Bäumer, F. S. (2022). Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis. In J. Kersting (Ed.), <i>Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications</i> (pp. 5–9). IARIA.","short":"J. Kersting, F.S. Bäumer, in: J. Kersting (Ed.), Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications, IARIA, Barcelona, Spain, 2022, pp. 5–9.","chicago":"Kersting, Joschka, and Frederik Simon Bäumer. “Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis.” In <i>Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications</i>, edited by Joschka Kersting, 5–9. Barcelona, Spain: IARIA, 2022.","mla":"Kersting, Joschka, and Frederik Simon Bäumer. “Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis.” <i>Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications</i>, edited by Joschka Kersting, IARIA, 2022, pp. 5–9.","bibtex":"@inproceedings{Kersting_Bäumer_2022, place={Barcelona, Spain}, title={Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis}, booktitle={Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications}, publisher={IARIA}, author={Kersting, Joschka and Bäumer, Frederik Simon}, editor={Kersting, Joschka}, year={2022}, pages={5–9} }","ama":"Kersting J, Bäumer FS. Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis. In: Kersting J, ed. <i>Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications</i>. IARIA; 2022:5-9."},"ddc":["006"],"user_id":"58701","editor":[{"full_name":"Kersting, Joschka","last_name":"Kersting","first_name":"Joschka"}],"page":"5-9","_id":"31054","publisher":"IARIA","has_accepted_license":"1","status":"public","conference":{"location":"Barcelona, Spain","name":"The Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022)","start_date":"2022-03"},"keyword":["Sentiment analysis","Natural language processing","Aspect phrase extraction"],"type":"conference","file":[{"creator":"jkers","date_created":"2022-12-01T13:39:48Z","date_updated":"2022-12-01T13:39:48Z","relation":"main_file","access_level":"closed","file_size":155548,"file_name":"Kersting & Bäumer (2022), Kersting2022.pdf","success":1,"content_type":"application/pdf","file_id":"34172"}],"date_created":"2022-05-04T08:12:09Z","abstract":[{"lang":"eng","text":"This paper aims at discussing past limitations set in sentiment analysis research regarding explicit and implicit mentions of opinions. Previous studies have regularly neglected this question in favor of methodical research on standard-datasets. Furthermore, they were limited to linguistically less-diverse domains, such as commercial product reviews. We face this issue by annotating a German-language physician review dataset that contains numerous implicit, long, and complex statements that indicate aspect ratings, such as the physician’s friendliness. We discuss the nature of implicit statements and present various samples to illustrate the challenge described."}],"publication":"Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications","language":[{"iso":"eng"}],"date_updated":"2022-12-01T13:40:11Z","publication_status":"published","title":"Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis","year":"2022","author":[{"full_name":"Kersting, Joschka","first_name":"Joschka","last_name":"Kersting","id":"58701"},{"full_name":"Bäumer, Frederik Simon","last_name":"Bäumer","first_name":"Frederik Simon","id":"38837"}]},{"user_id":"82920","language":[{"iso":"eng"}],"_id":"31068","date_updated":"2022-05-09T14:58:39Z","author":[{"first_name":"Mei-Hua","last_name":"Chen","full_name":"Chen, Mei-Hua"},{"first_name":"Garima","last_name":"Mudgal","full_name":"Mudgal, Garima"},{"full_name":"Chen, Wei-Fan","last_name":"Chen","first_name":"Wei-Fan","id":"82920"},{"id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth"}],"status":"public","title":"Investigating the argumentation structures of EFL learners from diverse language backgrounds","year":"2022","department":[{"_id":"600"}],"type":"conference_abstract","date_created":"2022-05-05T07:50:21Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B1: SFB 901 - Subproject B1","_id":"9"}],"citation":{"ieee":"M.-H. Chen, G. Mudgal, W.-F. Chen, and H. Wachsmuth, “Investigating the argumentation structures of EFL learners from diverse language backgrounds,” 2022.","mla":"Chen, Mei-Hua, et al. “Investigating the Argumentation Structures of EFL Learners from Diverse Language Backgrounds.” <i>EUROCALL</i>, 2022.","apa":"Chen, M.-H., Mudgal, G., Chen, W.-F., &#38; Wachsmuth, H. (2022). Investigating the argumentation structures of EFL learners from diverse language backgrounds. <i>EUROCALL</i>.","bibtex":"@inproceedings{Chen_Mudgal_Chen_Wachsmuth_2022, title={Investigating the argumentation structures of EFL learners from diverse language backgrounds}, booktitle={EUROCALL}, author={Chen, Mei-Hua and Mudgal, Garima and Chen, Wei-Fan and Wachsmuth, Henning}, year={2022} }","ama":"Chen M-H, Mudgal G, Chen W-F, Wachsmuth H. Investigating the argumentation structures of EFL learners from diverse language backgrounds. In: <i>EUROCALL</i>. ; 2022.","short":"M.-H. Chen, G. Mudgal, W.-F. Chen, H. Wachsmuth, in: EUROCALL, 2022.","chicago":"Chen, Mei-Hua, Garima Mudgal, Wei-Fan Chen, and Henning Wachsmuth. “Investigating the Argumentation Structures of EFL Learners from Diverse Language Backgrounds.” In <i>EUROCALL</i>, 2022."},"publication":"EUROCALL"},{"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - B2: SFB 901 - Subproject B2"}],"citation":{"short":"L. Fehring, Combined Ranking and Regression Trees for Algorithm Selection, Paderborn, 2022.","chicago":"Fehring, Lukas. <i>Combined Ranking and Regression Trees for Algorithm Selection</i>. Paderborn, 2022.","apa":"Fehring, L. (2022). <i>Combined Ranking and Regression Trees for Algorithm Selection</i>.","ieee":"L. Fehring, <i>Combined Ranking and Regression Trees for Algorithm Selection</i>. Paderborn, 2022.","ama":"Fehring L. <i>Combined Ranking and Regression Trees for Algorithm Selection</i>.; 2022.","bibtex":"@book{Fehring_2022, place={Paderborn}, title={Combined Ranking and Regression Trees for Algorithm Selection}, author={Fehring, Lukas}, year={2022} }","mla":"Fehring, Lukas. <i>Combined Ranking and Regression Trees for Algorithm Selection</i>. 2022."},"file_date_updated":"2022-08-19T09:39:57Z","department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}],"oa":"1","type":"bachelorsthesis","date_created":"2022-08-19T09:41:14Z","place":"Paderborn","file":[{"file_id":"33034","content_type":"application/pdf","relation":"main_file","date_updated":"2022-08-19T09:39:57Z","file_name":"Final Bachelor Thesis.pdf","access_level":"open_access","file_size":24830795,"date_created":"2022-08-19T09:39:57Z","creator":"ahetzer"}],"has_accepted_license":"1","date_updated":"2022-08-20T07:02:04Z","author":[{"id":"75695","full_name":"Fehring, Lukas","last_name":"Fehring","first_name":"Lukas"}],"year":"2022","status":"public","title":"Combined Ranking and Regression Trees for Algorithm Selection","user_id":"38209","ddc":["006"],"_id":"33033","language":[{"iso":"eng"}]},{"date_updated":"2022-08-24T12:44:27Z","title":"Machine Learning for Online Algorithm Selection under Censored Feedback","status":"public","year":"2022","author":[{"first_name":"Alexander","last_name":"Tornede","full_name":"Tornede, Alexander","id":"38209"},{"last_name":"Bengs","first_name":"Viktor","full_name":"Bengs, Viktor","id":"76599"},{"id":"48129","last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"user_id":"38209","language":[{"iso":"eng"}],"_id":"30867","publisher":"AAAI","abstract":[{"text":"In online algorithm selection (OAS), instances of an algorithmic problem\r\nclass are presented to an agent one after another, and the agent has to quickly\r\nselect a presumably best algorithm from a fixed set of candidate algorithms.\r\nFor decision problems such as satisfiability (SAT), quality typically refers to\r\nthe algorithm's runtime. As the latter is known to exhibit a heavy-tail\r\ndistribution, an algorithm is normally stopped when exceeding a predefined\r\nupper time limit. As a consequence, machine learning methods used to optimize\r\nan algorithm selection strategy in a data-driven manner need to deal with\r\nright-censored samples, a problem that has received little attention in the\r\nliterature so far. In this work, we revisit multi-armed bandit algorithms for\r\nOAS and discuss their capability of dealing with the problem. Moreover, we\r\nadapt them towards runtime-oriented losses, allowing for partially censored\r\ndata while keeping a space- and time-complexity independent of the time\r\nhorizon. In an extensive experimental evaluation on an adapted version of the\r\nASlib benchmark, we demonstrate that theoretically well-founded methods based\r\non Thompson sampling perform specifically strong and improve in comparison to\r\nexisting methods.","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B2: SFB 901 - Subproject B2","_id":"10"}],"publication":"Proceedings of the 36th AAAI Conference on Artificial Intelligence","citation":{"ama":"Tornede A, Bengs V, Hüllermeier E. Machine Learning for Online Algorithm Selection under Censored Feedback. <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence</i>. Published online 2022.","bibtex":"@article{Tornede_Bengs_Hüllermeier_2022, title={Machine Learning for Online Algorithm Selection under Censored Feedback}, journal={Proceedings of the 36th AAAI Conference on Artificial Intelligence}, publisher={AAAI}, author={Tornede, Alexander and Bengs, Viktor and Hüllermeier, Eyke}, year={2022} }","mla":"Tornede, Alexander, et al. “Machine Learning for Online Algorithm Selection under Censored Feedback.” <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence</i>, AAAI, 2022.","chicago":"Tornede, Alexander, Viktor Bengs, and Eyke Hüllermeier. “Machine Learning for Online Algorithm Selection under Censored Feedback.” <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence</i>. AAAI, 2022.","short":"A. Tornede, V. Bengs, E. Hüllermeier, Proceedings of the 36th AAAI Conference on Artificial Intelligence (2022).","apa":"Tornede, A., Bengs, V., &#38; Hüllermeier, E. (2022). Machine Learning for Online Algorithm Selection under Censored Feedback. In <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence</i>. AAAI.","ieee":"A. Tornede, V. Bengs, and E. Hüllermeier, “Machine Learning for Online Algorithm Selection under Censored Feedback,” <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence</i>. AAAI, 2022."},"type":"preprint","department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}],"external_id":{"arxiv":["2109.06234"]},"date_created":"2022-04-12T11:58:56Z"},{"user_id":"38209","_id":"30865","language":[{"iso":"eng"}],"date_updated":"2022-08-24T12:45:39Z","title":"Algorithm Selection on a Meta Level","status":"public","year":"2022","author":[{"first_name":"Alexander","last_name":"Tornede","full_name":"Tornede, Alexander","id":"38209"},{"last_name":"Gehring","first_name":"Lukas","full_name":"Gehring, Lukas"},{"full_name":"Tornede, Tanja","first_name":"Tanja","last_name":"Tornede","id":"40795"},{"id":"33176","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","last_name":"Wever","full_name":"Wever, Marcel Dominik"},{"full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke","id":"48129"}],"type":"preprint","department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}],"external_id":{"arxiv":["2107.09414"]},"date_created":"2022-04-12T11:55:18Z","abstract":[{"lang":"eng","text":"The problem of selecting an algorithm that appears most suitable for a\r\nspecific instance of an algorithmic problem class, such as the Boolean\r\nsatisfiability problem, is called instance-specific algorithm selection. Over\r\nthe past decade, the problem has received considerable attention, resulting in\r\na number of different methods for algorithm selection. Although most of these\r\nmethods are based on machine learning, surprisingly little work has been done\r\non meta learning, that is, on taking advantage of the complementarity of\r\nexisting algorithm selection methods in order to combine them into a single\r\nsuperior algorithm selector. In this paper, we introduce the problem of meta\r\nalgorithm selection, which essentially asks for the best way to combine a given\r\nset of algorithm selectors. We present a general methodological framework for\r\nmeta algorithm selection as well as several concrete learning methods as\r\ninstantiations of this framework, essentially combining ideas of meta learning\r\nand ensemble learning. In an extensive experimental evaluation, we demonstrate\r\nthat ensembles of algorithm selectors can significantly outperform single\r\nalgorithm selectors and have the potential to form the new state of the art in\r\nalgorithm selection."}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - B2: SFB 901 - Subproject B2"}],"publication":"Machine Learning","citation":{"short":"A. Tornede, L. Gehring, T. Tornede, M.D. Wever, E. Hüllermeier, Machine Learning (2022).","chicago":"Tornede, Alexander, Lukas Gehring, Tanja Tornede, Marcel Dominik Wever, and Eyke Hüllermeier. “Algorithm Selection on a Meta Level.” <i>Machine Learning</i>, 2022.","apa":"Tornede, A., Gehring, L., Tornede, T., Wever, M. D., &#38; Hüllermeier, E. (2022). Algorithm Selection on a Meta Level. In <i>Machine Learning</i>.","ieee":"A. Tornede, L. Gehring, T. Tornede, M. D. Wever, and E. Hüllermeier, “Algorithm Selection on a Meta Level,” <i>Machine Learning</i>. 2022.","ama":"Tornede A, Gehring L, Tornede T, Wever MD, Hüllermeier E. Algorithm Selection on a Meta Level. <i>Machine Learning</i>. Published online 2022.","bibtex":"@article{Tornede_Gehring_Tornede_Wever_Hüllermeier_2022, title={Algorithm Selection on a Meta Level}, journal={Machine Learning}, author={Tornede, Alexander and Gehring, Lukas and Tornede, Tanja and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2022} }","mla":"Tornede, Alexander, et al. “Algorithm Selection on a Meta Level.” <i>Machine Learning</i>, 2022."}},{"publication":"Welding in the World","citation":{"apa":"Gevers, K., Tornede, A., Wever, M. D., Schöppner, V., &#38; Hüllermeier, E. (2022). A comparison of heuristic, statistical, and machine learning methods for heated tool butt welding of two different materials. <i>Welding in the World</i>. <a href=\"https://doi.org/10.1007/s40194-022-01339-9\">https://doi.org/10.1007/s40194-022-01339-9</a>","ieee":"K. Gevers, A. Tornede, M. D. Wever, V. Schöppner, and E. Hüllermeier, “A comparison of heuristic, statistical, and machine learning methods for heated tool butt welding of two different materials,” <i>Welding in the World</i>, 2022, doi: <a href=\"https://doi.org/10.1007/s40194-022-01339-9\">10.1007/s40194-022-01339-9</a>.","short":"K. Gevers, A. Tornede, M.D. Wever, V. Schöppner, E. Hüllermeier, Welding in the World (2022).","chicago":"Gevers, Karina, Alexander Tornede, Marcel Dominik Wever, Volker Schöppner, and Eyke Hüllermeier. “A Comparison of Heuristic, Statistical, and Machine Learning Methods for Heated Tool Butt Welding of Two Different Materials.” <i>Welding in the World</i>, 2022. <a href=\"https://doi.org/10.1007/s40194-022-01339-9\">https://doi.org/10.1007/s40194-022-01339-9</a>.","mla":"Gevers, Karina, et al. “A Comparison of Heuristic, Statistical, and Machine Learning Methods for Heated Tool Butt Welding of Two Different Materials.” <i>Welding in the World</i>, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s40194-022-01339-9\">10.1007/s40194-022-01339-9</a>.","ama":"Gevers K, Tornede A, Wever MD, Schöppner V, Hüllermeier E. A comparison of heuristic, statistical, and machine learning methods for heated tool butt welding of two different materials. <i>Welding in the World</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1007/s40194-022-01339-9\">10.1007/s40194-022-01339-9</a>","bibtex":"@article{Gevers_Tornede_Wever_Schöppner_Hüllermeier_2022, title={A comparison of heuristic, statistical, and machine learning methods for heated tool butt welding of two different materials}, DOI={<a href=\"https://doi.org/10.1007/s40194-022-01339-9\">10.1007/s40194-022-01339-9</a>}, journal={Welding in the World}, publisher={Springer Science and Business Media LLC}, author={Gevers, Karina and Tornede, Alexander and Wever, Marcel Dominik and Schöppner, Volker and Hüllermeier, Eyke}, year={2022} }"},"abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>Heated tool butt welding is a method often used for joining thermoplastics, especially when the components are made out of different materials. The quality of the connection between the components crucially depends on a suitable choice of the parameters of the welding process, such as heating time, temperature, and the precise way how the parts are then welded. Moreover, when different materials are to be joined, the parameter values need to be tailored to the specifics of the respective material. To this end, in this paper, three approaches to tailor the parameter values to optimize the quality of the connection are compared: a heuristic by Potente, statistical experimental design, and Bayesian optimization. With the suitability for practice in mind, a series of experiments are carried out with these approaches, and their capabilities of proposing well-performing parameter values are investigated. As a result, Bayesian optimization is found to yield peak performance, but the costs for optimization are substantial. In contrast, the Potente heuristic does not require any experimentation and recommends parameter values with competitive quality.</jats:p>","lang":"eng"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - B2: SFB 901 - Subproject B2"}],"date_created":"2022-08-24T12:51:07Z","keyword":["Metals and Alloys","Mechanical Engineering","Mechanics of Materials"],"type":"journal_article","title":"A comparison of heuristic, statistical, and machine learning methods for heated tool butt welding of two different materials","year":"2022","status":"public","author":[{"full_name":"Gevers, Karina","first_name":"Karina","last_name":"Gevers","id":"83151"},{"id":"38209","last_name":"Tornede","first_name":"Alexander","full_name":"Tornede, Alexander"},{"id":"33176","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik"},{"id":"20530","full_name":"Schöppner, Volker","last_name":"Schöppner","first_name":"Volker"},{"full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke","id":"48129"}],"publication_identifier":{"issn":["0043-2288","1878-6669"]},"publication_status":"published","date_updated":"2022-08-24T12:52:06Z","_id":"33090","language":[{"iso":"eng"}],"publisher":"Springer Science and Business Media LLC","user_id":"38209","doi":"10.1007/s40194-022-01339-9"},{"has_accepted_license":"1","conference":{"end_date":"2022-04-28","start_date":"2022-04-24","name":"The Fourteenth International Conferences on Pervasive Patterns and Applications -- PATTERNS 2022","location":"Barcelona, Spain"},"status":"public","editor":[{"id":"58701","full_name":"Kersting, Joschka","last_name":"Kersting","first_name":"Joschka"}],"ddc":["004"],"user_id":"58701","_id":"53803","publisher":"IARIA","project":[{"grant_number":"160364472","_id":"9","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"}],"citation":{"bibtex":"@book{Kersting_2022, place={Barcelona, Spain}, title={PATTERNS 2022 The Fourteenth International Conferences on Pervasive Patterns and Applications}, publisher={IARIA}, year={2022} }","ama":"Kersting J, ed. <i>PATTERNS 2022 The Fourteenth International Conferences on Pervasive Patterns and Applications</i>. IARIA; 2022.","mla":"Kersting, Joschka, editor. <i>PATTERNS 2022 The Fourteenth International Conferences on Pervasive Patterns and Applications</i>. IARIA, 2022.","chicago":"Kersting, Joschka, ed. <i>PATTERNS 2022 The Fourteenth International Conferences on Pervasive Patterns and Applications</i>. Barcelona, Spain: IARIA, 2022.","short":"J. Kersting, ed., PATTERNS 2022 The Fourteenth International Conferences on Pervasive Patterns and Applications, IARIA, Barcelona, Spain, 2022.","ieee":"J. Kersting, Ed., <i>PATTERNS 2022 The Fourteenth International Conferences on Pervasive Patterns and Applications</i>. Barcelona, Spain: IARIA, 2022.","apa":"Kersting, J. (Ed.). (2022). <i>PATTERNS 2022 The Fourteenth International Conferences on Pervasive Patterns and Applications</i>. IARIA."},"file_date_updated":"2024-04-30T14:01:07Z","oa":"1","place":"Barcelona, Spain","date_updated":"2024-04-30T14:05:40Z","publication_status":"published","publication_identifier":{"unknown":["978-1-61208-953-9"]},"year":"2022","title":"PATTERNS 2022 The Fourteenth International Conferences on Pervasive Patterns and Applications","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://www.thinkmind.org/index.php?view=instance&instance=PATTERNS+2022","open_access":"1"}],"department":[{"_id":"579"}],"type":"conference_editor","date_created":"2024-04-30T14:02:14Z","file":[{"file_id":"53804","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2024-04-30T14:01:07Z","file_name":"patterns_2022_full.pdf","file_size":4578901,"access_level":"closed","date_created":"2024-04-30T14:01:07Z","creator":"jkers"}]},{"author":[{"id":"49051","full_name":"Witschen, Linus Matthias","last_name":"Witschen","first_name":"Linus Matthias"}],"title":"Frameworks and Methodologies for Search-based Approximate Logic Synthesis","status":"public","year":"2022","date_updated":"2023-01-19T06:41:22Z","_id":"34041","language":[{"iso":"eng"}],"user_id":"15504","doi":"10.17619/UNIPB/1-1649","citation":{"mla":"Witschen, Linus Matthias. <i>Frameworks and Methodologies for Search-Based Approximate Logic Synthesis</i>. 2022, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1649\">10.17619/UNIPB/1-1649</a>.","bibtex":"@book{Witschen_2022, title={Frameworks and Methodologies for Search-based Approximate Logic Synthesis}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1649\">10.17619/UNIPB/1-1649</a>}, author={Witschen, Linus Matthias}, year={2022} }","ama":"Witschen LM. <i>Frameworks and Methodologies for Search-Based Approximate Logic Synthesis</i>.; 2022. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1649\">10.17619/UNIPB/1-1649</a>","ieee":"L. M. Witschen, <i>Frameworks and Methodologies for Search-based Approximate Logic Synthesis</i>. 2022.","apa":"Witschen, L. M. (2022). <i>Frameworks and Methodologies for Search-based Approximate Logic Synthesis</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1649\">https://doi.org/10.17619/UNIPB/1-1649</a>","short":"L.M. Witschen, Frameworks and Methodologies for Search-Based Approximate Logic Synthesis, 2022.","chicago":"Witschen, Linus Matthias. <i>Frameworks and Methodologies for Search-Based Approximate Logic Synthesis</i>, 2022. <a href=\"https://doi.org/10.17619/UNIPB/1-1649\">https://doi.org/10.17619/UNIPB/1-1649</a>."},"supervisor":[{"id":"398","full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"}],"date_created":"2022-11-09T06:26:22Z","department":[{"_id":"78"}],"type":"dissertation"},{"citation":{"ieee":"Q. A. Ahmed and M. Platzner, “On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs,” presented at the IEEE Computer Society Annual Symposium on VLSI Aliathon Resort, Pafos, Cyprus, 2022.","apa":"Ahmed, Q. A., &#38; Platzner, M. (2022). <i>On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs</i>. IEEE Computer Society Annual Symposium on VLSI Aliathon Resort, Pafos, Cyprus.","chicago":"Ahmed, Qazi Arbab, and Marco Platzner. “On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs.” Pafos, Cyprus: IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022), 2022.","short":"Q.A. Ahmed, M. Platzner, in: IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022), Pafos, Cyprus, 2022.","mla":"Ahmed, Qazi Arbab, and Marco Platzner. <i>On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs</i>. IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022), 2022.","bibtex":"@inproceedings{Ahmed_Platzner_2022, place={Pafos, Cyprus}, title={On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs}, publisher={IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022)}, author={Ahmed, Qazi Arbab and Platzner, Marco}, year={2022} }","ama":"Ahmed QA, Platzner M. On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs. In: IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022); 2022."},"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":"2022-07-12T19:56:48Z","place":"Pafos, Cyprus","type":"conference","department":[{"_id":"78"}],"year":"2022","title":"On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs","status":"public","author":[{"id":"72764","last_name":"Ahmed","orcid":"0000-0002-1837-2254","first_name":"Qazi Arbab","full_name":"Ahmed, Qazi Arbab"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco","id":"398"}],"conference":{"end_date":"July 6, 2022","location":"Pafos, Cyprus","start_date":" July 4, 2022","name":"IEEE Computer Society Annual Symposium on VLSI Aliathon Resort,"},"date_updated":"2023-04-19T15:04:30Z","publisher":"IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022)","_id":"32342","language":[{"iso":"eng"}],"user_id":"72764"},{"status":"public","title":"Knowledge Base Enhanced & User-centric Dialogue Design for OTF Computing","year":"2022","author":[{"full_name":"Ahmed, Mobeen","first_name":"Mobeen","last_name":"Ahmed"}],"date_updated":"2023-05-02T13:25:45Z","publication_status":"published","has_accepted_license":"1","_id":"29000","language":[{"iso":"eng"}],"ddc":["004"],"user_id":"58701","file_date_updated":"2023-05-02T13:25:27Z","supervisor":[{"full_name":"Kersting, Joschka","first_name":"Joschka","last_name":"Kersting","id":"58701"}],"citation":{"apa":"Ahmed, M. (2022). <i>Knowledge Base Enhanced &#38; User-centric Dialogue Design for OTF Computing</i>.","ieee":"M. Ahmed, <i>Knowledge Base Enhanced &#38; User-centric Dialogue Design for OTF Computing</i>. 2022.","chicago":"Ahmed, Mobeen. <i>Knowledge Base Enhanced &#38; User-Centric Dialogue Design for OTF Computing</i>, 2022.","short":"M. Ahmed, Knowledge Base Enhanced &#38; User-Centric Dialogue Design for OTF Computing, 2022.","mla":"Ahmed, Mobeen. <i>Knowledge Base Enhanced &#38; User-Centric Dialogue Design for OTF Computing</i>. 2022.","ama":"Ahmed M. <i>Knowledge Base Enhanced &#38; User-Centric Dialogue Design for OTF Computing</i>.; 2022.","bibtex":"@book{Ahmed_2022, title={Knowledge Base Enhanced &#38; User-centric Dialogue Design for OTF Computing}, author={Ahmed, Mobeen}, year={2022} }"},"abstract":[{"text":"This thesis aims to provide a bidirectional chatbot solution for the requirement engineering process. The Sonderforschungsbereich (SFB) 901 intends to provide the composition of software service On-the-Fly (OTF). The sub-project (B1) of the SFB 901 project deals with the parameters of service configuration. OTF Computing aims to eradicate the dependency on the requirement engineers for the software development process. However, there is no existing bidirectional chatbot solution that analyses user software requirements and provides viable suggestions to the user regarding their service. Previously, CORDULA chatbot was developed to analyze the software requirements but cannot keep the conversation’s context. The Rasa framework is integrated with the knowledge base to solve the issue, the knowledge base provides domain-specific knowledge to the chatbot. The software description is passed through the natural language understanding process to give consciousness to the chatbot. This process involves various machine learning models, including app family classification, to correctly identify the domain for user OTF service. The statistical models like naïve Bayes, kNN and SVM are compared with transformer models for this classification task. Furthermore, the entities (functional requirements) are also separated from the user description.\r\nThe chatbot provides the suggestion of requirements from the preliminary service template with the support of the knowledge base. Furthermore, the generated response is compared with the state-of-the-art DialoGPT transformer model and ChatterBot conversational library. These models are trained over the software development related conversational dataset. All the responses are ranked using the DialoRPT model, and the BLEU score to evaluates the models’ responses. Moreover, the chatbot mod- els are tested with human participants, they used and scored the chatbot responses based on effectiveness, efficiency and satisfaction. The overall response accuracy is also measured by averaging the user approval over the generated responses.","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B1","_id":"9"}],"file":[{"creator":"jkers","date_created":"2023-05-02T13:25:27Z","file_size":3092211,"access_level":"closed","file_name":"Thesis-Report-MOBEEN-AHMED-6856465-Knowledge_Base_Enhanced___User_centric_Dialogue_Design_for_OTFComputing.pdf","date_updated":"2023-05-02T13:25:27Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"44325"}],"date_created":"2021-12-16T15:13:07Z","type":"mastersthesis","department":[{"_id":"600"}]},{"date_created":"2023-06-27T12:57:57Z","department":[{"_id":"600"}],"type":"bachelorsthesis","supervisor":[{"id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"}],"citation":{"chicago":"Palushi, Juela. <i>Domain-Aware Text Professionalization Using Sequence-to-Sequence Neural Networks</i>, 2022.","short":"J. Palushi, Domain-Aware Text Professionalization Using Sequence-to-Sequence Neural Networks, 2022.","apa":"Palushi, J. (2022). <i>Domain-aware Text Professionalization using Sequence-to-Sequence Neural Networks</i>.","ieee":"J. Palushi, <i>Domain-aware Text Professionalization using Sequence-to-Sequence Neural Networks</i>. 2022.","ama":"Palushi J. <i>Domain-Aware Text Professionalization Using Sequence-to-Sequence Neural Networks</i>.; 2022.","bibtex":"@book{Palushi_2022, title={Domain-aware Text Professionalization using Sequence-to-Sequence Neural Networks}, author={Palushi, Juela}, year={2022} }","mla":"Palushi, Juela. <i>Domain-Aware Text Professionalization Using Sequence-to-Sequence Neural Networks</i>. 2022."},"project":[{"grant_number":"160364472","_id":"9","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)"},{"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":"45790","language":[{"iso":"eng"}],"user_id":"477","author":[{"full_name":"Palushi, Juela","first_name":"Juela","last_name":"Palushi"}],"year":"2022","status":"public","title":"Domain-aware Text Professionalization using Sequence-to-Sequence Neural Networks","date_updated":"2023-07-05T07:31:17Z"},{"type":"mastersthesis","department":[{"_id":"600"}],"date_created":"2023-06-27T12:56:04Z","project":[{"name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)","grant_number":"160364472","_id":"9"},{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"supervisor":[{"full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth","id":"3900"}],"citation":{"ama":"Budanurmath V. <i>Propaganda Technique Detection Using Connotation Frames</i>.; 2022.","bibtex":"@book{Budanurmath_2022, title={Propaganda Technique Detection Using Connotation Frames}, author={Budanurmath, Vinaykumar}, year={2022} }","mla":"Budanurmath, Vinaykumar. <i>Propaganda Technique Detection Using Connotation Frames</i>. 2022.","chicago":"Budanurmath, Vinaykumar. <i>Propaganda Technique Detection Using Connotation Frames</i>, 2022.","short":"V. Budanurmath, Propaganda Technique Detection Using Connotation Frames, 2022.","apa":"Budanurmath, V. (2022). <i>Propaganda Technique Detection Using Connotation Frames</i>.","ieee":"V. Budanurmath, <i>Propaganda Technique Detection Using Connotation Frames</i>. 2022."},"user_id":"477","_id":"45789","language":[{"iso":"eng"}],"date_updated":"2023-07-05T07:33:45Z","title":"Propaganda Technique Detection Using Connotation Frames","status":"public","year":"2022","author":[{"first_name":"Vinaykumar","last_name":"Budanurmath","full_name":"Budanurmath, Vinaykumar"}]},{"date_updated":"2023-08-28T12:24:57Z","intvolume":"       243","year":"2022","title":"Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement","author":[{"last_name":"Dongol","first_name":"Brijesh","full_name":"Dongol, Brijesh"},{"first_name":"Gerhard","last_name":"Schellhorn","full_name":"Schellhorn, Gerhard"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"doi":"10.4230/LIPIcs.CONCUR.2022.31","series_title":"LIPIcs","language":[{"iso":"eng"}],"publication":"33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland","type":"conference","department":[{"_id":"77"}],"date_created":"2023-05-24T07:55:24Z","status":"public","user_id":"477","volume":243,"editor":[{"first_name":"Bartek","last_name":"Klin","full_name":"Klin, Bartek"},{"first_name":"Slawomir","last_name":"Lasota","full_name":"Lasota, Slawomir"},{"last_name":"Muscholl","first_name":"Anca","full_name":"Muscholl, Anca"}],"page":"31:1–31:23","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","_id":"45248","project":[{"name":"SFB 901: SFB 901","grant_number":"160364472","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"}],"citation":{"short":"B. Dongol, G. Schellhorn, H. Wehrheim, in: B. Klin, S. Lasota, A. Muscholl (Eds.), 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 31:1–31:23.","chicago":"Dongol, Brijesh, Gerhard Schellhorn, and Heike Wehrheim. “Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement.” In <i>33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland</i>, edited by Bartek Klin, Slawomir Lasota, and Anca Muscholl, 243:31:1–31:23. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.31\">https://doi.org/10.4230/LIPIcs.CONCUR.2022.31</a>.","apa":"Dongol, B., Schellhorn, G., &#38; Wehrheim, H. (2022). Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement. In B. Klin, S. Lasota, &#38; A. Muscholl (Eds.), <i>33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland</i> (Vol. 243, p. 31:1–31:23). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.31\">https://doi.org/10.4230/LIPIcs.CONCUR.2022.31</a>","ieee":"B. Dongol, G. Schellhorn, and H. Wehrheim, “Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement,” in <i>33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland</i>, 2022, vol. 243, p. 31:1–31:23, doi: <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.31\">10.4230/LIPIcs.CONCUR.2022.31</a>.","ama":"Dongol B, Schellhorn G, Wehrheim H. Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement. In: Klin B, Lasota S, Muscholl A, eds. <i>33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland</i>. Vol 243. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:31:1–31:23. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.31\">10.4230/LIPIcs.CONCUR.2022.31</a>","bibtex":"@inproceedings{Dongol_Schellhorn_Wehrheim_2022, series={LIPIcs}, title={Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement}, volume={243}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.31\">10.4230/LIPIcs.CONCUR.2022.31</a>}, booktitle={33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike}, editor={Klin, Bartek and Lasota, Slawomir and Muscholl, Anca}, year={2022}, pages={31:1–31:23}, collection={LIPIcs} }","mla":"Dongol, Brijesh, et al. “Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement.” <i>33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland</i>, edited by Bartek Klin et al., vol. 243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 31:1–31:23, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.31\">10.4230/LIPIcs.CONCUR.2022.31</a>."}},{"citation":{"bibtex":"@article{Schubert_Gazzillo_Patterson_Braha_Schiebel_Hermann_Wei_Bodden_2022, title={Static data-flow analysis for software product lines in C}, volume={29}, DOI={<a href=\"https://doi.org/10.1007/s10515-022-00333-1\">10.1007/s10515-022-00333-1</a>}, number={135}, journal={Automated Software Engineering}, publisher={Springer Science and Business Media LLC}, author={Schubert, Philipp and Gazzillo, Paul and Patterson, Zach and Braha, Julian and Schiebel, Fabian Benedikt and Hermann, Ben and Wei, Shiyi and Bodden, Eric}, year={2022} }","ama":"Schubert P, Gazzillo P, Patterson Z, et al. Static data-flow analysis for software product lines in C. <i>Automated Software Engineering</i>. 2022;29(1). doi:<a href=\"https://doi.org/10.1007/s10515-022-00333-1\">10.1007/s10515-022-00333-1</a>","mla":"Schubert, Philipp, et al. “Static Data-Flow Analysis for Software Product Lines in C.” <i>Automated Software Engineering</i>, vol. 29, no. 1, 35, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s10515-022-00333-1\">10.1007/s10515-022-00333-1</a>.","chicago":"Schubert, Philipp, Paul Gazzillo, Zach Patterson, Julian Braha, Fabian Benedikt Schiebel, Ben Hermann, Shiyi Wei, and Eric Bodden. “Static Data-Flow Analysis for Software Product Lines in C.” <i>Automated Software Engineering</i> 29, no. 1 (2022). <a href=\"https://doi.org/10.1007/s10515-022-00333-1\">https://doi.org/10.1007/s10515-022-00333-1</a>.","short":"P. Schubert, P. Gazzillo, Z. Patterson, J. Braha, F.B. Schiebel, B. Hermann, S. Wei, E. Bodden, Automated Software Engineering 29 (2022).","ieee":"P. Schubert <i>et al.</i>, “Static data-flow analysis for software product lines in C,” <i>Automated Software Engineering</i>, vol. 29, no. 1, Art. no. 35, 2022, doi: <a href=\"https://doi.org/10.1007/s10515-022-00333-1\">10.1007/s10515-022-00333-1</a>.","apa":"Schubert, P., Gazzillo, P., Patterson, Z., Braha, J., Schiebel, F. B., Hermann, B., Wei, S., &#38; Bodden, E. (2022). Static data-flow analysis for software product lines in C. <i>Automated Software Engineering</i>, <i>29</i>(1), Article 35. <a href=\"https://doi.org/10.1007/s10515-022-00333-1\">https://doi.org/10.1007/s10515-022-00333-1</a>"},"project":[{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"1","name":"SFB 901: SFB 901"}],"oa":"1","status":"public","publisher":"Springer Science and Business Media LLC","_id":"30511","volume":29,"user_id":"15249","publication":"Automated Software Engineering","issue":"1","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>Many critical codebases are written in C, and most of them use preprocessor directives to encode variability, effectively encoding software product lines. These preprocessor directives, however, challenge any static code analysis. SPLlift, a previously presented approach for analyzing software product lines, is limited to Java programs that use a rather simple feature encoding and to analysis problems with a finite and ideally small domain. Other approaches that allow the analysis of real-world C software product lines use special-purpose analyses, preventing the reuse of existing analysis infrastructures and ignoring the progress made by the static analysis community. This work presents <jats:sc>VarAlyzer</jats:sc>, a novel static analysis approach for software product lines. <jats:sc>VarAlyzer</jats:sc> first transforms preprocessor constructs to plain C while preserving their variability and semantics. It then solves any given distributive analysis problem on transformed product lines in a variability-aware manner. <jats:sc>VarAlyzer</jats:sc> ’s analysis results are annotated with feature constraints that encode in which configurations each result holds. Our experiments with 95 compilation units of OpenSSL show that applying <jats:sc>VarAlyzer</jats:sc> enables one to conduct inter-procedural, flow-, field- and context-sensitive data-flow analyses on entire product lines for the first time, outperforming the product-based approach for highly-configurable systems.</jats:p>"}],"date_created":"2022-03-25T07:41:26Z","department":[{"_id":"76"}],"keyword":["inter-procedural static analysis","software product lines","preprocessor","LLVM","C/C++"],"type":"journal_article","author":[{"id":"60543","first_name":"Philipp","last_name":"Schubert","orcid":"0000-0002-8674-1859","full_name":"Schubert, Philipp"},{"first_name":"Paul","last_name":"Gazzillo","full_name":"Gazzillo, Paul"},{"last_name":"Patterson","first_name":"Zach","full_name":"Patterson, Zach"},{"full_name":"Braha, Julian","last_name":"Braha","first_name":"Julian"},{"full_name":"Schiebel, Fabian Benedikt","orcid":"0009-0008-6867-9802","first_name":"Fabian Benedikt","last_name":"Schiebel","id":"55745"},{"id":"66173","first_name":"Ben","last_name":"Hermann","orcid":"0000-0001-9848-2017","full_name":"Hermann, Ben"},{"full_name":"Wei, Shiyi","last_name":"Wei","first_name":"Shiyi"},{"first_name":"Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric","id":"59256"}],"publication_identifier":{"issn":["0928-8910","1573-7535"]},"year":"2022","title":"Static data-flow analysis for software product lines in C","intvolume":"        29","article_type":"original","date_updated":"2025-12-04T10:42:38Z","publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://link.springer.com/article/10.1007/s10515-022-00333-1"}],"article_number":"35","alternative_title":["Revoking the preprocessor’s special role"],"doi":"10.1007/s10515-022-00333-1"},{"language":[{"iso":"eng"}],"_id":"28350","publisher":"IEEE","user_id":"477","author":[{"last_name":"Sharma","first_name":"Arnab","full_name":"Sharma, Arnab","id":"67200"},{"id":"43817","full_name":"Demir, Caglar","last_name":"Demir","first_name":"Caglar"},{"first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"year":"2021","title":"MLCHECK–Property-Driven Testing of Machine Learning Classifiers","status":"public","publication_status":"accepted","date_updated":"2022-01-06T06:58:02Z","date_created":"2021-12-07T11:11:36Z","department":[{"_id":"7"},{"_id":"77"},{"_id":"574"}],"type":"conference","citation":{"ieee":"A. Sharma, C. Demir, A.-C. Ngonga Ngomo, and H. Wehrheim, “MLCHECK–Property-Driven Testing of Machine Learning Classifiers.”","apa":"Sharma, A., Demir, C., Ngonga Ngomo, A.-C., &#38; Wehrheim, H. (n.d.). MLCHECK–Property-Driven Testing of Machine Learning Classifiers. <i>Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA)</i>.","chicago":"Sharma, Arnab, Caglar Demir, Axel-Cyrille Ngonga Ngomo, and Heike Wehrheim. “MLCHECK–Property-Driven Testing of Machine Learning Classifiers.” In <i>Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA)</i>. IEEE, n.d.","short":"A. Sharma, C. Demir, A.-C. Ngonga Ngomo, H. Wehrheim, in: Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA), IEEE, n.d.","mla":"Sharma, Arnab, et al. “MLCHECK–Property-Driven Testing of Machine Learning Classifiers.” <i>Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA)</i>, IEEE.","bibtex":"@inproceedings{Sharma_Demir_Ngonga Ngomo_Wehrheim, title={MLCHECK–Property-Driven Testing of Machine Learning Classifiers}, booktitle={Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA)}, publisher={IEEE}, author={Sharma, Arnab and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille and Wehrheim, Heike} }","ama":"Sharma A, Demir C, Ngonga Ngomo A-C, Wehrheim H. MLCHECK–Property-Driven Testing of Machine Learning Classifiers. In: <i>Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA)</i>. IEEE."},"publication":"Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA)","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"abstract":[{"lang":"eng","text":"In recent years, we observe an increasing amount of software with machine learning components being deployed. This poses the question of quality assurance for such components: how can we validate whether specified requirements are fulfilled by a machine learned software? Current testing and verification approaches either focus on a single requirement (e.g., fairness) or specialize on a single type of machine learning model (e.g., neural networks).\r\nIn this paper, we propose property-driven testing of machine learning models. Our approach MLCheck encompasses (1) a language for property specification, and (2) a technique for systematic test case generation. The specification language is comparable to property-based testing languages. Test case generation employs advanced verification technology for a systematic, property dependent construction of test suites, without additional user supplied generator functions. We evaluate MLCheck using requirements and data sets from three different application areas (software\r\ndiscrimination, learning on knowledge graphs and security). Our evaluation shows that despite its generality MLCheck can even outperform specialised testing approaches while having a comparable runtime"}]},{"has_accepted_license":"1","conference":{"end_date":"15.10.2021","name":"18th International Conference on Applied Computing","start_date":"13.10.2021","location":"Lisbon, Portugal"},"status":"public","user_id":"58701","ddc":["000"],"_id":"26049","publisher":"IADIS","page":"221--225","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B1","_id":"9"}],"citation":{"mla":"Bäumer, Frederik Simon, et al. “IN OTHER WORDS: A NAIVE APPROACH TO TEXT SPINNING.” <i>PROCEEDINGS OF THE INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021</i>, IADIS, 2021, pp. 221--225.","bibtex":"@inproceedings{Bäumer_Kersting_Denisov_Geierhos_2021, title={IN OTHER WORDS: A NAIVE APPROACH TO TEXT SPINNING}, booktitle={PROCEEDINGS OF THE INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021}, publisher={IADIS}, author={Bäumer, Frederik Simon and Kersting, Joschka and Denisov, Sergej and Geierhos, Michaela}, year={2021}, pages={221--225} }","ama":"Bäumer FS, Kersting J, Denisov S, Geierhos M. IN OTHER WORDS: A NAIVE APPROACH TO TEXT SPINNING. In: <i>PROCEEDINGS OF THE INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021</i>. IADIS; 2021:221--225.","ieee":"F. S. Bäumer, J. Kersting, S. Denisov, and M. Geierhos, “IN OTHER WORDS: A NAIVE APPROACH TO TEXT SPINNING,” in <i>PROCEEDINGS OF THE INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021</i>, Lisbon, Portugal, 2021, pp. 221--225.","apa":"Bäumer, F. S., Kersting, J., Denisov, S., &#38; Geierhos, M. (2021). IN OTHER WORDS: A NAIVE APPROACH TO TEXT SPINNING. <i>PROCEEDINGS OF THE INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021</i>, 221--225.","chicago":"Bäumer, Frederik Simon, Joschka Kersting, Sergej Denisov, and Michaela Geierhos. “IN OTHER WORDS: A NAIVE APPROACH TO TEXT SPINNING.” In <i>PROCEEDINGS OF THE INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021</i>, 221--225. IADIS, 2021.","short":"F.S. Bäumer, J. Kersting, S. Denisov, M. Geierhos, in: PROCEEDINGS OF THE INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021, IADIS, 2021, pp. 221--225."},"file_date_updated":"2021-10-15T15:54:41Z","date_updated":"2022-01-06T06:57:16Z","author":[{"full_name":"Bäumer, Frederik Simon","last_name":"Bäumer","first_name":"Frederik Simon"},{"last_name":"Kersting","first_name":"Joschka","full_name":"Kersting, Joschka","id":"58701"},{"full_name":"Denisov, Sergej","first_name":"Sergej","last_name":"Denisov"},{"full_name":"Geierhos, Michaela","last_name":"Geierhos","first_name":"Michaela","orcid":"0000-0002-8180-5606","id":"42496"}],"title":"IN OTHER WORDS: A NAIVE APPROACH TO TEXT SPINNING","year":"2021","language":[{"iso":"eng"}],"abstract":[{"text":"Content is the new oil. Users consume billions of terabytes a day while surfing on news sites or blogs, posting on social media sites, and sending chat messages around the globe. While content is heterogeneous, the dominant form of web content is text. There are situations where more diversity needs to be introduced into text content, for example, to reuse it on websites or to allow a chatbot to base its models on the information conveyed rather than of the language used. In order to achieve this, paraphrasing techniques have been developed: One example is Text spinning, a technique that automatically paraphrases text while leaving the intent intact. This makes it easier to reuse content, or to change the language generated by the bot more human. One method for modifying texts is a combination of translation and back-translation. This paper presents NATTS, a naive approach that uses transformer-based translation models to create diversified text, combining translation steps in one model. An advantage of this approach is that it can be fine-tuned and handle technical language.","lang":"eng"}],"publication":"PROCEEDINGS OF THE INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021","type":"conference","keyword":["Software Requirements","Natural Language Processing","Transfer Learning","On-The-Fly Computing"],"date_created":"2021-10-11T15:26:58Z","file":[{"creator":"jkers","date_created":"2021-10-15T15:54:41Z","date_updated":"2021-10-15T15:54:41Z","relation":"main_file","access_level":"closed","file_size":411667,"file_name":"Bäumer et al. (2021), Baeumer2021.pdf","content_type":"application/pdf","success":1,"file_id":"26282"}]}]