Inducing a Decision Tree with Discriminative Paths to Classify Entities in a Knowledge Graph

Deep-learning based techniques are increasingly being used for different machine learning tasks on knowledge graphs. While it has been shown empirically that these techniques often achieve better predictive performances than their classical counterparts, where features are extracted from the graph, they lack interpretability. Interpretability is a vital aspect in critical domains such as the health and financial sector. In this paper, we present a technique that builds a decision tree of class-specific substructures in order to classify different entities within the knowledge graph. We show how our proposed technique is competitive to current state-of-the-art deep-learning techniques on four benchmark datasets, while being fully interpretable.



Results from the Paper

Task Dataset Model Metric Name Metric Value Global Rank Benchmark
Node Classification AIFB Path Tree Accuracy 89.44 # 3
Node Classification AM Path Tree Accuracy 86.77 # 4
Node Classification BGS Path Tree Accuracy 86.90 # 2
Node Classification MUTAG Path Tree Accuracy 73.82 # 2