A conditional key is a key constraint that is valid in only a part of the data. In this paper, we show how such keys can be mined automatically on large knowledge bases (KBs). For this, we combine techniques from key mining with techniques from rule mining. We show that our method can scale to KBs of millions of facts. We also show that the conditional keys we mine can improve the quality of entity linking by up to 47 percentage points.This research was supported by the grants ANR-11-LABEX-0045-DIGICOSM, ANR-16-CE23-0007-01 (DICOS'), the "Machine Learning for Big Data'' of Télécom ParisTech, and by the AGINFRA+ project (Grant Agreement no. 731001)
Efficient reasoning in large knowledge bases is an important problem for AI systems. Hand-optimizat...
Constraint-based rule miners find all rules in a given dataset meeting user-specified constraints su...
Research Papers: Linked Data - ISBN: 978-3-642-33875-5 (LNAI Series Editors)International audienceTh...
A conditional key is a key constraint that is valid in only a part of the data. In this paper, we sh...
Abstract. Keys play a fundamental role in all data models. They allow database systems to uniquely i...
Keys play a fundamental role in all data models. They allow database systems to uniquely identify da...
Keys for graphs uses the topology and value constraints needed to uniquely identify entities in a gr...
Entity-centric knowledge graphs (KGs) are becoming increasingly popular for gathering information ab...
A knowledge base (KB) is a formal collection of knowledge about the world. In this paper, we explain...
Identification of (composite) key attributes is of fundamental importance for many different data ma...
Cardinality is an important structural aspect of data that has not received enough attention in the ...
International audienceKD2R allows the automatic discovery of composite key constraints in RDF data s...
International audienceWe describe RuDiK, an algorithm and a system for mining declarative rules over...
International audienceGiven a knowledge base (KB), rule mining finds rules such as "If two people ar...
Efficient reasoning in large knowledge bases is an important problem for AI systems. Hand-optimizati...
Efficient reasoning in large knowledge bases is an important problem for AI systems. Hand-optimizat...
Constraint-based rule miners find all rules in a given dataset meeting user-specified constraints su...
Research Papers: Linked Data - ISBN: 978-3-642-33875-5 (LNAI Series Editors)International audienceTh...
A conditional key is a key constraint that is valid in only a part of the data. In this paper, we sh...
Abstract. Keys play a fundamental role in all data models. They allow database systems to uniquely i...
Keys play a fundamental role in all data models. They allow database systems to uniquely identify da...
Keys for graphs uses the topology and value constraints needed to uniquely identify entities in a gr...
Entity-centric knowledge graphs (KGs) are becoming increasingly popular for gathering information ab...
A knowledge base (KB) is a formal collection of knowledge about the world. In this paper, we explain...
Identification of (composite) key attributes is of fundamental importance for many different data ma...
Cardinality is an important structural aspect of data that has not received enough attention in the ...
International audienceKD2R allows the automatic discovery of composite key constraints in RDF data s...
International audienceWe describe RuDiK, an algorithm and a system for mining declarative rules over...
International audienceGiven a knowledge base (KB), rule mining finds rules such as "If two people ar...
Efficient reasoning in large knowledge bases is an important problem for AI systems. Hand-optimizati...
Efficient reasoning in large knowledge bases is an important problem for AI systems. Hand-optimizat...
Constraint-based rule miners find all rules in a given dataset meeting user-specified constraints su...
Research Papers: Linked Data - ISBN: 978-3-642-33875-5 (LNAI Series Editors)International audienceTh...