VLDB 2026 Research / reviewers in the wild / expert
Maren Pielka
dblp:247/6968
· DBLP profile ↗
11ranked-venue papers in the field
5as first author
9since 2021 · last 2025
0000-0001-9610-6026ORCID · corroborated
Domains — venue-derived; a paper can count in several
Information Retrieval & Web Search · 6 (2 first)Big Data, Cloud & Distributed Data Systems · 4 (3 first)Data Mining & Knowledge Discovery · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Improving Language Model Performance by Training on Prototypical Contradictions
Maren Pielka, Marie-Christin Freischlad, Svetlana Schmidt, Rafet Sifa |
ECIR (3) | 1 |
| 2025 | ArDia: Improving Arabic Dialectal Language Classification Using a Novel DatasetabstractDespite Arabic being one of the most widely spoken languages, there is a scarcity of available dialectal Arabic data. In this paper, we address this challenge by proposing a novel approach to data collection through the main use of video captions from TikTok, and other resources such as dictionaries and articles, resulting in the creation of the ArDia dataset. To the best of our knowledge, the ArDia dataset is the largest labeled dialectal Arabic dataset, containing over 900,000 examples, each labeled with its respective dialect. We further leverage this dataset to pretrain transformer-based models, ArDiaBERT and ArDiaGPT. Due to a lack of research on the Arabic models, we present a comprehensive study of Arabic dialect identification using the ArDia dataset on the dialect identification task. Hossam Elsafty, Bouthaina Abdou, Tobias Deußer, Maren Pielka, Christian Bauckhage, Rafet Sifa |
ICWSM | 4 |
| 2024 | A Comparative Study of Large Language Models for Named Entity Recognition in the Legal DomainabstractNamed Entity Recognition (NER) in the legal domain presents unique challenges due to specialized terminology and complex linguistic structures inherent in legal texts. While large language models (LLMs) like GPT-4, Llama-3, and others have significantly advanced natural language processing, their effectiveness in domain-specific tasks like legal Named Entity Recognition remains underexplored. This study conducts a comprehensive comparative analysis of eleven state-of-the-art LLMs on legal NER tasks across seven diverse datasets in five languages, namely English, Portuguese, German, Turkish, and Ukrainian. We evaluate the models’ performance using F1scores, focusing on their ability to accurately identify and classify legal entities. Our findings reveal significant variability in LLM performance across different languages and legal contexts, with proprietary models like GPT-4 achieving the highest overall scores. The results highlight the influence of model architecture, dataset characteristics, and prompt design on the effectiveness of legal NER tasks. This study provides valuable benchmarks for legal NER applications and offers insights into the strengths and limitations of current LLMs, guiding future research and development in legal natural language processing. Tobias Deußer, Lorenz Sparrenberg, Daniel Uedelhoven, Armin Berger, Maren Pielka, Lars Patrick Hillebrand, Christian Bauckhage, Rafet Sifa |
IEEE Big Data | 6 |
| 2024 | Insights About Causality Detection in Financial Text - Towards an Informed ApproachabstractWe perform a linguistic investigation of causality in financial reports, and find that there are a number of intricacies specific to this domain, making it hard for a machine learning model to accurately detect causal statements. Specifically, cause and effect clauses are oftentimes very subtle or implicit. Additionally, some degree of world knowledge and reasoning is necessary to successfully identify many of those statements. We apply our findings by prompting GPT-4o with the acquired knowledge to improve its predictive capabilities. The results suggest that an informed approach can help enhance the performance of a causality detection system, possibly allowing for more intelligent and light-weight solutions in the future. Maren Pielka, Rafet Sifa |
IEEE Big Data | 1 |
| 2024 | [Vision Paper] PRObot: Enhancing Patient-Reported Outcome Measures for Diabetic Retinopathy using Chatbots and Generative AIabstractWe present an outline of the first large language model (LLM) based chatbot application in the context of patient-reported outcome measures (PROMs) for diabetic retinopathy. By utilizing the capabilities of current LLMs, we enable patients to provide feedback about their quality of life and treatment progress via an interactive application. The proposed framework offers significant advantages over the current approach, which encompasses only qualitative collection of survey data or a static survey with limited answer options. Using the PROBot LLM-PROM application, patients will be asked tailored questions about their individual challenges, and can give more detailed feedback on the progress of their treatment. Based on this input, we will use machine learning to infer conventional PROM scores, which can be used by clinicians to evaluate the treatment status. The goal of the application is to improve adherence to the healthcare system and treatments, and thus ultimately reduce cases of subsequent vision impairment. The approach needs to be further validated using a survey and a clinical study. Maren Pielka, Jan H. Terheyden, Rafet Sifa |
IEEE Big Data | 1 |
| 2023 | Generating Prototypes for Contradiction Detection Using Large Language Models and Linguistic RulesabstractWe introduce a novel data generation method for contradiction detection, which leverages the generative power of large language models as well as linguistic rules. Our vision is to provide a condensed corpus of prototypical contradictions, allowing for in-depth linguistic analysis as well as efficient language model fine-tuning. To this end, we instruct the generative models to create contradicting statements with respect to descriptions of specific contradiction types. In addition, the model is also instructed to come up with completely new contradiction typologies. As an auxiliary approach, we use linguistic rules to construct simple contradictions such as those arising from negation, antonymy and numeric mismatch. We find that our methods yield promising results in terms of coherence and variety of the data. Further studies, as well as manual refinement are necessary to make use of this data in a machine learning setup. Maren Pielka, Svetlana Schmidt, Rafet Sifa |
IEEE Big Data | 1 |
| 2023 | Improving Zero-Shot Text Matching for Financial Auditing with Large Language ModelsabstractAuditing financial documents is a very tedious and time-consuming process. As of today, it can already be simplified by employing AI-based solutions to recommend relevant text passages from a report for each legal requirement of rigorous accounting standards. However, these methods need to be fine-tuned regularly, and they require abundant annotated data, which is often lacking in industrial environments. Hence, we present ZeroShotALI, a novel recommender system that leverages a state-of-the-art large language model (LLM) in conjunction with a domain-specifically optimized transformer-based text-matching solution. We find that a two-step approach of first retrieving a number of best matching document sections per legal requirement with a custom BERT-based model and second filtering these selections using an LLM yields significant performance improvements over existing approaches. Lars Patrick Hillebrand, Armin Berger, Tobias Deußer, Tim Dilmaghani Khameneh, Mohamed Khaled, Bernd Kliem, Rüdiger Loitz, Maren Pielka, David Leonhard, Christian Bauckhage, Rafet Sifa |
DocEng | 8 |
| 2023 | Towards Linguistically Informed Multi-objective Transformer Pre-training for Natural Language Inference
Maren Pielka, Svetlana Schmidt, Lisa Pucknat, Rafet Sifa |
ECIR (2) | 1 |
| 2021 | ALiBERT: improved automated list inspection (ALI) with BERTabstractWe consider Automated List Inspection (ALI), a content-based text recommendation system that assists auditors in matching relevant text passages from notes in financial statements to specific law regulations. ALI follows a ranking paradigm in which a fixed number of requirements per textual passage are shown to the user. Despite achieving impressive ranking performance, the user experience can still be improved by showing a dynamic number of recommendations. Besides, existing models rely on a feature-based language model that needs to be pre-trained on a large corpus of domain-specific datasets. Moreover, they cannot be trained in an end-to-end fashion by jointly optimizing with language model parameters. In this work, we alleviate these concerns by considering a multi-label classification approach that predicts dynamic requirement sequences. We base our model on pre-trained BERT that allows us to fine-tune the whole model in an end-to-end fashion, thereby avoiding the need for training a language representation model. We conclude by presenting a detailed evaluation of the proposed model on two German financial datasets. Rajkumar Ramamurthy, Maren Pielka, Robin Stenzel, Christian Bauckhage, Rafet Sifa, Tim Dilmaghani Khameneh, Ulrich Warning, Bernd Kliem, Rüdiger Loitz |
DocEng | 2 |
| 2020 | Adapting Established Text Representations for Predicting Review Sentiment in TurkishabstractNatural Language Processing, and specifically Sentiment Analysis are still unexplored topics with respect to Turkish text. A key challenge is to extract meaningful word and paragraph representations. We provide a comprehensive overview on pre-processing and featurization methods for this problem. Our focus is on the inherent difficulties that come with analyzing Turkish real-world data from the e-commerce domain, such as inconsistent spelling or complicated morphological and grammatical structures. Izel Çavusoglu, Maren Pielka, Rafet Sifa |
DSAA | 2 |
| 2019 | Towards Automated Auditing with Machine LearningabstractWe present the Automated List Inspection (ALI) tool that utilizes methods from machine learning, natural language processing, combined with domain expert knowledge to automate financial statement auditing. ALI is a content based context-aware recommender system, that matches relevant text passages from the notes to the financial statement to specific law regulations. In this paper, we present the architecture of the recommender tool which includes text mining, language modeling, unsupervised and supervised methods that range from binary classification models to deep recurrent neural networks. Next to our main findings, we present quantitative and qualitative comparisons of the algorithms as well as concepts for how to further extend the functionality of the tool. Rafet Sifa, Anna Ladi, Maren Pielka, Rajkumar Ramamurthy, Lars Patrick Hillebrand, Birgit Kirsch, David Biesner, Robin Stenzel, Thiago Bell, Max Lübbering, Ulrich Nütten, Christian Bauckhage, Ulrich Warning, Benedikt Fürst, Tim Dilmaghani Khameneh, Daniel Thom, Ilgar Huseynov, Roland Kahlert, Jennifer Schlums, Hisham Ismail, Bernd Kliem, Rüdiger Loitz |
DocEng | 3 |