Arrow Research search

Author name cluster

Sören Auer

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.

4 papers
2 author rows

Possible papers

4

NeurIPS Conference 2025 Conference Paper

EmoNet-Face: An Expert-Annotated Benchmark for Synthetic Emotion Recognition

  • Christoph Schuhmann
  • Robert Kaczmarczyk
  • Gollam Rabby
  • Maurice Kraus
  • Felix Friedrich
  • Huu Nguyen
  • Kalyan Sai Krishna
  • Kourosh Nadi

Effective human-AI interaction relies on AI's ability to accurately perceive and interpret human emotions. Current benchmarks for vision and vision-language models are severely limited, offering a narrow emotional spectrum that overlooks nuanced states (e. g. , bitterness, intoxication) and fails to distinguish subtle differences between related feelings (e. g. , shame vs. embarrassment). Existing datasets also often use uncontrolled imagery with occluded faces and lack demographic diversity, risking significant bias. To address these critical gaps, we introduce EmoNet Face, a comprehensive benchmark suite. EmoNet Face features: (1) A novel 40-category emotion taxonomy, meticulously derived from foundational research to capture finer details of human emotional experiences. (2) Three large-scale, AI-generated datasets (EmoNet HQ, Binary, and Big) with explicit, full-face expressions and controlled demographic balance across ethnicity, age, and gender. (3) Rigorous, multi-expert annotations for training and high-fidelity evaluation. (4) We build Empathic Insight Face, a model achieving human-expert-level performance on our benchmark. The publicly released EmoNet Face suite—taxonomy, datasets, and model—provides a robust foundation for developing and evaluating AI systems with a deeper understanding of human emotions.

ECAI Conference 2024 Conference Paper

A Neuro-symbolic Approach for Faceted Search in Digital Libraries

  • Mutahira Khalid
  • Sören Auer
  • Markus Stocker

Academic Search Engines (ASEs) are crucial for navigating the vast landscape of scholarly literature. Traditionally, these engines rely on keyword-based search, supplemented by predefined facets encompassing metadata such as research field, publication year, type, authors, and language. However, ASEs are limited in their ability to generate dynamic facets in real-time based on article contents. This limitation impedes the efficient exploration and navigation of large article collections. We propose an approach that addresses this limitation by dynamically generating facets using article abstracts. We introduce three distinct methods for dynamic facet generation: (1) KB2 (based on Knowledge Bases) utilizes two knowledge bases (KB) to extract facet values and their associated facets; (2) KBLLM (based on a Knowledge Base and a Large Language Model) utilizes a KB for extracting facet values and a large language model (LLM) to categorize these values by predicting facets; finally, (3) KBLLMKA (based on a Knowledge Base and a Large Language Model with Knowledge Augmentation) combines KB-spotting with facet-value pair extraction and adds this information as auxiliary data to enhance LLM’s facet prediction capabilities. We evaluated the effectiveness of these methods with a user study, performance evaluation, and comparative analyses, which showed the effectiveness of the approach.

ECAI Conference 2014 Conference Paper

AGDISTIS - Agnostic Disambiguation of Named Entities Using Linked Open Data

  • Ricardo Usbeck
  • Axel-Cyrille Ngonga Ngomo
  • Michael Röder
  • Daniel Gerber
  • Sandro Athaíde Coelho
  • Sören Auer
  • Andreas Both 0001

Over the last decades, several billion Web pages have been made available on the Web. The ongoing transition from the current Web of unstructured data to the Data Web yet requires scalable and accurate approaches for the extraction of structured data in RDF (Resource Description Framework) from these websites. One of the key steps towards extracting RDF from text is the disambiguation of named entities. We address this issue by presenting AGDISTIS, a novel knowledge-base-agnostic approach for named entity disambiguation. Our approach combines the Hypertext-Induced Topic Search (HITS) algorithm with label expansion strategies and string similarity measures. Based on this combination, AGDISTIS can efficiently detect the correct URIs for a given set of named entities within an input text.

AAAI Conference 2012 Conference Paper

Usage-Centric Benchmarking of RDF Triple Stores

  • Mohamed Morsey
  • Jens Lehmann
  • Sören Auer
  • Axel-Cyrille Ngonga Ngomo

A central component in many applications is the underlying data management layer. In Data-Web applications, the central component of this layer is the triple store. It is thus evident that finding the most adequate store for the application to develop is of crucial importance for individual projects as well as for data integration on the Data Web in general. In this paper, we propose a generic benchmark creation procedure for SPARQL, which we apply to the DBpedia knowledge base. In contrast to previous approaches, our benchmark is based on queries that were actually issued by humans and applications against existing RDF data not resembling a relational schema. In addition, our approach does not only take the query string but also the features of the queries into consideration during the benchmark generation process. Our generic procedure for benchmark creation is based on query-log mining, SPARQL feature analysis and clustering. After presenting the method underlying our benchmark generation algorithm, we use the generated benchmark to compare the popular triple store implementations Virtuoso, Sesame, Jena-TDB, and BigOWLIM. 1 2

v2026.09.13