Learning and reasoning with graph data

被引:1
作者
Jaeger, Manfred [1 ]
机构
[1] Aalborg Univ, Dept Comp Sci, Aalborg, Denmark
来源
FRONTIERS IN ARTIFICIAL INTELLIGENCE | 2023年 / 6卷
关键词
graph data; representation learning; statistical relational learning; graph neural networks; neuro-symbolic integration; inductive logic programming; COMPLEXITY; 1ST-ORDER; LOGIC;
D O I
10.3389/frai.2023.1124718
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Reasoning about graphs, and learning from graph data is a field of artificial intelligence that has recently received much attention in the machine learning areas of graph representation learning and graph neural networks. Graphs are also the underlying structures of interest in a wide range of more traditional fields ranging from logic-oriented knowledge representation and reasoning to graph kernels and statistical relational learning. In this review we outline a broad map and inventory of the field of learning and reasoning with graphs that spans the spectrum from reasoning in the form of logical deduction to learning node embeddings. To obtain a unified perspective on such a diverse landscape we introduce a simple and general semantic concept of a model that covers logic knowledge bases, graph neural networks, kernel support vector machines, and many other types of frameworks. Still at a high semantic level, we survey common strategies for model specification using probabilistic factorization and standard feature construction techniques. Based on this semantic foundation we introduce a taxonomy of reasoning tasks that casts problems ranging from transductive link prediction to asymptotic analysis of random graph models as queries of different complexities for a given model. Similarly, we express learning in different frameworks and settings in terms of a common statistical maximum likelihood principle. Overall, this review aims to provide a coherent conceptual framework that provides a basis for further theoretical analyses of respective strengths and limitations of different approaches to handling graph data, and that facilitates combination and integration of different modeling paradigms.
引用
收藏
页数:17
相关论文
共 70 条
[1]  
Abboud R., 2021, Proceedings of IJCAI 2021, DOI [10.24963/ijcai.2021/291, DOI 10.24963/IJCAI.2021/291]
[2]  
[Anonymous], 1997, UAI 97 P 13 C UNCERT
[3]  
[Anonymous], 2011, P UAI 2011
[4]  
[Anonymous], 2007, Introduction to statistical relational learning
[5]  
Barcelo Pablo, 2020, 8 INT C LEARN REPR I
[6]   STATISTICAL-ANALYSIS OF NON-LATTICE DATA [J].
BESAG, J .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES D-THE STATISTICIAN, 1975, 24 (03) :179-195
[7]   Top-down induction of first-order logical decision trees [J].
Blockeel, H ;
De Raedt, L .
ARTIFICIAL INTELLIGENCE, 1998, 101 (1-2) :285-297
[8]   Graph Generators: State of the Art and Open Challenges [J].
Bonifati, Angela ;
Holubova, Irena ;
Prat-Perez, Arnau ;
Sakr, Sherif .
ACM COMPUTING SURVEYS, 2020, 53 (02)
[9]  
BREESE JS, 1994, IEEE T SYST MAN CYB, V24, P1577
[10]   The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws [J].
Cozman, Fabio Gagliardi ;
Maua, Denis Deratani .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2019, 110 :107-126