Login / Signup

A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Data.

Jiajin LiJianheng TangLemin KongHuikang LiuJia LiAnthony Man-Cho SoJose H. Blanchet
Published in: CoRR (2023)
Keyphrases
  • learning algorithm
  • objective function
  • k means
  • worst case
  • matching algorithm
  • dynamic programming
  • clustering method
  • graph isomorphism
  • graph mining
  • graph data