Daniel Hernández

Daniel Hernández

Auto-generated profile, based on publicly available information

Daniel Hernández

University of Stuttgart

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 April 2023
Verified
Conference Paper
Open access
CGCosimo Gregucci
Cosimo Gregucci
MNMojtaba Nayyeri
Mojtaba Nayyeri
DHDaniel Hernández
Daniel Hernández
SSSteffen Staab
Steffen Staab
Predicting missing links between entities in a knowledge graph is a fundamental task to deal with the incompleteness of data on the Web. Knowledge graph embeddings map nodes into a vector space to predict new links, scoring them according to geometric criteria. Relations in the graph may follow patterns that can be learned, e.g., some relations might be symmetric and others might be hierarchical. However, the learning capability of different embedding models varies for each pattern and, so far, no single model can learn all patterns equally well. In this paper, we combine the query representations from several models in a unified one to incorporate patterns that are independently captured by each model. Our combination uses attention to select the most suitable model to answer each query. The models are also mapped onto a non-Euclidean manifold, the Poincaré ball, to capture structural patterns, such as hierarchies, besides relational patterns, such as symmetry. We prove that our combination provides a higher expressiveness and inference power than each model on its own. As a result, the combined model can learn relational and structural patterns. We conduct extensive experimental analysis with various link prediction benchmarks showing that the combined model outperforms individual models, including state-of-the-art approaches.

23 September 2016
Verified
Book Chapter
Closed access
PDF file
DHDaniel Hernández
Daniel Hernández
AHAidan Hogan
Aidan Hogan
CRCristian Riveros
Cristian Riveros
CRCarlos Rojas
Carlos Rojas
EZEnzo Zerega
Enzo Zerega


18 September 2018
Verified
Book Chapter
Closed access
PDF file
DHDaniel Hernández
Daniel Hernández
CGClaudio Gutierrez
Claudio Gutierrez
AHAidan Hogan
Aidan Hogan

16 October 2024
Verified
Book Chapter
Open access
PDF file
YHYunjie He
Yunjie He
DHDaniel Hernandez
Daniel Hernandez
MNMojtaba Nayyeri
Mojtaba Nayyeri
BXBo Xiong
Bo Xiong
YZYuqicheng Zhu
Yuqicheng Zhu
SSSteffen Staab
Steffen Staab
Query embedding approaches answer complex logical queries over incomplete knowledge graphs (KGs) by computing and operating on low-dimensional vector representations of entities, relations, and queries. However, current query embedding models heavily rely on excessively parameterized neural networks and cannot explain the knowledge learned from the graph. We propose a novel query embedding method, AConE, which explains the knowledge learned from the graph in the form of SROI− description logic axioms while being more parameter-efficient than most existing approaches. AConE associates queries to SROI− description logic concepts. Every SROI− concept is embedded as a cone in complex vector space, and each SROI− relation is embedded as a transformation that rotates and scales cones. We show theoretically that AConE can learn SROI− axioms, and defines an algebra whose operations correspond one-to-one to SROI− description logic concept constructs. Our empirical study on multiple query datasets shows that AConE achieves superior results over previous baselines with fewer parameters. Notably on the WN18RR dataset, AConE achieves significant improvement over baseline models. We provide comprehensive analyses showing that the capability to represent axioms positively impacts the results of query answering.

5 July 2023
Verified
Book Chapter
Closed access
PDF file
DEDiellza Elshani
Diellza Elshani
DHDaniel Hernandez
Daniel Hernandez
ALAlessio Lombardi
Alessio Lombardi
LSLasath Siriwardena
Lasath Siriwardena
Tobias SchwinnTobias Schwinn
Tobias Schwinn
TWThomas Wortmann
Thomas Wortmann