Fabian Suchanek

Fabian Suchanek

Auto-generated profile, based on publicly available information

Fabian Suchanek

Télécom Paris Institut Polytechnique de Paris France

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
27 May 2020
Verified
Book Chapter
Open access
PDF file
TTThomas Pellissier Tanon
Thomas Pellissier Tanon
GWGerhard Weikum
Gerhard Weikum
FSFabian Suchanek
Fabian Suchanek
YAGO is one of the large knowledge bases in the Linked Open Data cloud. In this resource paper, we present its latest version, YAGO 4, which reconciles the rigorous typing and constraints of schema.org with the rich instance data of Wikidata. The resulting resource contains 2 billion type-consistent triples for 64 Million entities, and has a consistent ontology that allows semantic reasoning with OWL 2 description logics.

12 July 2021 in Foundations and Trends® in Databases
Verified
Journal Article
Closed access
PDF file
GWGerhard Weikum
Gerhard Weikum
XDXin Luna Dong
Xin Luna Dong
SRSimon Razniewski
Simon Razniewski
FSFabian Suchanek
Fabian Suchanek
Equipping machines with comprehensive knowledge of the world’s entities and their relationships has been a longstanding goal of AI. Over the last decade, large-scale knowledge bases, also known as knowledge graphs, have been automatically constructed from web contents and text sources, and have become a key asset for search engines. This machine knowledge can be harnessed to semantically interpret textual phrases in news, social media and web tables, and contributes to question answering, natural language processing and data analytics. This article surveys fundamental concepts and practical methods for creating and curating large knowledge bases. It covers models and methods for discovering and canon-icalizing entities and their semantic types and organizing them into clean taxonomies. On top of this, the article discusses the automatic extraction of entity-centric properties. To support the long-term life-cycle and the quality assurance of machine knowledge, the article presents methods for constructing open schemas and for knowledge curation. Case studies on academic projects and industrial knowledge graphs complement the survey of concepts and methods.

10 July 2024
Verified
Conference Paper
Open access
FSFabian M. Suchanek
Fabian M. Suchanek
Mehwish AlamMehwish Alam
Mehwish Alam
TBThomas Bonald
Thomas Bonald
LCLihu Chen
Lihu Chen
PPPierre-Henri Paris
Pierre-Henri Paris
JSJules Soria
Jules Soria
Knowledge Bases (KBs) find applications in many knowledge-intensive tasks and, most notably, in information retrieval. Wikidata is one of the largest public general-purpose KBs. Yet, its collaborative nature has led to a convoluted schema and taxonomy. The YAGO~4 KB cleaned up the taxonomy by incorporating the ontology of Schema.org, resulting in a cleaner structure amenable to automated reasoning. However, it also cut away large parts of the Wikidata taxonomy, which is essential for information retrieval. In this paper, we extend YAGO~4 with a large part of the Wikidata taxonomy -- while respecting logical constraints and the distinction between classes and instances. This yields YAGO~4.5, a new, logically consistent version of YAGO that adds a rich layer of informative classes. An intrinsic and an extrinsic evaluation show the value of the new resource.

23 February 2024 in ACM Computing Surveys
Verified
Journal Article
Open access
SRSimon Razniewski
Simon Razniewski
HAHiba Arnaout
Hiba Arnaout
SGShrestha Ghosh
Shrestha Ghosh
FSFabian Suchanek
Fabian Suchanek
General-purpose knowledge bases (KBs) are a cornerstone of knowledge-centric AI. Many of them are constructed pragmatically from web sources and are thus far from complete. This poses challenges for the consumption as well as the curation of their content. While several surveys target the problem of completing incomplete KBs, the first problem is arguably to know whether and where the KB is incomplete in the first place, and to which degree. In this survey, we discuss how knowledge about completeness, recall, and negation in KBs can be expressed, extracted, and inferred. We cover (i) the logical foundations of knowledge representation and querying under partial closed-world semantics; (ii) the estimation of this information via statistical patterns; (iii) the extraction of information about recall from KBs and text; (iv) the identification of interesting negative statements; and (v) relaxed notions of relative recall. This survey is targeted at two types of audiences: (1) practitioners who are interested in tracking KB quality, focusing extraction efforts, and building quality-aware downstream applications; and (2) data management, knowledge base, and semantic web researchers who wish to understand the state-of-the-art of knowledge bases beyond the open-world assumption. Consequently, our survey presents both fundamental methodologies and the results that they have produced, and gives practice-oriented recommendations on how to choose between different approaches for a problem at hand.

21 October 2024
Verified
Conference Paper
Open access
RHRajaa El Hamdani
Rajaa El Hamdani
TBThomas Bonald
Thomas Bonald
FMFragkiskos Malliaros
Fragkiskos Malliaros
NHNils Holzenberger
Nils Holzenberger
FSFabian Suchanek
Fabian Suchanek

1 January 2024
Verified
Conference Paper
Open access
PDF file
ZSZacchary Sadeddine
Zacchary Sadeddine
JOJuri Opitz
Juri Opitz
FSFabian Suchanek
Fabian Suchanek
Zacchary Sadeddine, Juri Opitz, Fabian Suchanek. Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2024.