Evidence map›Paper›PMID 35647617›Full record

ArticleProceedings of the ... International Conference on Web Search & Data Mining. International Conference on Web Search & Data Mining2022

Bringing Your Own View: Graph Contrastive Learning without Prefabricated Data Augmentations.

Yuning You, Tianlong Chen, Zhangyang Wang, Yang Shen

Abstract read
In one paragraph

Article in Proceedings of the ... International Conference on Web Search & Data Mining. International Conference on Web Search & Data Mining, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 9 papers, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
9citing papers in PubMed, 1 pooled it
–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

9 citing papers in PubMed, 1 synthesis or guideline pooled it.

  1. Pooled it
  2. Article
  3. Article
  4. Article
  5. Detecting anomalous proteins using deep representations.NAR genomics and bioinformatics · 2024
    Article
  6. A Good View for Graph Contrastive Learning.Entropy (Basel, Switzerland) · 2024
    Article
  7. Article
  8. Graph Domain Adaptation via Theory-Grounded Spectral Regularization.... International Conference on Learning Representations · 2023
    Article
  9. Article
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.

Yuning YouTexas A&M University.
Tianlong ChenUniversity of Texas at Austin.
Zhangyang WangUniversity of Texas at Austin.
Yang ShenTexas A&M University.

Funding

Unraveling molecular and system-level mechanisms of human disease-associated protein mutationsR35GM124952 · NIGMS · TEXAS ENGINEERING EXPERIMENT STATION · PI Yang Shen · 2017 to 2026
$2.9M
NIGMS NIH HHS R35 GM124952
6 · The paper itself

Abstract

Self-supervision is recently surging at its new frontier of graph learning. It facilitates graph representations beneficial to downstream tasks; but its success could hinge on domain knowledge for handcraft or the often expensive trials and errors. Even its state-of-the-art representative, graph contrastive learning (GraphCL), is not completely free of those needs as GraphCL uses a prefabricated prior reflected by the ad-hoc manual selection of graph data augmentations. Our work aims at advancing GraphCL by answering the following questions:

Indexed as

Graph contrastive learninggraph generative modelinformation bottleneckinformation minimization

Identifiers

PMID35647617
PMCPMC9130056

What OpenQuestion holds

Textmetadata
LicenceTDM
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.