RDF Graph Measures for the Analysis of RDF Graphs

Home / Government / patents-data-gov-uk

patents-data-gov-uk

Data and Resources

Measures

Notation Description Value
m graph volume (no. of edges) 11,627
n graph size (no. of vertices) 8,119
dmax max degree 890
d+max max in-degree 890
d-max max out-degree 15
z mean total degree 2.864
h+
h-index, respecting in-degree
Known from citation networks, this measure is an indicator for the importance of a vertex in the graph, similar to a centrality measure. A value of h means that for the number of h vertices the degree of these vertices is greater or equal to h. A high value of h could be an indicator for a "dense" graph and that its vertices are more "prestigious". The value is computed by respecting the in-degree distribution of the graph, denoted as h+.
13
h h-index, respecting total degree 15
pmu fill, respecting unique edges only 0
p fill, respecting overall edges 0
mp
Effective measure!Score: 0.045

Datasets in this domain can be very well described by means of this particular measure.

parallel edges
Based on the measure mu, this is the number of parallel edges, i.e., the total number of edges that share the same pair of source and target vertices. It is computed by subtracting mu from the total number of edges m, i.e. mp = m – mu.
443
mu
unique edges
In RDF, a pair of subject and object resources may be described with more than one predicate. Hence, in the graphs, there may exist a fraction of all edges that share the same pair of (subject and object) vertices. The value for mu represents the total number of edges without counting these multiple edges between a pair of vertices.
11,184
y reciprocity 0
δ
diameter (approximated)
The diameter is the longest shortest path between a pair of two vertices in the graph (as there can be more than one path for the pair of vertices). As this requires all possible paths to be computed, this is a very computational intensive measure. We used the pseudo_diameter-algorithm provided by graph-tool, which is an approximation method for the diameter of the graph. As the graph can have many components, this algorithm very often returns the value of 1. If this should be the case for this graph, we compute the diameter for the largest connecting component.
1
PR max pagerank value 0.004
Cd+ max in-degree centrality 0.11
Cd- max out-degree centrality 0.002
Cd max degree centrality 0.11
α powerlaw exponent, degree distribution 9.311
dminα dmin for α 11
α+ powerlaw exponent, in-degree distribution 3.059
dminα+ dmin for α+ 3
σ+ standard deviation, in-degree distribution 14.488
σ- standard deviation, out-degree distribution 2.984
cv+ coefficient variation, in-degree distribution 1,011.67
cv-
Effective measure!Score: 0.047

Datasets in this domain can be very well described by means of this particular measure.

coefficient variation, out-degree distribution 208.35
σ2+ variance, in-degree distribution 209.9
σ2- variance, out-degree distribution 8.903
C+d graph centralization 0.109
z- mean out-degree 5.316
deg(G) max partial out-degree 2
deg(G) mean partial out-degree 1.033
degL(G)
Effective measure!Score: 0.099

Datasets in this domain can be very well described by means of this particular measure.

max labelled out-degree 11
degL(G) mean labelled out-degree 5.145
degD(G) max direct out-degree 14
degD(G) mean direct out-degree 5.114
z+ mean in-degree 1.679
deg++(G) max partial in-degree 890
deg++(G) mean partial in-degree 1.589
degL+(G) max labelled in-degree 2
degL+(G) mean labelled in-degree 1.057
degD+(G) max direct in-degree 890
degD+(G)
Effective measure!Score: 0.128

Datasets in this domain can be very well described by means of this particular measure.

mean direct in-degree 1.615
degP(G) max predicate degree 2,186
degP(G) mean predicate degree 726.688
degP+(G) max predicate in-degree 2,186
degP+(G) mean predicate in-degree 703.312
degP(G) max predicate out-degree 1,724
degP(G) mean predicate out-degree 457.438
so(G) subject-object ratio 0.122
rL(G) ratio of repreated predicate lists 0.989
degPL(G)
Effective measure!Score: 0.047

Datasets in this domain can be very well described by means of this particular measure.

max predicate list degree 913
degPL(G)
Effective measure!Score: 0.129

Datasets in this domain can be very well described by means of this particular measure.

mean predicate list degree 95.087
CG
Effective measure!Score: 0.06

Datasets in this domain can be very well described by means of this particular measure.

distinct classes 4
SGC all different typed subjects 2,186
rT(G) ratio of typed subjects 1

Plots

Degree distribution shown here
In-degree distribution shown here
Last update of this page: 25 March 2020 13:38:38 CET