Provenance Graph Kernel
David Kohan Marzag\~ao, Trung Dong Huynh, Ayah Helal, Sean Baccas, Luc, Moreau

TL;DR
This paper introduces a new graph kernel tailored for provenance data, enabling efficient classification and improved explainability of provenance graphs across multiple application domains.
Contribution
A novel provenance-specific graph kernel that decomposes graphs into tree-patterns, improving classification accuracy, efficiency, and interpretability compared to existing methods.
Findings
Performs well in classification accuracy
More efficient in computation time
Enhances model explainability
Abstract
Provenance is a record that describes how entities, activities, and agents have influenced a piece of data; it is commonly represented as graphs with relevant labels on both their nodes and edges. With the growing adoption of provenance in a wide range of application domains, users are increasingly confronted with an abundance of graph data, which may prove challenging to process. Graph kernels, on the other hand, have been successfully used to efficiently analyse graphs. In this paper, we introduce a novel graph kernel called provenance kernel, which is inspired by and tailored for provenance data. It decomposes a provenance graph into tree-patterns rooted at a given node and considers the labels of edges and nodes up to a certain distance from the root. We employ provenance kernels to classify provenance graphs from three application domains. Our evaluation shows that they perform…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScientific Computing and Data Management · Advanced Graph Neural Networks · Explainable Artificial Intelligence (XAI)
