Classically boosted network embeddings

Joel Nishimura, Yunpeng Zhao

Research output: Contribution to journalArticlepeer-review


Network embeddings are a popular and effective pre-processing step when performing machine learning with network data. We demonstrate that standard boosting techniques, AdaBoost and Real AdaBoost can be applied to network embedding techniques to increase performance, particularly in terms of link prediction on test data in a cross-validation context. These approaches produce results competitive with other state-of-the-art embedding approaches when applied to a number of empirical networks. Additionally, we show on simulated data that Real AdaBoost can de-aggregate some networks, wherein networks created by two independent latent features can have those separate latent features inferred by different boosted rounds. Further analysis of the performance of these boosted methods shows that they retain the characteristic robustness to over-fitting as boosting methods in classical settings.

Original languageEnglish (US)
Article numbercnac001
JournalJournal of Complex Networks
Issue number1
StatePublished - Feb 1 2022


  • AdaBoost
  • Boosting
  • Graph Embeddings
  • Link Prediction
  • Network De-aggregation
  • Network Embeddings

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Management Science and Operations Research
  • Control and Optimization
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Classically boosted network embeddings'. Together they form a unique fingerprint.

Cite this