A Scalable Unsupervised Framework for Comparing Graph Embeddings

DOI10.1007/978-3-030-48478-1_4OpenAlexW3033367644MaRDI QIDQ5041774

Paweł Prałat, Francois Theberge, Bogumił Kamiński

Publication date: 14 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-48478-1_4

zbMATH Keywords

graph embeddinggeometric Chung-Lu model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Unsupervised framework for evaluating structural node embeddings of graphs

Uses Software

• SNAP
• UMAP

Cites Work

• Unnamed Item
• Spatial Models for Virtual Networks
• Community structure in social and biological networks
• An unsupervised framework for comparing graph embeddings
• Networks

This page was built for publication: A Scalable Unsupervised Framework for Comparing Graph Embeddings