Revisiting Semi-Supervised Learning with Graph Embeddings

By Zhilin Yang, William W. Cohen, Ruslan Salakhutdinov. 2016

2,546 citations recorded by the source corpus.

We present a semi-supervised learning framework based on graph embeddings. Given a graph between instances, we train an embedding for each instance to jointly predict the class label and the neighborhood context in the graph. We develop both transductive and inductive variants of our method. In the transductive variant of our method, the class labels are determined by both the learned embeddings and input feature vectors, while in the inductive variant, the embeddings are defined as a parametric function of the feature vectors, so predictions can be made on instances not seen during training. On a large and diverse set of benchmark tasks, including text classification, distantly supervised entity extraction, and entity classification, we show improved performance over many of the existing models.

Subfields: Artificial Intelligence, Representation & Self-Supervised Learning, Graph Learning

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Yoshua Bengio
  2. Mohit Bansal
  3. Quoc V. Le
  4. Percy Liang
  5. Jianfeng Gao
  6. Ruslan Salakhutdinov
  7. Sergey Levine
  8. Luke S. Zettlemoyer

In Representation & Self-Supervised Learning

  1. William L. Hamilton
  2. Jure Leskovec
  3. Stephan Günnemann
  4. Yoshua Bengio
  5. Philip S. Yu
  6. Jian Tang
  7. Aleksandar Bojchevski
  8. Bryan Perozzi

In Graph Learning

  1. William L. Hamilton
  2. Jure Leskovec
  3. Stephan Günnemann
  4. Aleksandar Bojchevski
  5. Matthias Fey
  6. Michael M. Bronstein
  7. Jian Tang
  8. Marinka Zitnik

Citations in the corpus