Evidence map›Paper›PMID 36673172›Full record

ArticleEntropy (Basel, Switzerland)2022

Self-Supervised Node Classification with Strategy and Actively Selected Labeled Set.

Yi Kang, Ke Liu, Zhiyuan Cao, Jiacai Zhang

Abstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Yi KangSchool of Artificial Intelligence, Beijing Normal University, No. 19 Xinjiekouwai Street, Haidian District, Beijing 100875, China.ORCID 0000-0002-5950-2887
Ke LiuSchool of Artificial Intelligence, Beijing Normal University, No. 19 Xinjiekouwai Street, Haidian District, Beijing 100875, China.
Zhiyuan CaoSchool of Artificial Intelligence, Beijing Normal University, No. 19 Xinjiekouwai Street, Haidian District, Beijing 100875, China.
Jiacai ZhangSchool of Artificial Intelligence, Beijing Normal University, No. 19 Xinjiekouwai Street, Haidian District, Beijing 100875, China.

Funding

National Natural Science Foundation of China 61977010
6 · The paper itself

Abstract

To alleviate the impact of insufficient labels in less-labeled classification problems, self-supervised learning improves the performance of graph neural networks (GNNs) by focusing on the information of unlabeled nodes. However, none of the existing self-supervised pretext tasks perform optimally on different datasets, and the choice of hyperparameters is also included when combining self-supervised and supervised tasks. To select the best-performing self-supervised pretext task for each dataset and optimize the hyperparameters with no expert experience needed, we propose a novel auto graph self-supervised learning framework and enhance this framework with a one-shot active learning method. Experimental results on three real world citation datasets show that training GNNs with automatically optimized pretext tasks can achieve or even surpass the classification accuracy obtained with manually designed pretext tasks. On this basis, compared with using randomly selected labeled nodes, using actively selected labeled nodes can further improve the classification performance of GNNs. Both the active selection and the automatic optimization contribute to semi-supervised node classification.

Indexed as

active learningautomatic hyperparameter optimizationgraph neural networkself-supervised learningsemi-supervised classification

Identifiers

PMID36673172
PMCPMC9857737

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.