Bipartite Edge Prediction via Transductive Learning over Product Graphs

Abstract

This paper addresses the problem of predicting the missing edges of a bipartite graph where each side of the vertices has its own intrinsic structure. We propose a new optimization framework to map the two sides of the intrinsic structures onto the manifold structure of the edges via a graph product, and to reduce the original problem to vertex label propagation over the product graph. This framework enjoys flexible choices in the formulation of graph products, and supports a rich family of graph transduction schemes with scalable inference. Experiments on benchmark datasets for collaborative filtering, citation network analysis and prerequisite prediction of online courses show advantageous performance of the proposed approach over other state-of-the-art methods.

Cite

Text

Liu and Yang. "Bipartite Edge Prediction via Transductive Learning over Product Graphs." International Conference on Machine Learning, 2015.

Markdown

[Liu and Yang. "Bipartite Edge Prediction via Transductive Learning over Product Graphs." International Conference on Machine Learning, 2015.](https://mlanthology.org/icml/2015/liu2015icml-bipartite/)

BibTeX

@inproceedings{liu2015icml-bipartite,
  title     = {{Bipartite Edge Prediction via Transductive Learning over Product Graphs}},
  author    = {Liu, Hanxiao and Yang, Yiming},
  booktitle = {International Conference on Machine Learning},
  year      = {2015},
  pages     = {1880-1888},
  volume    = {37},
  url       = {https://mlanthology.org/icml/2015/liu2015icml-bipartite/}
}