Results for Graph Sampling for Linked Data, a submission for ISWC 2013 We apply different rewrite methods to transform our RDF graph into an unweighted directed graph with unlabelled edges. The rewrit
Results for Graph Sampling for Linked Data, a submission for ISWC 2013 We apply different rewrite methods to transform our RDF graph into an unweighted directed graph with unlabelled edges. The rewri
Results for Graph Sampling for Linked Data, a submission for ISWC 2013 We apply different rewrite methods to transform our RDF graph into an unweighted directed graph with unlabelled edges. The rewrit
This article introduces new efficient algorithms for two problems: sampling conditional on vertex degrees in unweighted graphs, and conditional on vertex strengths in weighted graphs. The resulting co
Boxplots showing the quality of the sampled subgraphs. The quality/relevance is based on the recall of a given set of queries for this dataset. Whenever we can claim a statistically significant better
