BookCrossing (ratings)

This is the bipartite book rating network of the BookCrossing community. Rating values are integers between one and ten, where ten represents the best score. An edge shows that a user has rated a book. Nodes in the left column are users; nodes in the right column are books.

Metadata

CodeBx
Internal namebookcrossing_rating
NameBookCrossing (ratings)
Data sourcehttp://www.informatik.uni-freiburg.de/~cziegler/BX/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Rating network
Dataset timestamp 2004-08-01 ⋯ 2004-09-01
Node meaningUser, book
Edge meaningRating
Network formatBipartite, undirected
Edge typeRatings, no multiple edges

Statistics

Size n =263,757
Left size n1 =77,802
Right size n2 =185,955
Volume m =433,652
Wedge count s =80,944,469
Claw count z =141,344,884,260
Cross count x =268,754,486,843,948
Square count q =1,457,330
4-Tour count T4 =336,304,276
Maximum degree dmax =8,524
Maximum left degree d1max =8,524
Maximum right degree d2max =707
Average degree d =3.288 27
Average left degree d1 =5.573 79
Average right degree d2 =2.332 03
Fill p =2.997 39 × 10−5
Size of LCC N =229,137
Diameter δ =23
50-Percentile effective diameter δ0.5 =5.156 19
90-Percentile effective diameter δ0.9 =6.923 03
Median distance δM =6
Mean distance δm =5.649 99
Gini coefficient G =0.662 876
Balanced inequality ratio P =0.237 367
Left balanced inequality ratio P1 =0.199 243
Right balanced inequality ratio P2 =0.298 022
Relative edge distribution entropy Her =0.894 421
Power law exponent γ =3.146 62
Tail power law exponent γt =2.081 00
Degree assortativity ρ =−0.058 945 9
Degree assortativity p-value pρ =0.000 00
Spectral norm α =152.914
Algebraic connectivity a =6.929 46 × 10−5
Negativity ζ =0.455 700
Algebraic conflict ξ =0.005 160 59
Spectral signed frustration φ =0.000 357 269

Plots

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

Item rating evolution

Edge weight/multiplicity distribution

Matrix decompositions plots

Downloads

References

[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] Cai-Nicolas Ziegler, Sean M. McNee, Joseph A. Konstan, and Georg Lausen. Improving recommendation lists through topic diversification. In Proc. Int. World Wide Web Conf., pages 22–32, 2005.