• Corpus ID: 224803337

Provenance Graph Kernel

  title={Provenance Graph Kernel},
  author={David Kohan Marzag{\~a}o and Trung Dong Huynh and Ayah Helal and Luc Moreau},
Provenance is a record that describes how entities, activities, and agents have influenced a piece of data. Such provenance information is commonly represented in graphs with relevant labels on both their nodes and edges. With the growing adoption of provenance in a wide range of application domains, increasingly, users are confronted with an abundance of graph data, which may prove challenging to analyse. Graph kernels, on the other hand, have been consistently and successfully used to… 


Aggregation by Provenance Types: A Technique for Summarising Provenance Graphs
A quantitative evaluation and a complexity analysis show that this technique is tractable; with small values of k, it can produce useful summaries and can help detect outliers.
Provenance Network Analytics
It is shown that the proposed provenance network metrics can successfully identify the owners of provenance documents, assess the quality of crowdsourced data, and identify instructions from chat messages in an alternate-reality game with high levels of accuracy.
PROV-DM: The PROV Data Model
This document introduces the provenance concepts found in PROV and defines PROV-DM types and relations.
Tree++: Truncated Tree Based Graph Kernels
This paper proposes a new graph kernel called Tree++ and incorporates a new concept called super path into it, which contains truncated BFS trees rooted at the vertices in a path to capture graph similarity at coarse granularities.
Enhancing and abstracting scientific workflow provenance for data publishing
This paper explores the use of provenance traces collected by workflow management systems when enacting workflows, and proposes an approach whereby distilled, yet more informative,provenance traces that are fit for the data publishing task can be derived.
Substructure counting graph kernels for machine learning from RDF data
A survey on graph kernels
This survey gives a comprehensive overview of techniques for kernel-based graph classification developed in the past 15 years and describes and categorizes graph kernels based on properties inherent to their design, such as the nature of their extracted graph features, their method of computation and their applicability to problems in practice.
Shortest-path kernels on graphs
This work proposes graph kernels based on shortest paths, which are computable in polynomial time, retain expressivity and are still positive definite, and shows significantly higher classification accuracy than walk-based kernels.
Scalable kernels for graphs with continuous attributes
A class of graph kernels with computational complexity O(n2(m + log n + δ2 + d)), where δ is the graph diameter, m is the number of edges, and d is the dimension of the node attributes is presented.
Graph Kernels for RDF Data
This paper introduces two versatile families of graph kernels specifically suited for RDF, based on intersection graphs and intersection trees, and shows that the novel RDF graph kernels used with (SVMs) achieve competitive predictive performance when compared to specialized techniques for both tasks.