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

BeComE: A Framework for Node Classification in Social Graphs

2024· article· en· W4405112666 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueProcedia Computer Science · 2024
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Graph Neural Networks
Canadian institutionsUniversity of Windsor
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceNode (physics)Social network (sociolinguistics)Theoretical computer scienceArtificial intelligenceWorld Wide WebSocial media

Abstract

fetched live from OpenAlex

In this study, we explore the important role of graph embedding methods in extracting valuable insights from graph structures, specifically focusing on node classification tasks. It is important to know the structural and semantic features and connections within nodes in a graph to learn more detailed hidden patterns. Hence, we propose a hybrid architecture, BeComE (Bert-ComplEx Embedding Model)1, a novel framework that employs both semantic and structural features from social network structures extracted through label-aware embedding models to aid in node classification in social graphs. A Support Vector Machine (SVM) classifier receives these vector embeddings as input features for classification tasks on social graphs and networks. The evaluation shows that BeComE gives better accuracy and F1-score results on the ‘Cora’ and ‘Citeseer’ datasets.

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.640
Threshold uncertainty score0.737

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.005
Science and technology studies0.0000.000
Scholarly communication0.0010.002
Open science0.0020.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.033
GPT teacher head0.318
Teacher spread0.286 · 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