The is the bipartite rating network of WikiLens, an academic project to create a wiki-like site (WikiLens) on which any type of could be rated.


Internal namewikilens-ratings
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Rating network
Dataset timestamp 2004 ⋯ 2008
Node meaningUser, ratee
Edge meaningRating
Network formatBipartite, undirected
Edge typeRatings, no multiple edges
Temporal data Edges are annotated with timestamps


Size n =5,437
Left size n1 =326
Right size n2 =5,111
Volume m =26,937
Wedge count s =6,316,744
Claw count z =1,796,063,698
Cross count x =540,054,945,973
Square count q =6,558,573
4-Tour count T4 =77,798,334
Maximum degree dmax =1,721
Maximum left degree d1max =1,721
Maximum right degree d2max =80
Average degree d =9.908 77
Average left degree d1 =82.628 8
Average right degree d2 =5.270 40
Fill p =0.016 166 9
Size of LCC N =5,416
Diameter δ =9
50-Percentile effective diameter δ0.5 =3.249 34
90-Percentile effective diameter δ0.9 =3.877 23
Median distance δM =4
Mean distance δm =3.410 53
Gini coefficient G =0.770 079
Balanced inequality ratio P =0.193 359
Left balanced inequality ratio P1 =0.204 774
Right balanced inequality ratio P2 =0.267 736
Relative edge distribution entropy Her =0.810 709
Power law exponent γ =1.860 94
Tail power law exponent γt =2.201 00
Tail power law exponent with p γ3 =2.201 00
p-value p =0.051 000 0
Left tail power law exponent with p γ3,1 =1.711 00
Left p-value p1 =0.001 000 00
Right tail power law exponent with p γ3,2 =3.601 00
Right p-value p2 =0.010 000 0
Degree assortativity ρ =−0.274 528
Degree assortativity p-value pρ =0.000 00
Spectral norm α =36.156 7
Spectral separation 1[A] / λ2[A]| =1.167 54
Negativity ζ =0.437 465
Algebraic conflict ξ =0.191 540
Spectral signed frustration φ =0.004 816 06
Controllability C =4,793
Relative controllability Cr =0.881 552


Fruchterman–Reingold graph drawing

Degree distribution

Cumulative degree distribution

Lorenz curve

Spectral distribution of the adjacency matrix

Spectral distribution of the normalized adjacency matrix

Spectral distribution of the Laplacian

Spectral graph drawing based on the adjacency matrix

Spectral graph drawing based on the Laplacian

Spectral graph drawing based on the normalized adjacency matrix

Degree assortativity

Zipf plot

Hop distribution

Double Laplacian graph drawing

Delaunay graph drawing

Item rating evolution

Edge weight/multiplicity distribution

Temporal distribution

Temporal hop distribution

Diameter/density evolution

Signed temporal distribution

Rating class evolution

Matrix decompositions plots



[1] Jérôme Kunegis. KONECT – The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion, pages 1343–1350, 2013. [ http ]
[2] Dan Frankowski, Shyong K. Lam, Shilad Sen, F. Maxwell Harper, Scott Yilek, Michael Cassano, and John Riedl. Recommenders everywhere: The WikiLens community-maintained recommender system. In Proc. Int. Symp. on Wikis, pages 47–60, 2007.