EDBT 2026 Demo / reviewers in the wild / expert
Nicolas Hubert
dblp:329/0553
· DBLP profile ↗
5ranked-venue papers in the field
5as first author
5since 2021 · last 2024
0000-0002-4682-422XORCID · corroborated
Domains — venue-derived; a paper can count in several
Knowledge Engineering, Semantic Web & Information Systems · 5 (5 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Treat Different Negatives Differently: Enriching Loss Functions with Domain and Range Constraints for Link Prediction
Nicolas Hubert, Pierre Monnin, Armelle Brun, Davy Monticolo |
ESWC (1) | 1 |
| 2024 | PyGraft: Configurable Generation of Synthetic Schemas and Knowledge Graphs at Your Fingertips
Nicolas Hubert, Pierre Monnin, Mathieu d'Aquin, Davy Monticolo, Armelle Brun |
ESWC (2) | 1 |
| 2024 | Do Similar Entities Have Similar Embeddings?
Nicolas Hubert, Heiko Paulheim, Armelle Brun, Davy Monticolo |
ESWC (1) | 1 |
| 2023 | Schema First! Learn Versatile Knowledge Graph Embeddings by Capturing Semantics with MASCHInEabstractKnowledge graph embedding models (KGEMs) have gained considerable traction in recent years. These models learn a vector representation of knowledge graph entities and relations, a.k.a. knowledge graph embeddings (KGEs). Learning versatile KGEs is desirable as it makes them useful for a broad range of tasks. However, KGEMs are usually trained for a specific task, which makes their embeddings task-dependent. In parallel, the widespread assumption that KGEMs actually create a semantic representation of the underlying entities and relations (e.g., project similar entities closer than dissimilar ones) has been challenged. In this work, we design heuristics for generating protographs – small, modified versions of a KG that leverage RDF/S information. The learnt protograph-based embeddings are meant to encapsulate the semantics of a KG, and can be leveraged in learning KGEs that, in turn, also better capture semantics. Extensive experiments on various evaluation benchmarks demonstrate the soundness of this approach, which we call Modular and Agnostic SCHema-based Integration of protograph Embeddings (MASCHInE). In particular, MASCHInE helps produce more versatile KGEs that yield substantially better performance for entity clustering and node classification tasks. For link prediction, using MASCHinE substantially increases the number of semantically valid predictions with equivalent rank-based performance. Nicolas Hubert, Heiko Paulheim, Pierre Monnin, Armelle Brun, Davy Monticolo |
K-CAP | 1 |
| 2022 | New Strategies for Learning Knowledge Graph Embeddings: The Recommendation Case
Nicolas Hubert, Pierre Monnin, Armelle Brun, Davy Monticolo |
EKAW | 1 |