A Scalable Unsupervised Framework for Comparing Graph Embeddings

DOI10.1007/978-3-030-48478-1_4MaRDI QIDQ5041774zbMATH OpenOpenAlexFDO

Authors Bogumił Kamiński, Paweł Prałat, François Théberge

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

geometric Chung-Lu modelgraph embedding

Mathematics Subject Classification ID

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

Recommendations

• An unsupervised framework for comparing graph embeddings
• Unsupervised framework for evaluating structural node embeddings of graphs
• Comparing large graphs efficiently by margins of feature vectors
• A comparison of explicit and implicit graph embedding methods for pattern recognition
• Unsupervised learning for graph matching

Cites work

• An unsupervised framework for comparing graph embeddings
• Community structure in social and biological networks
• Complex graphs and networks
• Networks. An introduction.
• Spatial models for virtual networks

Cited in

(2)

• An unsupervised framework for comparing graph embeddings
• Unsupervised framework for evaluating structural node embeddings of graphs

Describes a project that uses

Uses Software

• SNAP
• UMAP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041774)