Before revision:  It relies on dimensional reduction techniques to create a mapof RDF entities based on missing paths, revealing clusters of entities missing the same paths. The novelty of our work consists in describing the entities of interest as vectors of aggregated RDF paths of a fixed length. We show that identifying groups of items sharing a similar structure helps users find the cause of incompleteness for entire groups and allows them to decide if and how it has to be resolved. We describe our iterative design process and evaluation with Wikidata contributors .
After revision:  It relies on a map, grouping entities according to their incomplete profile. The map is coordinated with histograms and stacked charts to support interactive exploration and analysis; the summary of a subset can be compared with the one of the full collection to reveal its distinctive features. We conduct an iterative design process and evaluation with Wikidata contributors .