2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) 2020
DOI: 10.1109/trustcom50675.2020.00215
|View full text |Cite
|
Sign up to set email alerts
|

Hypergraph Attention Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(19 citation statements)
references
References 20 publications
0
2
0
Order By: Relevance
“…Message propagation on the hypergraph is more complex than the graph, involving two stages: attentive hyperedge aggregation and attentive vertex aggregation [41]. In the attentive hyperedge aggregation, the connected vertexes in the same hyperedge are aggregated to generate the hyperedge embeddings.…”
Section: Methodsmentioning
confidence: 99%
“…Message propagation on the hypergraph is more complex than the graph, involving two stages: attentive hyperedge aggregation and attentive vertex aggregation [41]. In the attentive hyperedge aggregation, the connected vertexes in the same hyperedge are aggregated to generate the hyperedge embeddings.…”
Section: Methodsmentioning
confidence: 99%
“…Examples where multiway relations cannot be reduced to an ensemble of pairwise relations are gene regulatory networks [19,20], where some reactions occur only when a set of multiple (not only two) genes interact, or applications in network neuroscience [21,22]. To overcome this problem, many architectures defined on general hypergraphs have been proposed [23][24][25][26][27], and some works incorporating attention mechanisms for hypergraphs neural networks have been published [28,29].…”
Section: Introductionmentioning
confidence: 99%
“…Such methods require complicated transformation processes and are prone to lose high-order information. The other is to transform and propagate vertex (node) feature information directly on hypergraph [9]- [11], [13], [15], [19], [24]- [26]. Vertex-hyperedge-vertex transformation is the most common feature transformation and propagation mode in this kind of networks.…”
mentioning
confidence: 99%
“…Different from HGNN, it uses multi-layer perception (MLP) based vertex convolution and hyperedge convolution to propagate features. By introducing attention mechanism [11], [25], [26], this transformation is further improved that can automatically learn the importance of vertices and hyperedges. The vertex-hyperedgevertex transformation is essentially weighted aggregation of neighborhood information for each node, whose neighborhood size is determined by its associated hyperedges, as shown in Fig.…”
mentioning
confidence: 99%
See 1 more Smart Citation