@inproceedings{46307, abstract = {{Exploratory Landscape Analysis is a powerful technique for numerically characterizing landscapes of single-objective continuous optimization problems. Landscape insights are crucial both for problem understanding as well as for assessing benchmark set diversity and composition. Despite the irrefutable usefulness of these features, they suffer from their own ailments and downsides. Hence, in this work we provide a collection of different approaches to characterize optimization landscapes. Similar to conventional landscape features, we require a small initial sample. However, instead of computing features based on that sample, we develop alternative representations of the original sample. These range from point clouds to 2D images and, therefore, are entirely feature-free. We demonstrate and validate our devised methods on the BBOB testbed and predict, with the help of Deep Learning, the high-level, expert-based landscape properties such as the degree of multimodality and the existence of funnel structures. The quality of our approaches is on par with methods relying on the traditional landscape features. Thereby, we provide an exciting new perspective on every research area which utilizes problem information such as problem understanding and algorithm design as well as automated algorithm configuration and selection.}}, author = {{Seiler, Moritz and Prager, Raphael Patrick and Kerschke, Pascal and Trautmann, Heike}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference}}, isbn = {{9781450392372}}, pages = {{657–665}}, publisher = {{Association for Computing Machinery}}, title = {{{A Collection of Deep Learning-based Feature-Free Approaches for Characterizing Single-Objective Continuous Fitness Landscapes}}}, doi = {{10.1145/3512290.3528834}}, year = {{2022}}, } @inproceedings{46304, abstract = {{In recent years, feature-based automated algorithm selection using exploratory landscape analysis has demonstrated its great potential in single-objective continuous black-box optimization. However, feature computation is problem-specific and can be costly in terms of computational resources. This paper investigates feature-free approaches that rely on state-of-the-art deep learning techniques operating on either images or point clouds. We show that point-cloud-based strategies, in particular, are highly competitive and also substantially reduce the size of the required solver portfolio. Moreover, we highlight the effect and importance of cost-sensitive learning in automated algorithm selection models.}}, author = {{Prager, Raphael Patrick and Seiler, Moritz and Trautmann, Heike and Kerschke, Pascal}}, booktitle = {{Parallel Problem Solving from Nature — PPSN XVII}}, editor = {{Rudolph, Günter and Kononova, Anna V. and Aguirre, Hernán and Kerschke, Pascal and Ochoa, Gabriela and Tušar, Tea}}, isbn = {{978-3-031-14714-2}}, pages = {{3–17}}, publisher = {{Springer International Publishing}}, title = {{{Automated Algorithm Selection in Single-Objective Continuous Optimization: A Comparative Study of Deep Learning and Landscape Analysis Methods}}}, doi = {{10.1007/978-3-031-14714-2_1}}, year = {{2022}}, } @inproceedings{46303, abstract = {{Social media platforms are essential for information sharing and, thus, prone to coordinated dis- and misinformation campaigns. Nevertheless, research in this area is hampered by strict data sharing regulations imposed by the platforms, resulting in a lack of benchmark data. Previous work focused on circumventing these rules by either pseudonymizing the data or sharing fragments. In this work, we will address the benchmarking crisis by presenting a methodology that can be used to create artificial campaigns out of original campaign building blocks. We conduct a proof-of-concept study using the freely available generative language model GPT-Neo in this context and demonstrate that the campaign patterns can flexibly be adapted to an underlying social media stream and evade state-of-the-art campaign detection approaches based on stream clustering. Thus, we not only provide a framework for artificial benchmark generation but also demonstrate the possible adversarial nature of such benchmarks for challenging and advancing current campaign detection methods.}}, author = {{Pohl, Janina Susanne and Assenmacher, Dennis and Seiler, Moritz and Trautmann, Heike and Grimme, Christian}}, booktitle = {{Workshop Proceedings of the 16$^th$ International Conference on Web and Social Media (ICWSM)}}, editor = {{the Advancement of Artificial Intelligence (AAAI) Association, for}}, pages = {{1–10}}, publisher = {{AAAI Press}}, title = {{{Artificial Social Media Campaign Creation for Benchmarking and Challenging Detection Approaches}}}, doi = {{10.36190/2022.91}}, year = {{2022}}, } @article{46309, abstract = {{Due to the rise of continuous data-generating applications, analyzing data streams has gained increasing attention over the past decades. A core research area in stream data is stream classification, which categorizes or detects data points within an evolving stream of observations. Areas of stream classification are diverse—ranging, e.g., from monitoring sensor data to analyzing a wide range of (social) media applications. Research in stream classification is related to developing methods that adapt to the changing and potentially volatile data stream. It focuses on individual aspects of the stream classification pipeline, e.g., designing suitable algorithm architectures, an efficient train and test procedure, or detecting so-called concept drifts. As a result of the many different research questions and strands, the field is challenging to grasp, especially for beginners. This survey explores, summarizes, and categorizes work within the domain of stream classification and identifies core research threads over the past few years. It is structured based on the stream classification process to facilitate coordination within this complex topic, including common application scenarios and benchmarking data sets. Thus, both newcomers to the field and experts who want to widen their scope can gain (additional) insight into this research area and find starting points and pointers to more in-depth literature on specific issues and research directions in the field.}}, author = {{Clever, Lena and Pohl, Janina Susanne and Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}}, journal = {{Applied Sciences}}, number = {{8}}, pages = {{1–44}}, title = {{{Process-Oriented Stream Classification Pipeline: A Literature Review}}}, doi = {{10.3390/app12189094}}, volume = {{12}}, year = {{2022}}, } @inproceedings{46302, author = {{Heins, J and Rook, J and Schäpermeier, L and Kerschke, P and Bossek, Jakob and Trautmann, Heike}}, booktitle = {{Parallel Problem Solving from Nature — PPSN XVII}}, editor = {{Rudolph, G and Kononova, AV and Aguirre, H and Kerschke, P and Ochoa, G and Tušar, T}}, isbn = {{978-3-031-14714-2}}, pages = {{192–206}}, publisher = {{Springer International Publishing}}, title = {{{BBE: Basin-Based Evaluation of Multimodal Multi-objective Optimization Problems}}}, year = {{2022}}, } @inproceedings{46305, abstract = {{Hardness of Multi-Objective (MO) continuous optimization problems results from an interplay of various problem characteristics, e. g. the degree of multi-modality. We present a benchmark study of classical and diversity focused optimizers on multi-modal MO problems based on automated algorithm configuration. We show the large effect of the latter and investigate the trade-off between convergence in objective space and diversity in decision space.}}, author = {{Rook, J and Trautmann, Heike and Bossek, Jakob and Grimme, C}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference Companion}}, editor = {{Fieldsend, J and Wagner, M.}}, isbn = {{9781450392686}}, pages = {{356–359}}, publisher = {{Association for Computing Machinery}}, title = {{{On the Potential of Automated Algorithm Configuration on Multi-Modal Multi-Objective Optimization Problems}}}, doi = {{10.1145/3520304.3528998}}, year = {{2022}}, } @article{46318, abstract = {{Multi-objective (MO) optimization, i.e., the simultaneous optimization of multiple conflicting objectives, is gaining more and more attention in various research areas, such as evolutionary computation, machine learning (e.g., (hyper-)parameter optimization), or logistics (e.g., vehicle routing). Many works in this domain mention the structural problem property of multimodality as a challenge from two classical perspectives: (1) finding all globally optimal solution sets, and (2) avoiding to get trapped in local optima. Interestingly, these streams seem to transfer many traditional concepts of single-objective (SO) optimization into claims, assumptions, or even terminology regarding the MO domain, but mostly neglect the understanding of the structural properties as well as the algorithmic search behavior on a problem’s landscape. However, some recent works counteract this trend, by investigating the fundamentals and characteristics of MO problems using new visualization techniques and gaining surprising insights. Using these visual insights, this work proposes a step towards a unified terminology to capture multimodality and locality in a broader way than it is usually done. This enables us to investigate current research activities in multimodal continuous MO optimization and to highlight new implications and promising research directions for the design of benchmark suites, the discovery of MO landscape features, the development of new MO (or even SO) optimization algorithms, and performance indicators. For all these topics, we provide a review of ideas and methods but also an outlook on future challenges, research potential and perspectives that result from recent developments.}}, author = {{Grimme, Christian and Kerschke, Pascal and Aspar, Pelin and Trautmann, Heike and Preuss, Mike and Deutz, André H. and Wang, Hao and Emmerich, Michael}}, issn = {{0305-0548}}, journal = {{Computers & Operations Research}}, keywords = {{Multimodal optimization, Multi-objective continuous optimization, Landscape analysis, Visualization, Benchmarking, Theory, Algorithms}}, pages = {{105489}}, title = {{{Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization}}}, doi = {{https://doi.org/10.1016/j.cor.2021.105489}}, volume = {{136}}, year = {{2021}}, } @inproceedings{46311, abstract = {{In this work we examine the inner mechanisms of the recently developed sophisticated local search procedure SOMOGSA. This method solves multimodal single-objective continuous optimization problems by first expanding the problem with an additional objective (e.g., a sphere function) to the bi-objective space, and subsequently exploiting local structures and ridges of the resulting landscapes. Our study particularly focusses on the sensitivity of this multiobjectivization approach w.r.t. (i) the parametrization of the artificial second objective, as well as (ii) the position of the initial starting points in the search space. As SOMOGSA is a modular framework for encapsulating local search, we integrate Gradient and Nelder-Mead local search (as optimizers in the respective module) and compare the performance of the resulting hybrid local search to their original single-objective counterparts. We show that the SOMOGSA framework can significantly boost local search by multiobjectivization. Combined with more sophisticated local search and metaheuristics this may help in solving highly multimodal optimization problems in future.}}, author = {{Aspar, Pelin and Kerschke, Pascal and Steinhoff, Vera and Trautmann, Heike and Grimme, Christian}}, booktitle = {{Evolutionary Multi-Criterion Optimization: 11$^th$ International Conference, EMO 2021, Shenzhen, China, March 28–31, 2021, Proceedings}}, editor = {{et al. Ishibuchi, H.}}, pages = {{311–322}}, publisher = {{Springer}}, title = {{{Multi^3: Optimizing Multimodal Single-Objective Continuous Problems in the Multi-Objective Space by Means of Multiobjectivization}}}, doi = {{10.1007/978-3-030-72062-9_25}}, year = {{2021}}, } @article{46317, abstract = {{One of the most significant recent technological developments concerns the development and implementation of ‘intelligent machines’ that draw on recent advances in artificial intelligence (AI) and robotics. However, there are growing tensions between human freedoms and machine controls. This article reports the findings of a workshop that investigated the application of the principles of human freedom throughout intelligent machine development and use. Forty IS researchers from ten different countries discussed four contemporary AI and humanity issues and the most relevant IS domain challenges. This article summarizes their experiences and opinions regarding four AI and humanity themes: Crime & conflict, Jobs, Attention, and Wellbeing. The outcomes of the workshop discussions identify three attributes of humanity that need preservation: a critique of the design and application of AI, and the intelligent machines it can create; human involvement in the loop of intelligent machine decision-making processes; and the ability to interpret and explain intelligent machine decision-making processes. The article provides an agenda for future AI and humanity research.}}, author = {{Coombs, Crispin and Stacey, Patrick and Kawalek, Peter and Simeonova, Boyka and Becker, Jörg and Bergener, Katrin and Carvalho, João Álvaro and Fantinato, Marcelo and Garmann-Johnsen, Niels F. and Grimme, Christian and Stein, Armin and Trautmann, Heike}}, journal = {{International Journal of Information Management}}, title = {{{What Is It About Humanity That We Can’t Give Away To Intelligent Machines? A European Perspective}}}, doi = {{10.1016/j.ijinfomgt.2021.102311}}, volume = {{58}}, year = {{2021}}, } @inproceedings{46315, abstract = {{We propose a novel method for automated algorithm selection in the domain of single-objective continuous black-box optimization. In contrast to existing methods, we use convolutional neural networks as the selection apparatus which bases its decision on a so-called ‘fitness map’. This fitness map is a 2D representation of a two dimensional search space where different gray scales indicate the quality of found solutions in certain areas. Our devised approach uses a modular CMA-ES framework which offers the option to create the conventional CMA-ES, CMA-ES with the alternate step-size adaptation and many other variants proposed over the years. In total, 4 608 different configurations are possible where most configurations are of complementary nature. In this proof-of-concept work, we consider a subset of 32 possible configurations. The developed method is evaluated against an excerpt of BBOB functions and its performance is compared against baselines that are commonly used in automated algorithm selection - the best standalone algorithm (configuration) and the best obtainable sequence of configurations. While the results indicate that the use of the fitness map is not superior on every benchmark problem, it indubitably shows its merit on more hard-to-solve problems. This offers a promising perspective for generalizing to other types of optimization problems and problem domains.}}, author = {{Prager, Raphael Patrick and Seiler, Moritz and Trautmann, Heike and Kerschke, Pascal}}, booktitle = {{2021 IEEE Symposium Series on Computational Intelligence (SSCI)}}, pages = {{1--8}}, title = {{{Towards Feature-Free Automated Algorithm Selection for Single-Objective Continuous Black-Box Optimization}}}, doi = {{10.1109/SSCI50451.2021.9660174}}, year = {{2021}}, } @inproceedings{46312, abstract = {{Abuse and hate are penetrating social media and many comment sections of news media companies. These platform providers invest considerable efforts to mod- erate user-generated contributions to prevent losing readers who get appalled by inappropriate texts. This is further enforced by legislative actions, which make non-clearance of these comments a punishable action. While (semi-)automated solutions using Natural Language Processing and advanced Machine Learning techniques are getting increasingly sophisticated, the domain of abusive language detection still struggles as large non-English and well-curated datasets are scarce or not publicly available. With this work, we publish and analyse the largest annotated German abusive language comment datasets to date. In contrast to existing datasets, we achieve a high labelling standard by conducting a thorough crowd-based an- notation study that complements professional moderators’ decisions, which are also included in the dataset. We compare and cross-evaluate the performance of baseline algorithms and state-of-the-art transformer-based language models, which are fine-tuned on our datasets and an existing alternative, showing the usefulness for the community.}}, author = {{Assenmacher, Dennis and Niemann, Marco and Müller, Kilian and Seiler, Moritz and Riehle, Dennis M. and Trautmann, Heike}}, booktitle = {{Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021)}}, pages = {{1–14}}, title = {{{RP-Mod & RP-Crowd: Moderator- and Crowd-Annotated German News Comment Datasets}}}, year = {{2021}}, } @inproceedings{46313, abstract = {{Classic automated algorithm selection (AS) for (combinatorial) optimization problems heavily relies on so-called instance features, i.e., numerical characteristics of the problem at hand ideally extracted with computationally low-demanding routines. For the traveling salesperson problem (TSP) a plethora of features have been suggested. Most of these features are, if at all, only normalized imprecisely raising the issue of feature values being strongly affected by the instance size. Such artifacts may have detrimental effects on algorithm selection models. We propose a normalization for two feature groups which stood out in multiple AS studies on the TSP: (a) features based on a minimum spanning tree (MST) and (b) a k-nearest neighbor graph (NNG) transformation of the input instance. To this end we theoretically derive minimum and maximum values for properties of MSTs and k-NNGs of Euclidean graphs. We analyze the differences in feature space between normalized versions of these features and their unnormalized counterparts. Our empirical investigations on various TSP benchmark sets point out that the feature scaling succeeds in eliminating the effect of the instance size. Eventually, a proof-of-concept AS-study shows promising results: models trained with normalized features tend to outperform those trained with the respective vanilla features.}}, author = {{Heins, Jonathan and Bossek, Jakob and Pohl, Janina and Seiler, Moritz and Trautmann, Heike and Kerschke, Pascal}}, booktitle = {{Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of genetic Algorithms (FOGA XVI)}}, editor = {{Computing Machinery Association, for}}, pages = {{1–15}}, publisher = {{Association for Computing Machinery}}, title = {{{On the Potential of Normalized TSP Features for Automated Algorithm Selection}}}, doi = {{10.1145/3450218.3477308}}, year = {{2021}}, } @inproceedings{46319, abstract = {{The detection of orchestrated and potentially manipulative campaigns in social media is far more meaningful than an- alyzing single account behaviour but also more challenging in terms of pattern recognition, data processing, and com- putational complexity. While supervised learning methods need an enormous amount of reliable ground truth data to find rather inflexible patterns, classical unsupervised learn- ing techniques need a lot of computational power to handle large amount of data. This makes them infeasible for real- time analysis. In this work, we demonstrate the applicability of text stream clustering for the real-time detection of coordi- nated campaigns.}}, author = {{Assenmacher, D and Adam, L and Trautmann, Heike and Grimme, C}}, booktitle = {{Proceedings of the Florida Artificial Intelligence Research Society Conference}}, title = {{{Towards Real-Time and Unsupervised Campaign Detection in Social Media}}}, year = {{2020}}, } @inproceedings{46328, abstract = {{In this paper, we rely on previous work proposing a modularized version of CMA-ES, which captures several alterations to the conventional CMA-ES developed in recent years. Each alteration provides significant advantages under certain problem properties, e.g., multi-modality, high conditioning. These distinct advancements are implemented as modules which result in 4608 unique versions of CMA-ES. Previous findings illustrate the competitive advantage of enabling and disabling the aforementioned modules for different optimization problems. Yet, this modular CMA-ES is lacking a method to automatically determine when the activation of specific modules is auspicious and when it is not. We propose a well-performing instance-specific algorithm configuration model which selects an (almost) optimal configuration of modules for a given problem instance. In addition, the structure of this configuration model is able to capture inter-dependencies between modules, e.g., two (or more) modules might only be advantageous in unison for some problem types, making the orchestration of modules a crucial task. This is accomplished by chaining multiple random forest classifiers together into a so-called Classifier Chain based on a set of numerical features extracted by means of Exploratory Landscape Analysis (ELA) to describe the given problem instances.}}, author = {{Prager, Raphael Patrick and Trautmann, Heike and Wang, Hao and Bäck, Thomas H. W. and Kerschke, Pascal}}, booktitle = {{Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)}}, pages = {{996–1003}}, title = {{{Per-Instance Configuration of the Modularized CMA-ES by Means of Classifier Chains and Exploratory Landscape Analysis}}}, doi = {{10.1109/SSCI47803.2020.9308510}}, year = {{2020}}, } @inproceedings{46320, abstract = {{The identification of coordinated campaigns within Social Media is a complex task that is often hindered by missing labels and large amounts of data that have to be processed. We propose a new two-phase framework that uses unsupervised stream clustering for detecting suspicious trends over time in a first step. Afterwards, traditional offline analyses are applied to distinguish between normal trend evolution and malicious manipulation attempts. We demonstrate the applicability of our framework in the context of the final days of the Brexit in 2019/2020.}}, author = {{Assenmacher, D and Clever, L and Pohl, JS and Trautmann, Heike and Grimme, C}}, booktitle = {{Proceedings of the International Conference on Human-Computer Interaction (HCII 2020): Social Computing and Social Media. Design, Ethics, User Behavior, and Social Network Analysis}}, editor = {{Meiselwitz, G}}, isbn = {{978-3-030-49570-1}}, pages = {{201–214}}, publisher = {{Springer International Publishing}}, title = {{{A Two-Phase Framework for Detecting Manipulation Campaigns in Social Media}}}, doi = {{10.1007/978-3-030-49570-1_14}}, year = {{2020}}, } @inproceedings{46325, abstract = {{Clustering is an important technique in data analysis which can reveal hidden patterns and unknown relationships in the data. A common problem in clustering is the proper choice of parameter settings. To tackle this, automated algorithm configuration is available which can automatically find the best parameter settings. In practice, however, many of our today’s data sources are data streams due to the widespread deployment of sensors, the internet-of-things or (social) media. Stream clustering aims to tackle this challenge by identifying, tracking and updating clusters over time. Unfortunately, none of the existing approaches for automated algorithm configuration are directly applicable to the streaming scenario. In this paper, we explore the possibility of automated algorithm configuration for stream clustering algorithms using an ensemble of different configurations. In first experiments, we demonstrate that our approach is able to automatically find superior configurations and refine them over time.}}, author = {{Carnein, Matthias and Trautmann, Heike and Bifet, Albert and Pfahringer, Bernhard}}, booktitle = {{Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECMLPKDD ’19)}}, isbn = {{978-3-030-43823-4}}, pages = {{137–143}}, title = {{{Towards Automated Configuration of Stream Clustering Algorithms}}}, doi = {{10.1007/978-3-030-43823-4_12}}, year = {{2020}}, } @inproceedings{46321, abstract = {{Social bots have recently gained attention in the context of public opinion manipulation on social media platforms. While a lot of research effort has been put into the classification and detection of such automated programs, it is still unclear how technically sophisticated those bots are, which platforms they target, and where they originate from. To answer these questions, we gathered repository data from open source collaboration platforms to identify the status-quo of social bot development as well as first insights into the overall skills of publicly available bot code.}}, author = {{Assenmacher, Dennis and Frischlich , Lena and Trautmann, Heike and Grimme, Christian and Adam, Lena}}, booktitle = {{Disinformation in open online media}}, editor = {{Grimme, Christian and Preuß, Mike and Takes, Frank and Waldherr, Annie}}, pages = {{101–114}}, publisher = {{Springer}}, title = {{{Inside the tool set of automation: Free social bot code revisited}}}, year = {{2020}}, } @inproceedings{46326, abstract = {{Machine learning has become one of the most important tools in data analysis. However, selecting the most appropriate machine learning algorithm and tuning its hyperparameters to their optimal values remains a difficult task. This is even more difficult for streaming applications where automated approaches are often not available to help during algorithm selection and configuration. This paper proposes the first approach for automated algorithm selection and configuration of stream clustering algorithms. We train an ensemble of different stream clustering algorithms and configurations in parallel and use the best performing configuration to obtain a clustering solution. By drawing new configurations from better performing ones, we are able to improve the ensemble performance over time. In large experiments on real and artificial data we show how our ensemble approach can improve upon default configurations and can also compete with a-posteriori algorithm configuration. Our approach is considerably faster than a-posteriori approaches and applicable in real-time. In addition, it is not limited to stream clustering and can be generalised to all streaming applications, including stream classification and regression.}}, author = {{Carnein, Matthias and Trautmann, Heike and Bifet, Albert and Pfahringer, Bernhard}}, booktitle = {{Proceedings of the 14$^th$ Learning and Intelligent Optimization Conference (LION 2020)}}, pages = {{80–95}}, title = {{{confStream: Automated Algorithm Selection and Configuration of Stream Clustering Algorithms}}}, doi = {{10.1007/978-3-030-53552-0_10}}, year = {{2020}}, } @inproceedings{46327, abstract = {{In online media environments, nostalgia can be used as important ingredient of propaganda strategies, specifically, by creating societal pessimism. This work addresses the automated detection of nostalgic text as a first step towards automatically identifying nostalgia-based manipulation strategies. We compare the performance of standard machine learning approaches on this challenge and demonstrate the successful transfer of the best performing approach to real-world nostalgia detection in a case study.}}, author = {{Lena, Clever and Frischlich, Lena and Trautmann, Heike and Grimme, Christian}}, booktitle = {{Disinformation in open online media}}, editor = {{Grimme, Christian and Preuß, Mike and Takes, Frank and Waldherr, Annie}}, pages = {{48–58}}, title = {{{Automated detection of nostalgic text in the context of societal pessimism}}}, year = {{2020}}, } @inproceedings{46329, abstract = {{The past decade has been characterized by a strong increase in the use of social media and a continuous growth of public online discussion. With the failure of purely manual moderation, platform operators started searching for semi-automated solutions, where the application of Natural Language Processing (NLP) and Machine Learning (ML) techniques is promising. However, this requires huge financial investments for algorithmic implementations, data collection, and model training, which only big players can afford. To support smaller or medium-sized media enterprises (SME), we developed an integrated comment moderation system as an IT platform. This platform acts as a service provider and offers Analytics as a Service (AaaS) to SMEs. Operating such a platform, however, requires a robust technology stack, integrated workflows and well-defined interfaces between all parties. In this paper, we develop and discuss a suitable IT architecture and present a prototypical implementation.}}, author = {{Riehle, Dennis M. and Niemann, Marco and Brunk, Jens and Assenmacher, Dennis and Trautmann, Heike and Becker, Jörg}}, booktitle = {{Social Computing and Social Media. Participation, User Experience, Consumer Experience, and Applications of Social Computing}}, editor = {{Meiselwitz, Gabriele}}, isbn = {{978-3-030-49576-3}}, pages = {{71–86}}, publisher = {{Springer International Publishing}}, title = {{{Building an Integrated Comment Moderation System – Towards a Semi-automatic Moderation Tool}}}, year = {{2020}}, }