Knowledge Engineering and DIscovery (KEDI)

The Knowledge Engineering and DIscovery research group makes sense of data. We extract simple statements from unstructured texts or complex linked data sets, integrate them into consolidated perspectives and derive new facts and their explanations from that. This way we empower people with disruptive knowledge discovery methods, focusing especially on the domains of life sciences and digital humanities.

The research of the KEDI group focuses on:

Data Integration
Graph-based Knowledge Representation
Graph Mining and Statistical Relational Learning

“Our Knowledge Engineering activities intend to help data consumers and publishers to manipulate the data by providing innovative ways to search for relevant datasets/vocabularies and by providing new insights into their own data/vocabulary use.”

Knowledge Engineering

Knowledge Graphs – Graphs are useful for modeling objects, their relationships to each other, and the conceptual structures wherein which they lie. In our research, we explore the possibility to use both graph and geometric interpretations of the knowledge graph to support new type of analysis.

Ontology Design – The adoption of Semantic Web technologies (RDF, RDFS, OWL) has lead to the emergence of large datasets using richer representation models capturing the data semantics. The contribution of our research is to promote and facilitate the reuse of well documented ontologies or vocabularies in the Linked Data ecosystem.

Related technology: Linked Open Vocabularies

Linked Data Publication – Data providers have so far published hundreds of linked datasets and billions of triples on the Web, thus contributing to the birth of the so-called “Web of Data”. Nevertheless, Linked Data publication still faces problems that hinder its adoption. Our research focuses on monitoring and providing data publishers with empirical evidence of use and accessibility of their data.

Related technology: SPARQLES, LOD4All

“With knowledege graphs, scientists have now the means to aggregate semantic information from various sources. The challenge is not only to extract meaningful information from this data, but to gain knowledge, to discover previously unknown insight, look for patterns, and to make sense of the data.”

Knowledge Discovery

Graph Summarisation and Serendipitous Browsing – With more than millions nodes and edges, it is, for a human, almost impossible to understand the information encoded in large graphs. We are investigating graph summarisation methods to help users extract and understand the underlying information. Related technology: Semantic Text Exploration, Linkspire

Statistical Relational Learning – While a large majority of Machine Learning techniques focus on propositional data which is assumed to be identically and independently distributed, Many real world datasets are fundamentally based on complex relational structure where the data distribution is neither identical nor independent. An emerging research area, Statistical Relational Learning (SRL), attempts to learn in relational domain.

Distributional Data Semantics – Distributional data semantics is a bleeding edge field of research that aims at providing insights into the meaning of large and heterogeneous data sets in a bottom-up manner, using the implicit patterns emerging from the data themselves. The main contribution of our research consists of combining the classical distributional principles with graph analysis methods and symbolic reasoning. Related technology: CORAAL, SKIMMR

Tools & demos

Publications View all »

30 entries « 2 of 10 »

2017

Minervini, Pasquale; Costabello, Luca; Muñoz, Emir; Nováček,; Vandenbussche, Pierre-Yves

Regularizing Neural Knowledge Graph Embeddings via Equivalence and Inversion Axioms (Inproceeding)

Machine Learning and Knowledge Discovery in Databases - European Conference, {ECML} {PKDD} 2017, Skopje, Macedonia, 18-22 September (in press), Springer, 2017.

(BibTeX)

Costabello, Luca; Vandenbussche, Pierre-Yves; Shukair, Gofran; Deliot, Corine; Wilson, Neil

Traffic Analytics for Linked Data Publishers (Inproceeding)

Blomqvist, Eva; Maynard, Diana; Gangemi, Aldo; Hoekstra, Rinke; Hitzler, Pascal; Hartig, Olaf (Ed.): The Semantic Web: 14th International Conference, ESWC 2017, Portoro{v{z}}, Slovenia, May 28 -- June 1, 2017, Proceedings, Part I, pp. 3–18, Springer International Publishing, 2017.

(Links | BibTeX)

2016

Muñoz, Emir

On Learnability of Constraints from RDF Data (Inproceeding)

The Semantic Web. Latest Advances and New Domains - 13th European Semantic Web Conference, ESWC 2016, Crete, Greece, May 29 - June 2, 2015. Proceedings, pp. 834-844, Springer, 2016.

(BibTeX)

30 entries « 2 of 10 »

Latest News View all »

Translating Embeddings (TransE) – Knowledge Graph Mining

TransE is a textbook case link prediction model in multi-relational data (knowledge graphs). Learn more about Link Prediction models in this post presenting in a simple way Translating Embeddings (TransE), a method for the prediction of missing relationships in knowledge graphs: http://pyvandenbussche.info/2017/translating-embeddings-transe/

Opening Position – Research Assistant – Knowledge Graph Construction

Insight, NUI Galway are in a collaboration with Fujitsu Laboratories, Limited. The collaboration focuses on research and development in the area of knowledge discovery and explanation from open biomedical data (e.g., drug and protein databases or scientific publications). As a part of the programme we are looking for a research assistant who will be located in Galway, Ireland and will help us with knowledge graph construction (extraction, consolidation and cleansing). The research will be realised in close collaboration with Fujitsu Laboratories in Japan and Fujitsu business units. This will be an exciting role with the opportunity to work on cutting-edge research that is immediately being applied in realistic proof of concepts as a part of our ongoing collaborations with experts in biology, medicine and pharmacology. Application and information can be found on Insight Website: Application end date: Friday, 15 September, 2017