Laplacian-based Semi-Supervised Learning in Multilayer Hypergraphs by Coordinate Descent

Abstract

Graph Semi-Supervised learning is an important data analysis tool, where given a graph and a set of labeled nodes, the aim is to infer the labels to the remaining unlabeled nodes. In this paper, we start by considering an optimization-based formulation of the problem for an undirected graph, and then we extend this formulation to multilayer hypergraphs. We solve the problem using different coordinate descent approaches and compare the results with the ones obtained by the classic gradient descent method. Experiments on synthetic and real-world datasets show the potential of using coordinate descent methods with suitable selection rules.

Please cite this paper as:

@article{venturini2023laplacian,
  title={Laplacian-based Semi-Supervised Learning in Multilayer Hypergraphs by Coordinate Descent},
  author={Venturini, S. and Cristofari, A. and Rinaldi, F. and Tudisco, F.},
  journal={EURO Journal on Computational Optimization},
  year={2023}
}

Keywords: semi-supervised learning classification label propagation clustering community detection hypergraph networks higher-order networks