MétaCan
Menu
Back to cohort
Record W4404804432 · doi:10.1016/j.procs.2024.09.513

Temporal Graph Convolutional Network for Implicit Relation Prediction: Leveraging Timestamps and Confidence

2024· article· en· W4404804432 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

VenueProcedia Computer Science · 2024
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Graph Neural Networks
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsComputer scienceTimestampGraphRelation (database)Theoretical computer scienceArtificial intelligenceData miningReal-time computing

Abstract

fetched live from OpenAlex

In the dynamic landscape of social network analysis, the accurate prediction of implicit relationships presents a pivotal challenge. This paper introduces an innovative solution, the Relation Temporal Graph Convolutional Network with Confidence (R-CTGCN), specifically designed to address the intricate task of predicting implicit relations within evolving social networks. R-CTGCN unifies timestamp temporal embeddings, confidence metrics, and PFs within a comprehensive graph neural network framework, aiming to capture the evolving dynamics of networks and enhance predictive accuracy. Experimental evaluations conducted on diverse datasets, including Epinions and Enron, showcase R-CTGCN’s superior performance compared to both baseline models and contemporary state-of-the-art methods. The emphasis on the roles of confidence and PFs underscores their significance in implicit relationship prediction. The outcomes contribute substantively to the understanding of predicting implicit relationships, positioning R-CTGCN as a robust tool tailored for complex social network scenarios.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.818
Threshold uncertainty score0.846

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0010.000
Scholarly communication0.0010.003
Open science0.0010.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.015
GPT teacher head0.248
Teacher spread0.233 · 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