# Supervised Typing of Big Graphs using Semantic Embeddings

## TL;DR

This paper introduces a supervised method for creating semantic type embeddings in large-scale graphs, enabling efficient type recommendation, clustering, and ontology alignment without manual feature engineering.

## Contribution

It presents a scalable, feature-agnostic algorithm for generating type embeddings that works on big graphs and integrates seamlessly with existing entity embeddings.

## Key findings

- Outperforms non-parametric baselines in type recommendation
- Achieves 15x speedup and near-constant memory on large DBpedia data
- Successfully clusters millions of instances into ontology types

## Abstract

We propose a supervised algorithm for generating type embeddings in the same semantic vector space as a given set of entity embeddings. The algorithm is agnostic to the derivation of the underlying entity embeddings. It does not require any manual feature engineering, generalizes well to hundreds of types and achieves near-linear scaling on Big Graphs containing many millions of triples and instances by virtue of an incremental execution. We demonstrate the utility of the embeddings on a type recommendation task, outperforming a non-parametric feature-agnostic baseline while achieving 15x speedup and near-constant memory usage on a full partition of DBpedia. Using state-of-the-art visualization, we illustrate the agreement of our extensionally derived DBpedia type embeddings with the manually curated domain ontology. Finally, we use the embeddings to probabilistically cluster about 4 million DBpedia instances into 415 types in the DBpedia ontology.