MétaCan
Menu
Back to cohort
Record W2901235856 · doi:10.1109/tcss.2018.2879510

A Bayesian Multiagent Trust Model for Social Networks

2018· article· en· W2901235856 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Computational Social Systems · 2018
Typearticle
Languageen
FieldComputer Science
TopicRecommender Systems and Techniques
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceCredibilityCompetitor analysisContext (archaeology)ReputationProbabilistic logicArtificial intelligenceProcess (computing)Machine learningSocial network (sociolinguistics)Bayesian networkSocial mediaWorld Wide Web

Abstract

fetched live from OpenAlex

In this paper, we introduce a framework for modeling the trustworthiness of peers in the setting of online social networks. In these contexts, it may be important to be filtering the wealth of messages that have been sent, which form the ongoing communication within a large community of users. This is achieved by constructing an intelligent agent that reasons about the message and each peer rater of the message, learning over time to properly gage whether a message is good or bad to show a user, based on message ratings, rater similarity, and rater credibility. Our approach employs a partially observable Markov decision process for trust modeling, moving beyond the more traditional adoption of probabilistic reasoning using beta reputation functions. In addition to outlining the technique in full, we present empirical results to demonstrate the effectiveness of our methods, both in simulations featuring head to head comparisons with competitors, and in the context of some existing online social networks where ground truth data are available.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScience and technology studies
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.974
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.047
GPT teacher head0.302
Teacher spread0.255 · 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