• Corpus ID: 211259119

Path Outlines: Browsing Path-Based Summaries of Linked Open Datasets

  title={Path Outlines: Browsing Path-Based Summaries of Linked Open Datasets},
  author={Marie Destandau and Olivier Corby and Alain Giboin},
The Semantic Web is made of structured sources of information, such as DBpedia or GeoNames, also known as Linked Data (LD). They can be linked and queried together. The information they contain is atomized into triples, each triple being a simple statement composed of a subject, a predicate and an object. Triples can be combined to form higher level statements following information needs. This granularity makes it difficult to produce overviews of the content. We introduce the concept of path… 
The Missing Path: Diagnosing Incompleteness in Linked Data
This work proposes a novel visualization tool "The Missing Path" to support data producers in diagnosing incompleteness in their data, which relies on dimensional reduction techniques to create a map of RDF entities based on missing paths, revealing clusters of entities missing the same paths.
Diagnosing Incompleteness in Wikidata with The Missing Path
The hypothesis that identifying subsets of entities with a similar structure can help finding the cause of incompleteness is made, and the evaluation and iterative design process with Wikidata contributors is de-scribe.
The missing path: Analysing incompleteness in knowledge graphs
A new visualization tool is presented, called The Missing Path, to support Knowledge Graphs data producers in identifying coherent subsets of entities that can be repaired, and relies on a map, grouping entities according to their incomplete profile.


ExpLOD: Summary-Based Exploration of Interlinking and RDF Usage in the Linked Open Data Cloud
A tool, ExpLOD, is described that supports exploring summaries of RDF usage and interlinking among datasets from the Linked Open Data cloud, and the two summary creation approaches implemented by ExpLOD (graph-based vs. SPARQL-based).
ABSTAT: Ontology-driven Linked Data Summaries with Pattern Minimalization
This paper discusses how an ontology-driven data abstraction model supports the extraction and the representation of summaries of linked data sets, and proposes a summarization model that produces a summary that is correct and complete with respect to the assertions of the data set.
Ontology understanding without tears: The summarization approach
An advanced version of the RDF Digest, a novel platform that automatically produces and visualizes high quality summaries of RDF/S Knowledge Bases (KBs) and compares its system with two other systems and shows the benefits of the approach and the considerable advantages gained.
LD-VOWL: Extracting and Visualizing Schema Information for Linked Data Endpoints
LD-VOWL is introduced, a web-based tool that extracts and visualizes schema information of Linked Data sources based on the VOWL notation and tests it on a number of linked Data endpoints with promising results.
Revealing the Conceptual Schemas of RDF Datasets
This paper proposes LOD-CM; a web-based completeness demonstrator for linked datasets; a completeness-based approach for revealing conceptual schemas of RDF data that meets user expectations regarding data completeness constraints.
Query-Oriented Summarization of RDF Graphs
The Resource Description Framework (RDF) is a graph-based data model promoted by the W3C as the standard for Semantic Web applications. Its associated query language is SPARQL. RDF graphs are often
Sparklis: An expressive query builder for SPARQL endpoints with guidance in natural language
SPARKLIS is a Semantic Web tool that helps users explore and query SPARQL endpoints by guiding them in the interactive building of questions and answers, from simple ones to complex ones. It combines
Tugging Graphs Faster: Efficiently Modifying Path-Preserving Hierarchies for Browsing Paths
TugGraph is a system for exploring paths and proximity around nodes and subgraphs in a graph that is guaranteed to create path-preserving hierarchies, so that the abstraction shown is meaningful with respect to the underlying structure of the graph.
Pathfinder: Visual Analysis of Paths in Graphs
The analysis of paths in graphs is highly relevant in many domains. Typically, path‐related tasks are performed in node‐link layouts. Unfortunately, graph layouts often do not scale to the size of
An empirical survey of Linked Data conformance