bookcrossing — BookCrossing ratings (2004)
- Description
A bipartite network of users of the BookCrossing community (a website for exchanging books) and the books they rated, collected by C.-N. Ziegler in a 4-week crawl in August and September 2004, with the permission of the site's operators. Nodes are users and books, and an edge connects a user to a book the user rated, with the rating as edge weight. Ratings are either explicit, on a scale from 1 to 10 (higher values denoting higher appreciation), or implicit (a recorded interaction with the book without a rating), which are given the value 0. User ids are anonymized, and books are identified by their ISBN; according to the source, invalid ISBNs were removed from the book table, but the rating table contains some ISBNs that are malformed or not in the book table. Book information was obtained from Amazon Web Services. The network includes only the users and books that appear in some rating (the source also lists 173,575 users without ratings).
The network has the following properties:
- Nodes:
is_book, whether the node is a book (otherwise it is a user). - Users:
user_id, the anonymized user id;location, the user's location as given ("city, region, country");age, the user's age as given (-1 if unknown; some values are implausible). - Books:
isbn;title,author(only the first, if several),yearof publication (0 if unknown) andpublisher, for the 270,170 rated books listed in the book table (empty otherwise). - Edges:
rating, the rating, from 1 to 10, or 0 for an implicit rating.
- Nodes:
- Tags
- Economic Preferences Weighted Metadata
- Citation
-
- C.-N. Ziegler, S. M. McNee, J. A. Konstan, G. Lausen, "Improving recommendation lists through topic diversification." Proceedings of the 14th International Conference on World Wide Web (WWW 2005), 22-32 (2005) 10.1145/1060745.1060754 Sci-Hub
- Upstream URL OK
- https://web.archive.org/web/20140228065458/http://www.informatik.uni-freiburg.de/~cziegler/BX/
- Upstream license
- Freely available for research use when acknowledged, https://web.archive.org/web/20140228065458/http://www.informatik.uni-freiburg.de/~cziegler/BX/
- Networks
-
Tip: hover over a column header for a description.
Column legend
- $\left<k\right>$
- Mean degree
- $\sigma_k$
- Standard deviation of the degrees
- $\lambda_h$
- Largest eigenvalue of the Hashimoto (non-backtracking) matrix
- $\tau$
- Random walk mixing time
- $r$
- Degree assortativity
- $c$
- Global clustering coefficient
- $\oslash$
- (Pseudo-) diameter
- $S$
- Relative size of the largest component
- NPs
- Node properties
- EPs
- Edge properties
- Ridiculograms*
-