Clustering Hypergraphs via the MapEquation
A hypergraph is a generalization of a graph in that the restriction of pairwise affinity scores is lifted in favor of affinity scores that can be evaluated between an arbitrary number of inputs. Hypergraphs clustering is the process of finding groups in which members of a given hypergraph exhibit a...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2021-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9416464/ |