arrow
Return

Kernel entropy graph isomorphism network for graph classification

delete2026-01-28
delete0
PRE
AI
L
Lixiang Xu
W
Wei Ge
聂飞平 (Feiping Nie)
陈恩红 (Enhong Chen)
B
Bin Luo
DOI:10.1016/j.patcog.2026.113182delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
• We propose a fusion method for graph neural networks and graph kernels based on the attention mechanism. • We use a shortest path matching kernel to extract global structural features of graph. • We adopt an entropy-based graph isomorphism network to extract local structural features of graph. • We utilize the Nystom method kernel matrix for reduced-rank decomposition, which reduces the time consumed for model computation.

Journal

Pattern Recognition cover
Pattern Recognition
IF:
7.6
Papers:
1.3W
Citations:
4.5W

Organization

C
computer science
Scholars:
1.5K
Papers: 737
Citations: 0
A
artificial intelligence
Scholars:
333
Papers: 176
Citations: 0
S
School of Computer Science and Technology
Scholars:
1.4K
Papers: 525
Citations: 0
A
artificial intelligence and big data
Scholars:
12
Papers: 5
Citations: 0
researcher View more organizations