MétaCan
Menu
Back to cohort

The Application of Graph Neural Network in Natural Language Processing and Computer Vision

2021· article· en· W4226436280 on OpenAlexaff
Xiaochen Liu, Yang Su, Bingjie Xu

Bibliographic record

Venue2021 3rd International Conference on Machine Learning, Big Data and Business Intelligence (MLBDBI) · 2021
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Graph Neural Networks
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceCategorizationArtificial intelligenceDeep learningBenchmark (surveying)GraphArtificial neural networkEuclidean geometryRecurrent neural networkTransformation (genetics)Machine learningNatural language processingTheoretical computer science

Abstract

fetched live from OpenAlex

Graphs can represent information transformation via geometrical relations, which have been well studied and applied in various research areas. A graph-based learning network named Graph Neural Network (GNN) arose with the vast development of deep learning in recent years. Unlike traditional deep learning networks such as CNN and RNN, GNN is superior in dealing with non-Euclidean graph data. This survey focuses on two widespread application fields of GNN, natural language processing (NLP) and computer vision (CV). Firstly, based on the tasks they perform, we categorize the most popular research sub-domains of NLP and CV, purpose a detailed review on the application of GNN in these areas. Secondly, we thoroughly analyzed the benchmark datasets applied in the GNN models while comparing them with different evaluation metrics. Finally, we briefly discuss the potential future direction of GNN according to its model building procedure and related application branches.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.004
Science and technology studies0.0000.001
Scholarly communication0.0010.003
Open science0.0010.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0030.001

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.036
GPT teacher head0.319
Teacher spread0.284 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations5
Published2021
Admission routes1
Has abstractyes

Explore more

Same venue2021 3rd International Conference on Machine Learning, Big Data and Business Intelligence (MLBDBI)Same topicAdvanced Graph Neural NetworksFrench-language works237,207