@inproceedings{16952, author = {{Poniatowski, Martin and Neumann, Jürgen}}, booktitle = {{Proceedings of the 28th European Conference on Information Systems (ECIS)}}, location = {{Virtual Conference/Workshop}}, title = {{{Getting Personal with Review Systems – Analyzing the Influence of Personality Traits on the Relationship between Review Templates and Reviewing Behavior}}}, year = {{2020}}, } @inproceedings{17063, author = {{Hansmeier, Tim and Kaufmann, Paul and Platzner, Marco}}, booktitle = {{GECCO '20: Proceedings of the Genetic and Evolutionary Computation Conference Companion}}, isbn = {{978-1-4503-7127-8}}, location = {{Cancún, Mexico}}, pages = {{1756--1764}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{An Adaption Mechanism for the Error Threshold of XCSF}}}, doi = {{10.1145/3377929.3398106}}, year = {{2020}}, } @inproceedings{17082, abstract = {{Data-parallel applications run on cluster of servers in a datacenter and their communication triggers correlated resource demand on multiple links that can be abstracted as coflow. They often desire predictable network performance, which can be passed to network via coflow abstraction for application-aware network scheduling. In this paper, we propose a heuristic and an optimization algorithm for predictable network performance such that they guarantee coflows completion within their deadlines. The algorithms also ensure high network utilization, i.e., it's work-conserving, and avoids starvation of coflows. We evaluate both algorithms via trace-driven simulation and show that they admit 1.1x more coflows than the Varys scheme while meeting their deadlines.}}, author = {{Hasnain, Asif and Karl, Holger}}, booktitle = {{2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGRID)}}, keywords = {{Coflow, Scheduling, Deadlines, Data centers}}, location = {{Melbourne, Australia}}, publisher = {{IEEE Computer Society}}, title = {{{Coflow Scheduling with Performance Guarantees for Data Center Applications}}}, doi = {{https://doi.org/10.1109/CCGrid49817.2020.00010}}, year = {{2020}}, } @inproceedings{15580, abstract = {{This paper deals with aspect phrase extraction and classification in sentiment analysis. We summarize current approaches and datasets from the domain of aspect-based sentiment analysis. This domain detects sentiments expressed for individual aspects in unstructured text data. So far, mainly commercial user reviews for products or services such as restaurants were investigated. We here present our dataset consisting of German physician reviews, a sensitive and linguistically complex field. Furthermore, we describe the annotation process of a dataset for supervised learning with neural networks. Moreover, we introduce our model for extracting and classifying aspect phrases in one step, which obtains an F1-score of 80%. By applying it to a more complex domain, our approach and results outperform previous approaches.}}, author = {{Kersting, Joschka and Geierhos, Michaela}}, booktitle = {{Proceedings of the 12th International Conference on Agents and Artificial Intelligence (ICAART 2020) -- Special Session on Natural Language Processing in Artificial Intelligence (NLPinAI 2020)}}, keywords = {{Deep Learning, Natural Language Processing, Aspect-based Sentiment Analysis}}, location = {{Valetta, Malta}}, pages = {{391----400}}, publisher = {{SCITEPRESS}}, title = {{{Aspect Phrase Extraction in Sentiment Analysis with Deep Learning}}}, year = {{2020}}, } @inproceedings{15582, abstract = {{When it comes to increased digitization in the health care domain, privacy is a relevant topic nowadays. This relates to patient data, electronic health records or physician reviews published online, for instance. There exist different approaches to the protection of individuals’ privacy, which focus on the anonymization and masking of personal information subsequent to their mining. In the medical domain in particular, measures to protect the privacy of patients are of high importance due to the amount of sensitive data that is involved (e.g. age, gender, illnesses, medication). While privacy breaches in structured data can be detected more easily, disclosure in written texts is more difficult to find automatically due to the unstructured nature of natural language. Therefore, we take a detailed look at existing research on areas related to privacy protection. Likewise, we review approaches to the automatic detection of privacy disclosure in different types of medical data. We provide a survey of several studies concerned with privacy breaches in the medical domain with a focus on Physician Review Websites (PRWs). Finally, we briefly develop implications and directions for further research.}}, author = {{Buff, Bianca and Kersting, Joschka and Geierhos, Michaela}}, booktitle = {{Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods (ICPRAM 2020)}}, keywords = {{Identity Disclosure, Privacy Protection, Physician Review Website, De-Anonymization, Medical Domain}}, location = {{Valetta, Malta}}, pages = {{630----637}}, publisher = {{SCITEPRESS}}, title = {{{Detection of Privacy Disclosure in the Medical Domain: A Survey}}}, year = {{2020}}, } @inproceedings{15629, abstract = {{In multi-label classification (MLC), each instance is associated with a set of class labels, in contrast to standard classification where an instance is assigned a single label. Binary relevance (BR) learning, which reduces a multi-label to a set of binary classification problems, one per label, is arguably the most straight-forward approach to MLC. In spite of its simplicity, BR proved to be competitive to more sophisticated MLC methods, and still achieves state-of-the-art performance for many loss functions. Somewhat surprisingly, the optimal choice of the base learner for tackling the binary classification problems has received very little attention so far. Taking advantage of the label independence assumption inherent to BR, we propose a label-wise base learner selection method optimizing label-wise macro averaged performance measures. In an extensive experimental evaluation, we find that or approach, called LiBRe, can significantly improve generalization performance.}}, author = {{Wever, Marcel Dominik and Tornede, Alexander and Mohr, Felix and Hüllermeier, Eyke}}, location = {{Konstanz, Germany}}, publisher = {{Springer}}, title = {{{LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification}}}, year = {{2020}}, } @phdthesis{15631, author = {{Feldkord, Björn}}, title = {{{Mobile Resource Allocation}}}, doi = {{10.17619/UNIPB/1-869}}, year = {{2020}}, } @inproceedings{15635, author = {{Kersting, Joschka and Geierhos, Michaela}}, booktitle = {{Proceedings of the 33rd International Florida Artificial Intelligence Research Symposium (FLAIRS) Conference}}, location = {{North Miami Beach, FL, USA}}, pages = {{282----285}}, publisher = {{AAAI}}, title = {{{Neural Learning for Aspect Phrase Extraction and Classification in Sentiment Analysis}}}, year = {{2020}}, } @misc{15770, author = {{Warner, Daniel}}, publisher = {{Universität Paderborn}}, title = {{{On the complexity of local transformations in SDN overlays}}}, year = {{2020}}, } @phdthesis{15824, author = {{Heinzel, Joachim}}, publisher = {{Universität Paderborn}}, title = {{{Essays on the Theory of Industrial Organization: Credence Goods, Vertical Relations and Product Bundling}}}, year = {{2020}}, } @article{15025, abstract = {{In software engineering, the imprecise requirements of a user are transformed to a formal requirements specification during the requirements elicitation process. This process is usually guided by requirements engineers interviewing the user. We want to partially automate this first step of the software engineering process in order to enable users to specify a desired software system on their own. With our approach, users are only asked to provide exemplary behavioral descriptions. The problem of synthesizing a requirements specification from examples can partially be reduced to the problem of grammatical inference, to which we apply an active coevolutionary learning approach. However, this approach would usually require many feedback queries to be sent to the user. In this work, we extend and generalize our active learning approach to receive knowledge from multiple oracles, also known as proactive learning. The ‘user oracle’ represents input received from the user and the ‘knowledge oracle’ represents available, formalized domain knowledge. We call our two-oracle approach the ‘first apply knowledge then query’ (FAKT/Q) algorithm. We compare FAKT/Q to the active learning approach and provide an extensive benchmark evaluation. As result we find that the number of required user queries is reduced and the inference process is sped up significantly. Finally, with so-called On-The-Fly Markets, we present a motivation and an application of our approach where such knowledge is available.}}, author = {{Wever, Marcel Dominik and van Rooijen, Lorijn and Hamann, Heiko}}, journal = {{Evolutionary Computation}}, number = {{2}}, pages = {{165–193}}, publisher = {{MIT Press Journals}}, title = {{{Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets}}}, doi = {{10.1162/evco_a_00266}}, volume = {{28}}, year = {{2020}}, } @inproceedings{15169, author = {{Castenow, Jannik and Kolb, Christina and Scheideler, Christian}}, booktitle = {{Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)}}, location = {{Kolkata, Indien}}, publisher = {{ACM}}, title = {{{A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}}}, year = {{2020}}, } @inproceedings{15210, author = {{Seutter, Janina and Neumann, Jürgen and Kundisch, Dennis}}, booktitle = {{Tagungsband der 15. Internationalen Tagung Wirtschaftsinformatik 2020 (WI)}}, location = {{Potsdam, Germany}}, title = {{{Nudging in Judging- Differences in Online Rating Behavior for Utilitarian and Hedonic Service Aspects}}}, year = {{2020}}, } @inproceedings{15211, author = {{Szopinski, Daniel and Schoormann, Thorsten and Kundisch, Dennis}}, booktitle = {{Tagungsband der 15. Internationalen Tagung Wirtschaftsinformatik 2020 (WI)}}, location = {{Potsdam, Germany}}, title = {{{Visualize different: Towards researching the fit between taxonomy visualizations and taxonomy tasks}}}, year = {{2020}}, } @inproceedings{15225, author = {{Poniatowski, Martin and Neumann, Jürgen}}, booktitle = {{Tagungsband der 15. Internationalen Tagung Wirtschaftsinformatik 2020 (WI)}}, location = {{Potsdam, Germany}}, title = {{{You Write What You Are - Exploring the Relationship between Online Reviewers' Personality Traits and Their Reviewing Behavior}}}, year = {{2020}}, } @inproceedings{15256, abstract = {{This paper deals with online customer reviews of local multi-service providers. While many studies investigate product reviews and online labour markets with service providers delivering intangible products “over the wire”, we focus on websites where providers offer multiple distinct services that can be booked, paid and reviewed online but are performed locally offline. This type of service providers has so far been neglected in the literature. This paper analyses reviews and applies sentiment analysis. It aims to gain new insights into local multi-service providers’ performance. There is a broad literature range presented with regard to the topics addressed. The results show, among other things, that providers with good ratings continue to perform well over time. We find that many positive reviews seem to encourage sales. On average, quantitative star ratings and qualitative ratings in the form of review texts match. Further results are also achieved in this study.}}, author = {{Kersting, Joschka and Geierhos, Michaela}}, booktitle = {{Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods}}, keywords = {{Customer Reviews, Sentiment Analysis, Online Labour Markets}}, location = {{Valetta, Malta}}, pages = {{263----272}}, publisher = {{SCITEPRESS}}, title = {{{What Reviews in Local Online Labour Markets Reveal about the Performance of Multi-Service Providers}}}, year = {{2020}}, } @inproceedings{16219, abstract = {{Network function virtualization (NFV) proposes to replace physical middleboxes with more flexible virtual network functions (VNFs). To dynamically adjust to everchanging traffic demands, VNFs have to be instantiated and their allocated resources have to be adjusted on demand. Deciding the amount of allocated resources is non-trivial. Existing optimization approaches often assume fixed resource requirements for each VNF instance. However, this can easily lead to either waste of resources or bad service quality if too many or too few resources are allocated. To solve this problem, we train machine learning models on real VNF data, containing measurements of performance and resource requirements. For each VNF, the trained models can then accurately predict the required resources to handle a certain traffic load. We integrate these machine learning models into an algorithm for joint VNF scaling and placement and evaluate their impact on resulting VNF placements. Our evaluation based on real-world data shows that using suitable machine learning models effectively avoids over- and underallocation of resources, leading to up to 12 times lower resource consumption and better service quality with up to 4.5 times lower total delay than using standard fixed resource allocation.}}, author = {{Schneider, Stefan Balthasar and Satheeschandran, Narayanan Puthenpurayil and Peuster, Manuel and Karl, Holger}}, booktitle = {{IEEE Conference on Network Softwarization (NetSoft)}}, location = {{Ghent, Belgium}}, publisher = {{IEEE}}, title = {{{Machine Learning for Dynamic Resource Allocation in Network Function Virtualization}}}, year = {{2020}}, } @article{16334, abstract = {{We analyze the actual behavior of agents in a matching mechanism, using data from a clearinghouse at the Faculty of Business Administration and Economics at a German university, where a variant of the Boston mechanism is used. We supplement this data with data generated in a survey among the students who participated in the clearinghouse. We find that under the current mechanism over 74% of students act strategically by misrepresenting at least one of their preferences. Nevertheless, not all students are able to improve their outcome by doing so. We show that this is mainly due to the incomplete information of students and naiveté. Sophisticated students actually reach significantly better outcomes than naive students. Thus, we find evidence that naive students are exploited by sophisticated students in an incomplete information setting.}}, author = {{Hoyer, Britta and Stroh-Maraun, Nadja}}, journal = {{Games and Economic Behavior}}, pages = {{453 -- 481}}, title = {{{Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse}}}, doi = {{10.1016/j.geb.2020.03.006}}, volume = {{121}}, year = {{2020}}, } @inproceedings{16363, author = {{Hansmeier, Tim and Kaufmann, Paul and Platzner, Marco}}, booktitle = {{GECCO '20: Proceedings of the Genetic and Evolutionary Computation Conference Companion}}, isbn = {{978-1-4503-7127-8}}, location = {{Cancún, Mexico}}, pages = {{125--126}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Enabling XCSF to Cope with Dynamic Environments via an Adaptive Error Threshold}}}, doi = {{10.1145/3377929.3389968}}, year = {{2020}}, } @inproceedings{16400, abstract = {{Softwarization facilitates the introduction of smart manufacturing applications in the industry. Manifold devices such as machine computers, Industrial IoT devices, tablets, smartphones and smart glasses are integrated into factory networks to enable shop floor digitalization and big data analysis. To handle the increasing number of devices and the resulting traffic, a flexible and scalable factory network is necessary which can be realized using softwarization technologies like Network Function Virtualization (NFV). However, the security risks increase with the increasing number of new devices, so that cyber security must also be considered in NFV-based networks. Therefore, extending our previous work, we showcase threat detection using a cloud-native NFV-driven intrusion detection system (IDS) that is integrated in our industrial-specific network services. As a result of the threat detection, the affected network service is put into quarantine via automatic network reconfiguration. We use the 5GTANGO service platform to deploy our developed network services on Kubernetes and to initiate the network reconfiguration.}}, author = {{Müller, Marcel and Behnke, Daniel and Bök, Patrick-Benjamin and Schneider, Stefan Balthasar and Peuster, Manuel and Karl, Holger}}, booktitle = {{IEEE Conference on Network Softwarization (NetSoft) Demo Track}}, location = {{Ghent, Belgium}}, publisher = {{IEEE}}, title = {{{Cloud-Native Threat Detection and Containment for Smart Manufacturing}}}, year = {{2020}}, }