Arrow Research search

Author name cluster

Paramita Mirza

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
2 author rows

Possible papers

2

ECAI Conference 2025 Conference Paper

Teuken-7B-Base & Teuken-7B-Instruct: Towards European LLMs

  • Mehdi Ali
  • Michael Fromm 0001
  • Klaudia Thellmann
  • Jan Ebert
  • Alexander Arno Weber
  • Richard Rutmann
  • Charvi Jain
  • Max Lübbering

We present two multilingual LLMs, Teuken 7B-base and Teuken 7B-instruct, designed to embrace Europe’s linguistic diversity by supporting all 24 official languages of the European Union. Trained on a dataset comprising around 60% non-English data and utilizing a custom multilingual tokenizer, our models address the limitations of existing Large Language Models (LLMs) that predominantly focus on English or a few high-resource languages. We detail the models’ development principles, i. e. , data composition, tokenizer optimization, and training methodologies. The models demonstrate strong performance across multilingual benchmarks, as evidenced by their performance on European versions of ARC, HellaSwag, and TruthfulQA.

IJCAI Conference 2018 Conference Paper

Completeness-aware Rule Learning from Knowledge Graphs

  • Thomas Pellissier Tanon
  • Daria Stepanova
  • Simon Razniewski
  • Paramita Mirza
  • Gerhard Weikum

Knowledge graphs (KGs) are huge collections of primarily encyclopedic facts that are widely used in entity recognition, structured search, question answering, and similar. Rule mining is commonly applied to discover patterns in KGs. However, unlike in traditional association rule mining, KGs provide a setting with a high degree of incompleteness, which may result in the wrong estimation of the quality of mined rules, leading to erroneous beliefs such as all artists have won an award. In this paper we propose to use (in-)completeness meta-information to better assess the quality of rules learned from incomplete KGs. We introduce completeness-aware scoring functions for relational association rules. Experimental evaluation both on real and synthetic datasets shows that the proposed rule ranking approaches have remarkably higher accuracy than the state-of-the-art methods in uncovering missing facts.

v2026.09.13