View source for Publications/veyrin-forrer.22.dke

{{Publication
| published = true
| date = 2022-10-26
| title = In Pursuit of the Hidden Features of GNN's Internal Representations
| journal = Data & Knowledge Engineering
| pages = 1 to 23
| authors = Luca Veyrin-Forrer, Ataollah Kamal, Stefan Duffner, Marc Plantevit, Céline Robardet
| None = Graph Neural Networks, Explainable artificial intelligence, Monte Carlo Tree Search
| lrdekeywords = IA
| lrdenewsdate = 2022-10-26
| abstract = We consider the problem of explaining Graph Neural Networks (GNNs). While most attempts aim at explaining the final decision of the model, we focus on the hidden layers to examine what the GNN actually captures and shed light on the hidden features built by the GNN. To that end, we first extract activation rules that identify sets of exceptionally co-activated neurons when classifying graphs in the same category. These rules define internal representations having a strong impact in the classification process. Then - this is the goal of the current paper - we interpret these rules by identifying a graph that is fully embedded in the related subspace identified by the rule. The graph search is based on a Monte Carlo Tree Search directed by a proximity measure between the graph embedding and the internal representation of the rule, as well as a realism factor that constrains the distribution of the labels of the graph to be similar to that observed on the dataset. Experiments including 6 real-world datasets and 3 baselines demonstrate that our method DISCERN generates realistic graphs of high quality which allows providing new insights into the respective GNN models.
| type = article
| id = veyrin-forrer.22.dke
| identifier = doi:https://doi.org/10.1016/j.datak.2022.102097
| bibtex = 
@Article<nowiki>{</nowiki>	  veyrin-forrer.22.dke,
  title		= <nowiki>{</nowiki>In Pursuit of the Hidden Features of <nowiki>{</nowiki>GNN<nowiki>}</nowiki>'s Internal
		  Representations<nowiki>}</nowiki>,
  journal	= <nowiki>{</nowiki>Data \& Knowledge Engineering<nowiki>}</nowiki>,
  pages		= <nowiki>{</nowiki>1-23<nowiki>}</nowiki>,
  year		= <nowiki>{</nowiki>2022<nowiki>}</nowiki>,
  month		= nov,
  issn		= <nowiki>{</nowiki>0169-023X<nowiki>}</nowiki>,
  doi		= <nowiki>{</nowiki>https://doi.org/10.1016/j.datak.2022.102097<nowiki>}</nowiki>,
  author	= <nowiki>{</nowiki>Luca Veyrin-Forrer and Ataollah Kamal and Stefan Duffner
		  and Marc Plantevit and C\'<nowiki>{</nowiki>e<nowiki>}</nowiki>line Robardet<nowiki>}</nowiki>,
  keywords	= <nowiki>{</nowiki>Graph Neural Networks, Explainable artificial
		  intelligence, Monte Carlo Tree Search<nowiki>}</nowiki>,
  abstract	= <nowiki>{</nowiki>We consider the problem of explaining Graph Neural
		  Networks (GNNs). While most attempts aim at explaining the
		  final decision of the model, we focus on the hidden layers
		  to examine what the GNN actually captures and shed light on
		  the hidden features built by the GNN. To that end, we first
		  extract activation rules that identify sets of
		  exceptionally co-activated neurons when classifying graphs
		  in the same category. These rules define internal
		  representations having a strong impact in the
		  classification process. Then - this is the goal of the
		  current paper - we interpret these rules by identifying a
		  graph that is fully embedded in the related subspace
		  identified by the rule. The graph search is based on a
		  Monte Carlo Tree Search directed by a proximity measure
		  between the graph embedding and the internal representation
		  of the rule, as well as a realism factor that constrains
		  the distribution of the labels of the graph to be similar
		  to that observed on the dataset. Experiments including 6
		  real-world datasets and 3 baselines demonstrate that our
		  method DISCERN generates realistic graphs of high quality
		  which allows providing new insights into the respective GNN
		  models. <nowiki>}</nowiki>
<nowiki>}</nowiki>

}}