Bin Li

Bin Li

Auto-generated profile, based on publicly available information

Bin Li

School of Software, Yunnan University, Kunming 650500, China

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 August 2023 in Neural Networks
Verified
Journal Article
Open access
HDHaoran Duan
Haoran Duan
CXCheng Xie
Cheng Xie
BLBin Li
Bin Li
PTpeng tang
peng tang
Graph representation is a critical technology in the field of knowledge engineering and knowledge-based applications since most knowledge bases are represented in the graph structure. Nowadays, contrastive learning has become a prominent way for graph representation by contrasting positive-positive and positive-negative node pairs between two augmentation graphs. It has achieved new state-of-the-art in the field of self-supervised graph representation. However, existing contrastive graph representation methods mainly focus on modifying (normally removing some edges/nodes) the original graph structure to generate the augmentation graph for the contrastive. It inevitably changes the original graph structures, meaning the generated augmentation graph is no longer equivalent to the original graph. This harms the performance of the representation in many structure-sensitive graphs such as protein graphs, chemical graphs, molecular graphs, etc. Moreover, there is only one positive-positive node pair but relatively massive positive-negative node pairs in the self-supervised graph contrastive learning. This can lead to the same class, or very similar samples are considered negative samples. To this end, in this work, we propose a Virtual Masking Augmentation (VMA) to generate an augmentation graph without changing any structures from the original graph. Meanwhile, a node augmentation method is proposed to augment the positive node pairs by discovering the most similar nodes in the same graph. Then, two different augmentation graphs are generated and put into a contrastive learning model to learn the graph representation. Extensive experiments on massive datasets demonstrate that our method achieves new state-of-the-art results on self-supervised graph representation. The source code of the proposed method is available at https://github.com/DuanhaoranCC/CGRA.

1 July 2006 in International Journal of Image and Graphics
Verified
Journal Article
Closed access
BLBIN Li
BIN Li
DZDavid Zhang
David Zhang
KWKuanquan Wang
Kuanquan Wang

7 September 2022
Verified
Book Chapter
Closed access
PDF file
BLBin Li
Bin Li
CXCheng Xie
Cheng Xie
JYJingqi Yang
Jingqi Yang
HDHaoran Duan
Haoran Duan