GraphWalks: Efficient Shape Agnostic Geodesic Shortest Path Estimation

Potamias, Rolandos Alexandros; Neofytou, Alexandros; Bintsi, Kyriaki Margarita; Zafeiriou, Stefanos

doi:10.1109/cvprw56347.2022.00335

Cited by 5 publications

(1 citation statement)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While none of the representation learning techniques mentioned explicitly integrate geometric features or account for underlying geometric features within the vector space, several studies, both theoretical and experimental -have explored the incorporation of more intricate spaces for embedding purposes [10] [11]. Furthermore, embedding methods need to be able to handle large, complex networks like protein-protein interaction (PPI) networks and preserve their global properties.…”

Section: Introductionmentioning

confidence: 99%

IsoGloVe: A New Count-based Graph Embedding Method based on Geodesic Distance

Nahali,

Safari,

Khanteymoori

et al. 2023

Proceedings of the Canadian Conference on Artificial Intelligence

View full text Add to dashboard Cite

Graph embedding techniques have gained increasing attention for their ability to encode the complex structural information of networks into low-dimensional vectors. Existing graph embedding methods have achieved considerable success in various applications. However, these methods have limitations in capturing global graph topology information and fail to provide insights into the underlying mechanisms of network function. In this paper, we propose IsoGloVe, a count-based method that encodes graph topology into vectors using the co-occurrence statistics of fixed-size routes in random walks. IsoGloVe calculates the final embeddings based on the geodesic distances of the node's neighbors on a manifold. This representation in geodesic space allows for the analysis of node interactions and contributes to a better understanding of complex network structure and function. The performance of IsoGloVe is evaluated on various protein-protein interactions (PPI) using graph reconstruction, node classification, and visualization. The findings reveal that IsoGloVe surpasses other comparable methods with a 30% increase in MAP for graph reconstruction and a 25% increase in model scores for node classification in the Yeast PPI network. In addition, IsoGloVe demonstrated a 6.9% increase in MAP for graph reconstruction on the Human PPI network.

show abstract

Section: Introductionmentioning

confidence: 99%