Explainable Neural Subgraph Matching With Learnable Multi-Hop Attention

Subgraph matching is a challenging problem with a wide range of applications in drug discovery, social network analysis, biochemistry, and cognitive science. It involves determining whether a given query graph is present within a larger target graph. Traditional graph-matching algorithms provide pre...

全面介紹

書目詳細資料

發表在:	IEEE Access
Main Authors:	Duc Q. Nguyen, Thanh Toan Nguyen, Jun Jo, Florent Poux, Shikha Anirban, Tho T. Quan
格式:	Article
語言:	英语
出版:	IEEE 2024-01-01
主題:	Explainability graph neural networks learnable multi-hop attention subgraph matching
在線閱讀:	https://ieeexplore.ieee.org/document/10677500/