Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Stefan M. Herzog

dblp:241/9070 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
2since 2021 · last 2026
0000-0003-2329-6433ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 5 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 4 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Recommender systems · 62% Data mining · 19% Web and social media mining · 19%
Human-computer interaction and pervasive computing
1 paper
Collaborative and social computing · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems
collaborative filtering
1.422026
Simple changes to content curation algorithms affect the beliefs people form in a collaborative filtering experiment · CHI 2026
The Structure of Social Influence in Recommender Networks · WWW 2020
Collaborative and social computing
social media
1.012026
Simple changes to content curation algorithms affect the beliefs people form in a collaborative filtering experiment · CHI 2026
Data mining › predictive modeling › classification › instance-based learning
k-nearest neighbor
0.412020
The Structure of Social Influence in Recommender Networks · WWW 2020
Web and social media mining
social influence
0.412020
The Structure of Social Influence in Recommender Networks · WWW 2020

Methods — techniques the papers use, named apart from their topics

preregistered experiment · 2.0collaborative filtering · 2.0weighted k-nearest neighbors · 0.9network science methods · 0.9
YearPublicationVenuePosition
2026 Simple changes to content curation algorithms affect the beliefs people form in a collaborative filtering experiment
abstract
Content-curating algorithms provide a crucial service for social media users by surfacing relevant content, but they can also bring about harms when their objectives are misaligned with user values and welfare. Yet, potential behavioral consequences of this alignment problem remain understudied in controlled experiments. In a preregistered, two-wave, collaborative filtering experiment, we demonstrate that small changes to the metrics used for sampling and ranking posts affect the beliefs people form. Our results show observable differences in two types of outcomes within statisticized groups: belief accuracy and consensus. We find partial support for hypotheses that the recently proposed approaches of "bridging-based ranking" and "intelligence-based ranking" promote consensus and belief accuracy, respectively. We also find that while personalized, engagement-based ranking promotes posts that participants perceive favorably, it simultaneously leads those participants to form more polarized and less accurate beliefs than any of the other algorithms considered.
Jason W. Burton, Stefan M. Herzog, Philipp Lorenz-Spreen
CHI2
2024 Simple changes to content curation algorithms affect the beliefs people form in a collaborative filtering experiment
Jason W. Burton, Stefan M. Herzog, Philipp Lorenz-Spreen
CogSci2
2020 The Structure of Social Influence in Recommender Networks
abstract
People’s ability to influence others’ opinion on matters of taste varies greatly—both offline and in recommender systems. What are the mechanisms underlying these striking differences? Using the weighted k-nearest neighbors algorithm (k-nn) to represent an array of social learning strategies, we show—leveraging methods from network science—how the k-nn algorithm gives rise to networks of social influence in six real-world domains of taste. We show three novel results that apply both to offline advice taking and online recommender settings. First, influential individuals have mainstream tastes and high dispersion in their taste similarity with others. Second, the fewer people an individual or algorithm consults (i.e., the lower k is) or the larger the weight placed on the opinions of more similar others, the smaller the group of people with substantial influence. Third, the influence networks emerging from deploying the k-nn algorithm are hierarchically organized. Our results shed new light on classic empirical findings in communication and network science and can help improve the understanding of social influence offline and online.
Pantelis P. Analytis, Daniel Barkoczi, Philipp Lorenz-Spreen, Stefan M. Herzog
WWW4
2017 How to communicate uncertainty in severe weather forecasts?
Nadine Fleischhut, Stefan M. Herzog, Ralph Hertwig
CogSci2
2015 You 're special, but it doesn't matter if you 're a greenhorn: Social recommender strategies for mere mortals
Pantelis P. Analytis, Daniel Barkoczi, Stefan M. Herzog
CogSci3
2013 Blending and choosing within one mind: Should judgments be based on exemplars, rules or both?
Stefan M. Herzog, Bettina von Helversen
CogSci1