Simplicial Neural Networks
About
We present simplicial neural networks (SNNs), a generalization of graph neural networks to data that live on a class of topological spaces called simplicial complexes. These are natural multi-dimensional extensions of graphs that encode not only pairwise relationships but also higher-order interactions between vertices - allowing us to consider richer data, including vector fields and $n$-fold collaboration networks. We define an appropriate notion of convolution that we leverage to construct the desired convolutional neural networks. We test the SNNs on the task of imputing missing data on coauthorship complexes.
Stefania Ebli, Micha\"el Defferrard, Gard Spreemann• 2020
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Node Classification | Citeseer | Accuracy79.87 | 804 | |
| Node Classification | Pubmed | Accuracy86.73 | 742 | |
| Node Classification | Cora (test) | Mean Accuracy87.13 | 687 | |
| Node Classification | Squirrel (test) | Mean Accuracy45.66 | 234 | |
| Node Classification | Chameleon (test) | Mean Accuracy60.96 | 230 | |
| Node Classification | Texas (test) | Mean Accuracy75.16 | 228 | |
| Node Classification | Wisconsin (test) | Mean Accuracy61.93 | 198 | |
| Node Classification | Actor (test) | Mean Accuracy0.3059 | 143 | |
| Node Classification | Photo (test) | Mean Accuracy88.27 | 69 | |
| Node Classification | Computers (test) | Mean Accuracy83.33 | 68 |
Showing 10 of 10 rows