Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
May 18, 2021

Computationally Tractable Riemannian Manifolds for Graph Embeddings

View Full Paper
Ask AI
Bookmark
Share

Authors

CCCalin CruceruGBGary BécigneulOGOctavian-Eugen Ganea

Discussion

Loading...

Member takes

Overview

Key Points

Key points are not available for this paper at this time.

Cite This Study

Cruceru et al. (2021) studied this question.

synapsesocial.com/papers/6a808cc4aef022754b92889chttps://doi.org/10.1609/aaai.v35i8.16877
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Discriminative Deep Random Walk for Network Classification2016 · 141 citations
  2. 2The Geometry of Algorithms with Orthogonality Constraints1998 · 2,783 citations
  3. 3Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching2006 · 549 citations
  4. 4SECTIONAL CURVATURES OF GRASSMANN MANIFOLDS1968 · 60 citations
  5. 5A Global Geometric Framework for Nonlinear Dimensionality Reduction2000 · 13,873 citations