MétaCan
Menu
Back to cohort
Record W2765471337 · doi:10.5555/3107979.3107989

Generating stochastic data to simulate a twitter user

2017· article· en· W2765471337 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

VenueCommunications and Networking Symposium · 2017
Typearticle
Languageen
FieldComputer Science
TopicData Management and Algorithms
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer scienceRecommender systemCollaborative filteringSimilarity (geometry)Weibull distributionInformation retrievalCluster analysistf–idfData miningTerm (time)Machine learningArtificial intelligenceMathematicsStatistics

Abstract

fetched live from OpenAlex

Twitter is a popular social network that carries information in short messages. A user's tweets can contain information that is similar to another user's tweets. In this research, we aim to provide stochastic tweets that can be used for testing recommender systems with large data. For this reason, we used term frequency and inverse document frequency (tf-idf) to analyze users' aggregated tweets. The empirical results show Weibull distribution fits the model of tf-idf of the words in users' tweets. Then Weibull distribution is used to generate stochastic data for users' tweets. A simulation of a recommender system was also conducted to test classification of users based on stochastic tweets. The recommender system uses collaborative filtering to find similarity between users. The simulation used k-means clustering to verify the similarity of the stochastic data versus real data.

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, Scholarly communication, Open science
Consensus categoriesOpen science
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.907
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.0020.001
Open science0.0070.013
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.129
GPT teacher head0.342
Teacher spread0.213 · 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