Dissimilar Nodes Improve Graph Active Learning

1 code implementation • 5 Dec 2022 • Zhicheng Ren, Yifu Yuan, Yuxin Wu, Xiaxuan Gao, Yewen Wang, Yizhou Sun

The existing Active Graph Embedding framework proposes to use centrality score, density score, and entropy score to evaluate the value of unlabeled nodes, and it has been shown to be capable of bringing some improvement to the node classification tasks of Graph Convolutional Networks.

Active Learning Graph Embedding +1

TIMME: Twitter Ideology-detection via Multi-task Multi-relational Embedding

1 code implementation • 2 Jun 2020 • Zhiping Xiao, Weiping Song, Haoyan Xu, Zhicheng Ren, Yizhou Sun

However, the incompleteness of the labels and the features in social network datasets is tricky, not to mention the enormous data size and the heterogeneousity.