Ryan Wisnesky | How To Optimally Merge Knowledge Graphs With Category Theory
KGC | The Complete Collection • 19m
In this talk we describe a new technique for merging knowledge graphs: translating the knowledge graph schemas into categories and the knowledge graph data into functors, then applying the "co-limit/pushout" construction from a branch of mathematics called category theory to merge these categories and functors, and then converting the categories and functors back into knowledge graph schemas and data. We show how this process is mathematically optimal (results in the highest possible data quality in the merge), and describe several real-world use cases of knowledge graph merge that have been implemented in an open-source tool.
Up Next in KGC | The Complete Collection
-
Sergio Baranzini | SPOKE: A Biomedica...
SPOKE is a biomedical knowledge graph containing factual data on various biomedical fields including genetics, molecular biology, physiology, metabolomics, pharmacology and clinical medicine. SPOKE can be used to repurpose medications, predict patient outcomes, and accelerate drug development, am...
-
Shekhar Iyer | Multi-Modal Retrieval ...
Recent Advances in representation learning and application of Deep Neural Nets towards structured data and Knowledge Graphs (KG) is enabling opportunities for multi-modal representation of entities and relations. We can now aspire to build access to data encoded in knowledge Graphs through one of...
-
Stefan Plantikow | The Upcoming GQL S...
Following the GQL Manifesto, the ISO working group that develops the SQL standard voted to initiate a project for a new database language: GQL (Graph Query Language). This talk presents an overview of the goals of GQL and the progress so far, key aspects of the language design such as the basic d...
