2020
DOI: 10.48550/arxiv.2008.03626
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Directed hypergraph neural network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…A directed hypergraph can also be illustrated by adding a visual channel to a hypergraph that is usually visualized as standard networks or bipartite networks. The directed hyperedges of each combination causes can be bounded to point to an effect entity, as well as the hyperedges of individual cause can directly point to the effect entities [43]. Volpentesta et al [47] proposed a polynomial time algorithm for finding the s-hypernetwork in a directed hypergraph.…”
Section: Visual Causality Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…A directed hypergraph can also be illustrated by adding a visual channel to a hypergraph that is usually visualized as standard networks or bipartite networks. The directed hyperedges of each combination causes can be bounded to point to an effect entity, as well as the hyperedges of individual cause can directly point to the effect entities [43]. Volpentesta et al [47] proposed a polynomial time algorithm for finding the s-hypernetwork in a directed hypergraph.…”
Section: Visual Causality Analysismentioning
confidence: 99%
“…Our proposed combined causality can be visualized with a directed hypergraph [5] [43]. The directed hyperedges of each combination causes can be bounded to point to a effect entity, the hyperedges of a individual cause can directly point to the effect entity.…”
Section: Visual Causality Analysismentioning
confidence: 99%