RDF Graph Measures for the Analysis of RDF Graphs

Home / Publications / rkb-explorer-citeseer

rkb-explorer-citeseer

Data and Resources

Measures

Notation Description Value
m graph volume (no. of edges) 9,507,056
n graph size (no. of vertices) 1,375,532
dmax max degree 1,120,000
d+max max in-degree 1,123,657
d-max max out-degree 416,020
z mean total degree 13.8
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+.
258
h h-index, respecting total degree 407
pmu fill, respecting unique edges only 0
p fill, respecting overall edges 0
mp
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.
5,039,620
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.
4,467,436
y reciprocity 0.056
δ
Effective measure!Score: 0.09

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

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.023
Cd+ max in-degree centrality 0.817
Cd- max out-degree centrality 0.302
Cd max degree centrality 0.817
α powerlaw exponent, degree distribution 2.943
dminα dmin for α 62
α+ powerlaw exponent, in-degree distribution 2.837
dminα+ dmin for α+ 49
σ+ standard deviation, in-degree distribution 1,503.198
σ- standard deviation, out-degree distribution 721.127
cv+ coefficient variation, in-degree distribution 21,749.1
cv- coefficient variation, out-degree distribution 10,433.7
σ2+ variance, in-degree distribution 2,259,604.508
σ2- variance, out-degree distribution 520,024.524
C+d graph centralization 0.817
z-
Effective measure!Score: 0.052

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

mean out-degree 12.483
$$deg^{--}(G)$$ max partial out-degree 83,204
$$\overline{deg^{--}}(G)$$ mean partial out-degree 3.032
$$deg^-_L(G)$$
Effective measure!Score: 0.055

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

max labelled out-degree 8
$$\overline{deg^-_L}(G)$$ mean labelled out-degree 4.117
$$deg^-_D(G)$$
Effective measure!Score: 0.063

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

max direct out-degree 506
$$\overline{deg^-_D}(G)$$ mean direct out-degree 5.866
z+ mean in-degree 6.912
$$deg^{++}(G)$$ max partial in-degree 1,123,657
$$\overline{deg^{++}}(G)$$ mean partial in-degree 6.273
$$deg^+_L(G)$$ max labelled in-degree 2
$$\overline{deg^+_L}(G)$$ mean labelled in-degree 1.102
$$deg^+_D(G)$$ max direct in-degree 401,386
$$\overline{deg^+_D}(G)$$ mean direct in-degree 3.248
$$deg_P(G)$$ max predicate degree 2,134,695
$$\overline{deg_P}(G)$$ mean predicate degree 500,371.368
$$deg^+_P(G)$$ max predicate in-degree 761,582
$$\overline{deg^+_P}(G)$$ mean predicate in-degree 165,021
$$deg^-_P(G)$$ max predicate out-degree 401,386
$$\overline{deg^-_P}(G)$$ mean predicate out-degree 79,760.21
$$\propto_{s-o}(G)$$ subject-object ratio 0.554
$$r_L(G)$$ ratio of repreated predicate lists 0.979
$$deg_{PL}(G)$$
Effective measure!Score: 0.062

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

max predicate list degree 263,673
$$\overline{deg_{PL}}(G)$$
Effective measure!Score: 0.231

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

mean predicate list degree 47.865
$$C_G$$
Effective measure!Score: 0.048

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

distinct classes 4
$$S^C_G$$ all different typed subjects 761,582
$$r_T(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:39 CET