Graph Sampling for Linked...
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 rewritten graph is analysed using different standard network algorithms, after which the weights are aggregated back to the RDF triples.
We measure the quality of the subgraph using query logs, where we calculate the recall by executing each query on the subgraph as well as the original graph.
Navigatable results (i.e. html) are available here:
View this idea