activity
20192022
most citedPyKEEN 1.0: A Python Library for Training and Evaluating Knowledge Graph Embeddings

89 citations · 113 across the 5 of their papers we have counts for

collaborators

11 papers

cs.CL20223 cited

Towards a Holistic View on Argument Quality Prediction

Michael Fromm, Max Berrendorf, Johanna Reiml +4

Argumentation is one of society's foundational pillars, and, sparked by advances in NLP and the vast availability of text data, automated mining of arguments receives increasing at…

cs.LG20224 cited

A Unified Framework for Rank-based Evaluation Metrics for Link Prediction in Knowledge Graphs

Charles Tapley Hoyt, Max Berrendorf, Mikhail Galkin +2

The link prediction task on knowledge graphs without explicit negative triples in the training data motivates the usage of rank-based metrics. Here, we review existing rank-based m…

cs.LG202211 cited

An Open Challenge for Inductive Link Prediction on Knowledge Graphs

Mikhail Galkin, Max Berrendorf, Charles Tapley Hoyt

An emerging trend in representation learning over knowledge graphs (KGs) moves beyond transductive link prediction tasks over a fixed set of known entities in favor of inductive ta…

cs.LG2021

Improving Inductive Link Prediction Using Hyper-Relational Facts

Mehdi Ali, Max Berrendorf, Mikhail Galkin +4

For many years, link prediction on knowledge graphs (KGs) has been a purely transductive task, not allowing for reasoning on unseen entities. Recently, increasing efforts are put i…

cs.CY20206 cited

Argument Mining Driven Analysis of Peer-Reviews

Michael Fromm, Evgeniy Faerman, Max Berrendorf +7

Peer reviewing is a central process in modern research and essential for ensuring high quality and reliability of published work. At the same time, it is a time-consuming process a…

cs.DB2020

Memory-Efficient RkNN Retrieval by Nonlinear k-Distance Approximation

Sandra Obermeier, Max Berrendorf, Peer Kröger

The reverse k-nearest neighbor (RkNN) query is an established query type with various applications reaching from identifying highly influential objects over incrementally updating…