Unsupervised Hierarchical Grouping of Knowledge Graph Entities
This addresses the issue of incompleteness in knowledge graphs for researchers and practitioners, but it appears incremental as it builds on existing methods for entity type discovery.
The paper tackles the problem of incomplete type assertions in knowledge graphs by proposing an unsupervised approach that learns to categorize entities into a hierarchy of named groups, showing effectiveness in noisy and sparse datasets.
Knowledge graphs have attracted lots of attention in academic and industrial environments. Despite their usefulness, popular knowledge graphs suffer from incompleteness of information, especially in their type assertions. This has encouraged research in the automatic discovery of entity types. In this context, multiple works were developed to utilize logical inference on ontologies and statistical machine learning methods to learn type assertion in knowledge graphs. However, these approaches suffer from limited performance on noisy data, limited scalability and the dependence on labeled training samples. In this work, we propose a new unsupervised approach that learns to categorize entities into a hierarchy of named groups. We show that our approach is able to effectively learn entity groups using a scalable procedure in noisy and sparse datasets. We experiment our approach on a set of popular knowledge graph benchmarking datasets, and we publish a collection of the outcome group hierarchies.