Jester Joke Rating Network

A Jester Online Joke Recommender System (UC Berkeley) dataset of 73,521 nodes and 4,136,360 edges, collected by K. Goldberg et al. via Jester system. Each record contains directed: False, weighted: True, temporal: False. Bipartite user-joke rating network with continuous ratings from -10 to +10 — one of the earliest large-scale collaborative filtering datasets.. Suitable for recommender systems, collaborative filtering, continuous rating prediction.

#Collaborative filtering#Jester#Joke#Konect#Rating

Download data BibTeX JSONSimilar datasets

Analytics

The interactive network needs JavaScript.

· graph.json

The full graph has 73,521 nodes; this view shows the 1,000-node sample the pipeline drew for display. Node size is centrality, colour is community.

73.5K
Nodes
4.1M
Edges
1.53e-03
Density
1
Components
-0.7896
Assortativity
0.0%
Reciprocity
0
Bridges
Most central nodes
R170.9985
R80.9985
R200.9985
R150.9984
R190.9984
R130.9984
R50.9984
R180.9984
R70.9984
R160.9983
Content metrics

4,136,360 records scored · min–maxmean ± 0.675 σ (the interquartile range if the values are roughly normal)mean

weightμ 0.742 ± 5.295
min -9.95max 10

Computed over the full corpus.

Record

Catalog key
jester
Authors
Goldberg, Ken; Roeder, Theresa; Gupta, Dhruv; Perkins, Chris
Year
2001
Source paper
Eigentaste: A Constant Time Collaborative Filtering Algorithm
DOI / arXiv
10.1023/A:1011419012209
License
CC BY-SA 2.0 Germany (as stated by KONECT) (LicenseRef-CC-BY-SA-2.0-DE)
Records
73,521
Nodes
73,521
Edges
4,136,360
Nodes are
user / joke
Edges are
rating
Attributes
nodes have no attributes; edges have attributes
Languages
en
Collected
2003 (2000s)
Tasks
Recommendation (ranking) inferred
From the graph: link prediction, community detection

Provenance

Originally published at
https://konect.cc/networks/jester2/ unverified
Hosted copy
Mirrored on echo.directory on 2026-10-02, 13.3 MB across 1 files. Checksums in MANIFEST.json.

Citations

Eigentaste: A Constant Time Collaborative Filtering Algorithm
Ken Goldberg, T. Roeder, Dhruv Gupta, Chris Perkins
Journal Article · Information retrieval (Boston) · 2001

1.7K
citations
highly cited
118
influential citations
7% of all citations

Cited by

Show all 10

Citation data from Semantic Scholar, retrieved 2026-10-19.

How to cite

BibTeX

@misc{echo2026,
  title  = {ECHO: Exploratory Compendium of Humanity Online},
  author = {Switzer, Braden and Zafarani, Reza},
  year   = {2026},
  url    = {https://echo.directory},
  note   = {Syracuse University}
}

@article{Goldberg_2001,
  title     = {Eigentaste: A Constant Time Collaborative Filtering Algorithm},
  volume    = {4},
  issn      = {1573-7659},
  url       = {http://dx.doi.org/10.1023/A:1011419012209},
  doi       = {10.1023/a:1011419012209},
  number    = {2},
  journal   = {Information Retrieval},
  publisher = {Springer Science and Business Media LLC},
  author    = {Goldberg, Ken and Roeder, Theresa and Gupta, Dhruv and Perkins, Chris},
  year      = {2001},
  month     = July,
  pages     = {133–151}
}

APA

Switzer, B., & Zafarani, R. (2026). ECHO: Exploratory Compendium of Humanity Online [Data repository]. Syracuse University. https://echo.directory

Goldberg, K., Roeder, T., Gupta, D., & Perkins, C. (2001). Jester Joke Rating Network [Data set]. https://doi.org/10.1023/A:1011419012209

MLA

Switzer, Braden, and Reza Zafarani. ECHO: Exploratory Compendium of Humanity Online. Syracuse University, 2026, echo.directory.

Goldberg, Ken, et al. Jester Joke Rating Network. 2001, doi.org/10.1023/A:1011419012209.

BibTeX · RIS · CSL-JSON

Similar datasets 8 all with scores →