• Corpus ID: 184487996

WikiDataSets : Standardized sub-graphs from WikiData

@article{Boschin2019WikiDataSetsS,
  title={WikiDataSets : Standardized sub-graphs from WikiData},
  author={Armand Boschin},
  journal={ArXiv},
  year={2019},
  volume={abs/1906.04536}
}
Developing new ideas and algorithms in the fields of graph processing and relational learning requires public datasets. While Wikidata is the largest open source knowledge graph, involving more than fifty million entities, it is larger than needed in many cases and even too large to be processed easily. Still, it is a goldmine of relevant facts and relations. Using this knowledge graph is time consuming and prone to task specific tuning which can affect reproducibility of results. Providing a… 

Figures and Tables from this paper

Automatic Construction of Domain-Specific Knowledge Graphs from Wikidata

  • Computer Science
  • 2020
A pipeline is developed which, given a domain of interest such as sport or technology, extracts a domain-specific seed knowledge graph from Wikidata that can be used for question-answering, content search or content recommendation.

Domain specific ontologies from Linked Open Data (LOD)

This work discusses the experience bootstrapping one such ontology for IT with a domain-agnostic pipeline, and extending it using domain-specific glossaries.

Domain-agnostic Construction of Domain-Specific Ontologies

In this poster, we present a novel approach to construct domain-specific ontologies with minimal user intervention from open data sources. We leverage techniques such as clustering and graph

A Model-Agnostic Recommendation Explanation System Based on Knowledge Graph

This paper proposes a model-agnostic recommendation explanation system, which can improve the explainability of existing recommender systems and shows that the system can provide more convincing and diverse personalized explanations for recommended items compared with existing systems.

Database and Expert Systems Applications: 31st International Conference, DEXA 2020, Bratislava, Slovakia, September 14–17, 2020, Proceedings, Part II

Details of Keynote Talks Knowledge Graph for Drug Discovery are presented, which aims to provide a “robust” knowledge graph for drug discovery that can be applied in the context of clinical trials.

References

SHOWING 1-10 OF 11 REFERENCES

PyTorch-BigGraph: A Large-scale Graph Embedding System

PyTorch-BigGraph (PBG), an embedding system that incorporates several modifications to traditional multi-relation embedding systems that allow it to scale to graphs with billions of nodes and trillions of edges, is presented.

Convolutional 2D Knowledge Graph Embeddings

ConvE, a multi-layer convolutional network model for link prediction, is introduced, and it is found that ConvE achieves state-of-the-art Mean Reciprocal Rank across all datasets.

Link Prediction on N-ary Relational Data

A method to conduct Link Prediction on N-ary relational data, thus called NaLP, is proposed, which explicitly models the relatedness of all the role-value pairs in the same n-ARY relational fact.

Knowledge Graph Embedding via Dynamic Mapping Matrix

A more fine-grained model named TransD, which is an improvement of TransR/CTransR, which not only considers the diversity of relations, but also entities, which makes it can be applied on large scale graphs.

Translating Embeddings for Modeling Multi-relational Data

TransE is proposed, a method which models relationships by interpreting them as translations operating on the low-dimensional embeddings of the entities, which proves to be powerful since extensive experiments show that TransE significantly outperforms state-of-the-art methods in link prediction on two knowledge bases.

Complex and Holographic Embeddings of Knowledge Graphs: A Comparison

This short paper provides a comparison of two state-of-the-art knowledge graph embeddings for which their equivalence has recently been established, i.e., ComplEx and HolE.

Analogical Inference for Multi-relational Embeddings

This paper proposes a novel framework for optimizing the latent representations with respect to thealogical properties of the embedded entities and relations, and offers an elegant unification of several well-known methods in multi-relational embedding.

ActiveLink: Deep Active Learning for Link Prediction in Knowledge Graphs

A novel deep active learning framework, ActiveLink, which can be applied to actively train any neural link predictor, inspired by recent advances in Bayesian deep learning, which takes a Bayesian view on neural link predictors, thereby enabling uncertainty sampling forDeep active learning.

Fast unfolding of communities in large networks

This work proposes a heuristic method that is shown to outperform all other known community detection methods in terms of computation time and the quality of the communities detected is very good, as measured by the so-called modularity.

Knowledge Graph Embedding by Translating on Hyperplanes

This paper proposes TransH which models a relation as a hyperplane together with a translation operation on it and can well preserve the above mapping properties of relations with almost the same model complexity of TransE.