The paper introduces ELRUHNA, an unsupervised hypergraph alignment algorithm that jointly matches vertices and hyperedges, and reports accuracy gains of up to 25% over two baselines.
Proceedings of the National Academy of Sciences115(48) (2018) E11221–E11230
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
ELRUHNA: Elimination Rule-basedHypergraph Alignment
The paper introduces ELRUHNA, an unsupervised hypergraph alignment algorithm that jointly matches vertices and hyperedges, and reports accuracy gains of up to 25% over two baselines.