MétaCan
Menu
Back to cohort

Social Network Analysis using Knowledge-Graph Embeddings and Convolution Operations

2021· article· en· W3158277099 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Graph Neural Networks
Canadian institutionsUniversity of Windsor
FundersCompute CanadaInternational Business Machines Corporation
KeywordsComputer scienceGraphArtificial intelligenceConvolution (computer science)Node (physics)Theoretical computer scienceSocial network analysisFeature learningSocial network (sociolinguistics)Machine learningArtificial neural networkSocial mediaWorld Wide Web

Abstract

fetched live from OpenAlex

Link prediction and node classification in social networks remain open research problems with respect to Artificial Intelligence (AI). Innate representations about social network structures can be effectively harnessed for training AI models in a bid to predict ties; and detect clusters via classification of actors with regard to a given social network. In this paper, we have proposed a distinct hybrid model: Representation Learning via Knowledge-Graph Embeddings and Convolution Operations (RLVECO), which hybridizes the strengths of Knowledge-Graph Embeddings (VE) and Convolution Operations (CO) in extracting and learning meaningful features from social graphs via Representation Learning (RL). RLVECO utilizes an edge sampling approach for exploiting features of a social graph via learning the context of each actor with respect to its neighboring actors.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.771
Threshold uncertainty score0.434

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.003
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.024
GPT teacher head0.306
Teacher spread0.283 · 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

Quick stats

Citations1
Published2021
Admission routes2
Has abstractyes

Explore more

Same topicAdvanced Graph Neural NetworksFrench-language works237,207