CoChat

FeedVis: A Path for Exploring News Feed Curation Algorithms

Eslami, Motahhare, Aleyasen, Amirhossein, Karahalios, Karrie, Hamilton, Kevin, Sandvig, Christian · 2015 · Proceedings of the 18th ACM Conference Companion on Computer Supported Cooperative Work & Social Computing
Cited by 37

The DOI matches its Crossref record.

Abstract

Social media feeds, personalized search results and recommendations are examples of algorithmically curated content in our daily digital Life. While the algorithms that curated this content have great power to shape users' experiences, they are mostly hidden behind the interface, leaving users unaware of their presence. Whether it is helpful to give users knowledge of the algorithms' existence and if this knowledge affects interaction behavior are open questions. To assist us in addressing these questions, we developed a system, FeedVis, that exposes Facebook users to comparisons between algorithmically curated and unadulterated News Feeds. We used the tools visualizations as concrete artifacts to study users' perceptions of the algorithms governing their social media feeds.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2685553.2702690

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 37

Metadata

Authors
Eslami, M., Aleyasen, A., Karahalios, K., Hamilton, K., & Sandvig, C.
Venue
Proceedings of the 18th ACM Conference Companion on Computer Supported Cooperative Work & Social Computing
Publisher
ACM
Published
2015-02-28
Pages
65-68
OpenAlex
W2062353626
Cited by
37
References
0
FWCI
2.49
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: FeedVis: A Path for Exploring News Feed Curation Algorithms. https://app.cochat.ai/papers/10.1145/2685553.2702690
The paper
Eslami, M., Aleyasen, A., Karahalios, K., Hamilton, K., & Sandvig, C. (2015). FeedVis: A Path for Exploring News Feed Curation Algorithms. Proceedings of the 18th ACM Conference Companion on Computer Supported Cooperative Work & Social Computing. https://doi.org/10.1145/2685553.2702690

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.