Two new spectral algorithms, GDSE and GDE, learn Euclidean embeddings of hypergraphs by optimizing a smoothed reconstruction loss, recovering planted geometry and improving spurious/missing membership detection and clustering.
Connectivity of Random Geometric Hypergraphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.SI 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Optimization of geometric hypergraph embedding
Two new spectral algorithms, GDSE and GDE, learn Euclidean embeddings of hypergraphs by optimizing a smoothed reconstruction loss, recovering planted geometry and improving spurious/missing membership detection and clustering.