MétaCan
Menu
Back to cohort
Record W2072013890 · doi:10.1145/2792838.2800190

Preference-oriented Social Networks

2015· article· en· W2072013890 on OpenAlexaff
Amirali Salehi‐Abari, Craig Boutilier

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicData Management and Algorithms
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsHomophilyPreferenceExploitSet (abstract data type)Social network (sociolinguistics)Context (archaeology)InferenceComputer scienceVariety (cybernetics)Probabilistic logicSocial groupSocial preferencesSocial psychologyPsychologyMicroeconomicsArtificial intelligenceEconomicsSocial mediaWorld Wide WebComputer security

Abstract

fetched live from OpenAlex

Social networks facilitate a variety of social, economic, and political interactions. Homophily---the tendency for people to associate or interact with similar peers---and social influence---the tendency to adopt certain characteristics of those with whom one interacts---suggest that preferences (e.g., over products, services, political parties) are likely to be correlated among people whom directly interact in a social network. We develop a model, preference-oriented social networks, that captures such correlations of individual preferences, where preferences take the form of rankings over a set of options. We develop probabilistic inference methods for predicting individual preferences given observed social connections and partial observations of the preferences of others in the network. We exploit these predictions in a social choice context to make group decisions or recommendations even when the preferences of some group members are unobserved. Experiments demonstrate the effectiveness of our algorithms and the improvements made possible by accounting for social ties.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.015
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.007
Threshold uncertainty score0.020

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.015
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.004
Science and technology studies0.0010.001
Scholarly communication0.0020.004
Open science0.0020.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0060.002

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.079
GPT teacher head0.255
Teacher spread0.176 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations62
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicData Management and AlgorithmsFrench-language works237,207