CiaoDVD review ratings

This is the bipartite user–review rating network of the site from 2013. It contains users and individual reviews as nodes, and user ratings of individual reviews as edges. The author of each individual review is not given in the dataset.


Internal namelibrec-ciaodvd-review_ratings
NameCiaoDVD review ratings
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Rating network
Dataset timestamp 2013
Node meaningUser, review
Edge meaningRating
Network formatBipartite, undirected
Edge typeRatings, no multiple edges
Snapshot Is a snapshot and likely to not contain all data


Size n =92,652
Left size n1 =21,019
Right size n2 =71,633
Volume m =1,625,480
Wedge count s =2,730,969,169
Claw count z =12,257,734,171,171
Cross count x =76,783,643,938,686,928
Square count q =5,736,184,264
4-Tour count T4 =56,816,743,776
Maximum degree dmax =34,884
Maximum left degree d1max =34,884
Maximum right degree d2max =422
Average degree d =35.087 9
Average left degree d1 =77.333 8
Average right degree d2 =22.691 8
Fill p =0.001 079 58
Size of LCC N =92,401
Diameter δ =15
50-Percentile effective diameter δ0.5 =2.981 15
90-Percentile effective diameter δ0.9 =4.472 46
Median distance δM =3
Mean distance δm =3.415 93
Gini coefficient G =0.682 356
Balanced inequality ratio P =0.249 078
Left balanced inequality ratio P1 =0.103 496
Right balanced inequality ratio P2 =0.323 335
Relative edge distribution entropy Her =0.856 525
Power law exponent γ =1.406 86
Tail power law exponent γt =2.531 00
Degree assortativity ρ =−0.114 392
Degree assortativity p-value pρ =0.000 00
Spectral norm α =138.092
Algebraic connectivity a =0.000 259 702
Spectral separation 1[A] / λ2[A]| =1.708 34
Negativity ζ =0.318 774
Spectral signed frustration φ =0.000 343 991
Controllability C =54,056
Relative controllability Cr =0.583 430


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

Item rating evolution

Edge weight/multiplicity distribution

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] Guobing Guo, Jie Zhang, Daniel Thalmann, and Neil Yorke-Smith. ETAF: An extended trust antecedents framework for trust prediction. In Proc. Int. Conf. Adv. in Soc. Netw. Anal. and Min., pages 540–547, 2014.