relational classification
Recently Published Documents


TOTAL DOCUMENTS

57
(FIVE YEARS 0)

H-INDEX

6
(FIVE YEARS 0)

2020 ◽  
Vol 57 (2) ◽  
pp. 102068 ◽  
Author(s):  
Georgios Katsimpras ◽  
Georgios Paliouras


Author(s):  
Sebastijan Dumancic ◽  
Alberto Garcia-Duran ◽  
Mathias Niepert

Many real-world domains can be expressed as graphs and, more generally, as multi-relational knowledge graphs. Though reasoning and learning with knowledge graphs has traditionally been addressed by symbolic approaches such as Statistical relational learning, recent methods in (deep) representation learning have shown promising results for specialised tasks such as knowledge base completion. These approaches, also known as distributional, abandon the traditional symbolic paradigm by replacing symbols with vectors in Euclidean space. With few exceptions, symbolic and distributional approaches are explored in different communities and little is known about their respective strengths and weaknesses. In this work, we compare distributional and symbolic relational learning approaches on various standard relational classification and knowledge base completion tasks. Furthermore, we analyse the properties of the datasets and relate them to the performance of the methods in the comparison. The results reveal possible indicators that could help in choosing one approach over the other for particular knowledge graphs.



Author(s):  
Cristina Pérez-Solà ◽  
Jordi Herrera-Joancomartí

This paper presents a classifier architecture that is able to deal with classification of interlinked entities when the only information available is the existing relationships between these entities, i.e. no semantic content is known for either the entities or their relationships. After proposing a classifier to deal with this problem, we provide extensive experimental evaluation showing that our proposed method is sound and that it is able to achieve high accuracy, in most cases much higher than other already existing algorithms configured to tackle this very same problem. The contributions of this paper are twofold: first, it presents a classifier for interlinked entities that outperforms most of the existing algorithms when the only information available is the relationships between these entities; second, it reveals the power of using label independent (LI) features extracted from network structural properties in the bootstrapping phases of relational classification.



2018 ◽  
Vol 292 ◽  
pp. 72-81 ◽  
Author(s):  
Zan Zhang ◽  
Hao Wang ◽  
Lin Liu ◽  
Jiuyong Li


Sign in / Sign up

Export Citation Format

Share Document