High-Speed and Noise-Robust Embedding of Hypergraphs Based on Double-Centered Incidence Matrix

DOI10.1007/978-3-030-93413-2_45zbMath1506.05151OpenAlexW4205953116MaRDI QIDQ5050372

Takayasu Fushimi, Shuta Ito

Publication date: 15 November 2022

Published in: Complex Networks & Their Applications X (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-93413-2_45

zbMATH Keywords

embedding methodvery noisy hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Uses Software

• node2vec

Cites Work

• Complex networks \& their applications IX. Volume 1. Proceedings of the 9th international conference, COMPLEX NETWORKS 2020, virtual, December 1--3, 2020
• Multidimensional scaling. I: Theory and method
• Deep Community Detection

This page was built for publication: High-Speed and Noise-Robust Embedding of Hypergraphs Based on Double-Centered Incidence Matrix