MétaCan
Menu
Back to cohort
Record W6976866797 · doi:10.60692/hk0kf-nrc03

InductiveQE Datasets

2022· article· en· W6976866797 on OpenAlexaff

Bibliographic record

VenueGreater South Information System · 2022
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Graph Neural Networks
Canadian institutionsMcGill University
Fundersnot available
KeywordsInferenceDisjoint setsGraphGraph databaseTraining setSet (abstract data type)

Abstract

fetched live from OpenAlex

InductiveQE datasets UPD 2.0: Regenerated datasets free of potential test set leakages UPD 1.1: Added train_answers_val.pkl files to all freebase-derived datasets - answers of training queries on larger validation graphs This repository contains 10 inductive complex query answering datasets published in "Inductive Logical Query Answering in Knowledge Graphs" (NeurIPS 2022). 9 datasets (106-550) were created from FB15k-237, the wikikg dataset was created from OGB WikiKG 2 graph. In the datasets, all inference graphs extend training graphs and include new nodes and edges. Dataset numbers indicate a relative size of the inference graph compared to the training graph, e.g., in 175, the number of nodes in the inference graph is 175% compared to the number of nodes in the training graph. The higher the ratio, the more new unseen nodes appear at inference time, the more complex the task is. The Wikikg split has a fixed 133% ratio. Each dataset is a zip archive containing 17 files: train_graph.txt (pt for wikikg) - original training graph val_inference.txt (pt) - inference graph (validation split), new nodes in validation are disjoint with the test inference graph val_predict.txt (pt) - missing edges in the validation inference graph to be predicted. test_intference.txt (pt) - inference graph (test splits), new nodes in test are disjoint with the validation inference graph test_predict.txt (pt) - missing edges in the test inference graph to be predicted. train/valid/test_queries.pkl - queries of the respective split, 14 query types for fb-derived datasets, 9 types for Wikikg (EPFO-only) *_answers_easy.pkl - easy answers to respective queries that do not require predicting missing links but only edge traversal *_answers_hard.pkl - hard answers to respective queries that DO require predicting missing links and against which the final metrics will be computed train_answers_val.pkl - the extended set of answers for training queries on the bigger validation graph, most of training queries have at least 1 more new answers. This is supposed to be an inference-only dataset to measure faithfulness of trained models train_answers_test.pkl - the extended set of answers for training queries on the bigger test graph, most of training queries have at least 1 more new answers. This is supposed to be an inference-only dataset to measure faithfulness of trained models og_mappings.pkl - contains entity2id / relation2id dictionaries mapping local node/relation IDs from a respective dataset to the original fb15k237 / wikikg2 stats.txt - a small file with dataset stats Overall unzipped size of all datasets combined is about 10 GB. Please refer to the paper for the sizes of graphs and the number of queries per graph. The Wikikg dataset is supposed to be evaluated in the inference-only regime being pre-trained solely on simple link prediction, the number of training complex queries is not enough for such a large dataset. Paper pre-print: https://arxiv.org/abs/2210.08008 The full source code of training/inference models is available at https://github.com/DeepGraphLearning/InductiveQE

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.004
metaresearch head score (Gemma)0.018
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Dataset · Consensus signal: Dataset
Teacher disagreement score0.072
Threshold uncertainty score0.240

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.018
Meta-epidemiology (narrow)0.0030.001
Meta-epidemiology (broad)0.0020.004
Bibliometrics0.0060.008
Science and technology studies0.0020.001
Scholarly communication0.0030.004
Open science0.0080.004
Research integrity0.0040.004
Insufficient payload (model declined to judge)0.0720.086

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.031
GPT teacher head0.214
Teacher spread0.183 · 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 designNot applicable
Domainnot available
GenreDataset

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

Citations0
Published2022
Admission routes1
Has abstractyes

Explore more

Same venueGreater South Information SystemSame topicAdvanced Graph Neural NetworksFrench-language works237,207