可解释性
计算机科学
可扩展性
链接(几何体)
图形
机器学习
路径(计算)
理论计算机科学
人工智能
数据挖掘
计算机网络
数据库
作者
Shichang Zhang,Jiani Zhang,Xiang Song,Soji Adeshina,Da Zheng,Christos Faloutsos,Yizhou Sun
标识
DOI:10.1145/3543507.3583511
摘要
Transparency and accountability have become major concerns for black-box machine learning (ML) models. Proper explanations for the model behavior increase model transparency and help researchers develop more accountable models. Graph neural networks (GNN) have recently shown superior performance in many graph ML problems than traditional methods, and explaining them has attracted increased interest. However, GNN explanation for link prediction (LP) is lacking in the literature. LP is an essential GNN task and corresponds to web applications like recommendation and sponsored search on web. Given existing GNN explanation methods only address node/graph-level tasks, we propose Path-based GNN Explanation for heterogeneous Link prediction (PaGE-Link) that generates explanations with connection interpretability, enjoys model scalability, and handles graph heterogeneity. Qualitatively, PaGE-Link can generate explanations as paths connecting a node pair, which naturally captures connections between the two nodes and easily transfer to human-interpretable explanations. Quantitatively, explanations generated by PaGE-Link improve AUC for recommendation on citation and user-item graphs by 9 - 35% and are chosen as better by 78.79% of responses in human evaluation.
科研通智能强力驱动
Strongly Powered by AbleSci AI