Structural Summarization of Semantic Graphs
published: July 10, 2018, recorded: June 2018, views: 811
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
RDF graphs comprise highly complex data, both from a structural and from a semantic perspective. This makes them hard to discover and learn, and hinders their usability. An elegant basis for summarizing graphs is provided by the graph quotient formalism. In a nutshell, a graph quotient specifies a way to view some graph nodes as equivalent to each other, and represents a graph through its equivalence classes based on this equivalence. I will present work carried in my last team over the last few years, on quotient summarization of semantic-rich RDF graph. In particular, I will introduce a set of summaries particularly suited for the heterogeneous structure of RDF graphs, and discuss novel results at the interplay of summarization and saturation with RDF Schema rules
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !