Fetching the paper…
Reading the bibliography…
The natural world is full of complex systems characterized by intricate relations between their components: from social interactions between individuals in a social network to electrostatic interactions between atoms in a protein.
M. Aschbacher, “Combinatorial cell complexes,” in Progress in Algebraic Combinatorics . Mathematical Society of Japan, 1996, pp. 1–80
1996
Earlier work this paper cites.
J. Y. Zien, M. D. Schlag, and P. K. Chan, “Multilevel spectral hypergraph partitioning with arbitrary vertex sizes,” IEEE Transactions on computer-aided design of integrated circuits and systems , vol. 18, no. 9, pp. 1389–1399, 1999
1999
Earlier work this paper cites.
R. Klette, “Cell complexes through time,” in Vision Geometry IX , vol. 4117. SPIE, 2000, pp. 134–145
2000
Earlier work this paper cites.
S. Agarwal, J. Lim, L. Zelnik-Manor, P. Perona, D. Kriegman, and S. Belongie, “Beyond pairwise clustering,” in 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05) , vol. 2. IEEE, 2005, pp. 838–845
2005
Earlier work this paper cites.
2006
Earlier work this paper cites.
D. Zhou, J. Huang, and B. Schölkopf, “Learning with hypergraphs: Clustering, classification, and embedding,” Advances in neural information processing systems , vol. 19, 2006
2006
Earlier work this paper cites.
M. Yang, E. Isufi, M. T. Schaub, and G. Leus, “Finite impulse response filters for simplicial complexes,” in 2021 29th European Signal Processing Conference (EUSIPCO) . IEEE, 2021, pp. 2005–2009
2009
Earlier work this paper cites.
X. Jiang, L.-H. Lim, Y. Yao, and Y. Ye, “Statistical ranking and combinatorial hodge theory,” Mathematical Programming , vol. 127, no. 1, pp. 203–244, 2011
2011
Earlier work this paper cites.
M. Hein, S. Setzer, L. Jost, and S. S. Rangapuram, “The total variation on hypergraphs-learning on hypergraphs revisited,” Advances in Neural Information Processing Systems , vol. 26, 2013
2013
Earlier work this paper cites.
G. Li, L. Qi, and G. Yu, “The z-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory,” Numerical Linear Algebra with Applications , vol. 20, no. 6, pp. 1001–1029, 2013
2013
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining , 2014, pp. 701–710
2014
Earlier work this paper cites.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining , 2016, pp. 855–864
2016
Earlier work this paper cites.
J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural message passing for quantum chemistry,” in International conference on machine learning . PMLR, 2017, pp. 1263–1272
2017
Earlier work this paper cites.
M. M. Bronstein, J. Bruna, Y. LeCun, A. Szlam, and P. Vandergheynst, “Geometric deep learning: going beyond euclidean data,” IEEE Signal Processing Magazine , vol. 34, no. 4, pp. 18–42, 2017
2017
Earlier work this paper cites.
A. Sharma, S. Joty, H. Kharkwal, and J. Srivastava, “Hyperedge2vec: Distributed representations for hyperedges,” 2018
2018
Earlier work this paper cites.
M. T. Schaub and S. Segarra, “Flow smoothing and denoising: Graph signal processing in the edge-space,” in 2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP) . IEEE, 2018, pp. 735–739
2018
Earlier work this paper cites.
D. Knoke and S. Yang, Social network analysis . SAGE publications, 2019
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
I. E. Chien, H. Zhou, and P. Li, “ h s 2 hs2 : Active learning over hypergraphs with pointwise and pairwise queries,” in The 22nd International Conference on Artificial Intelligence and Statistics . PMLR, 2019, pp. 2466–2475
2019
Earlier work this paper cites.
Y. Feng, H. You, Z. Zhang, R. Ji, and Y. Gao, “Hypergraph neural networks,” in Proceedings of the AAAI conference on artificial intelligence , vol. 33, 2019, pp. 3558–3565
2019
Earlier work this paper cites.
N. Yadati, M. Nimishakavi, P. Yadav, V. Nitin, A. Louis, and P. Talukdar, “Hypergcn: A new method for training graph convolutional networks on hypergraphs,” Advances in neural information processing systems , vol. 32, 2019
2019
Earlier work this paper cites.
D. Arya, S. Rudinac, and M. Worring, “Hyperlearn: a distributed approach for representation learning in datasets with many modalities,” in Proceedings of the 27th ACM International Conference on Multimedia , 2019, pp. 2245–2253
2019
Earlier work this paper cites.
J. Jiang, Y. Wei, Y. Feng, J. Cao, and Y. Gao, “Dynamic hypergraph neural networks,” in Proceedings of International Joint Conferences on Artificial Intelligence , 2019
2019
Earlier work this paper cites.
T. M. Roddenberry and S. Segarra, “Hodgenet: Graph neural networks for edge data,” in 2019 53rd Asilomar Conference on Signals, Systems, and Computers . IEEE, 2019, pp. 220–224
2019
Earlier work this paper cites.
J. Zhou, G. Cui, S. Hu, Z. Zhang, C. Yang, Z. Liu, L. Wang, C. Li, and M. Sun, “Graph neural networks: A review of methods and applications,” AI Open , vol. 1, pp. 57–81, 2020
2020
Earlier work this paper cites.
S. Barbarossa and S. Sardellitti, “Topological signal processing over simplicial complexes,” IEEE Transactions on Signal Processing , vol. 68, pp. 2992–3007, 2020
2020
Earlier work this paper cites.
2020
Earlier work this paper cites.
M. Hajij, K. Istvan, and G. Zamzmi, “Cell Complex Neural Networks,” NeurIPS 2020 Workshop TDA and Beyond , 2020
2020
Earlier work this paper cites.
2020
Cited alongside, same era.
J. Yi and J. Park, “Hypergraph convolutional recurrent neural network,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2020, pp. 3366–3376
2020
Cited alongside, same era.
K. Ding, J. Wang, J. Li, D. Li, and H. Liu, “Be more with less: Hypergraph attention networks for inductive text classification,” in Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP) . Online: Association for Computational Linguistics, Nov. 2020, pp. 4927–4936. [Online]. Available: https://aclanthology.org/2020.emnlp-main.399
2020
Cited alongside, same era.
F. Battiston, G. Cencetti, I. Iacopini, V. Latora, M. Lucas, A. Patania, J.-G. Young, and G. Petri, “Networks beyond pairwise interactions: structure and dynamics,” Physics Reports , vol. 874, pp. 1–92, 2020
K. Jha, S. Saha, and H. Singh, “Prediction of protein–protein interaction using graph neural networks,” Scientific Reports , vol. 12, no. 1, pp. 1–12, 2022
2022
Later among the works it cites.
C. Bodnar, “Topological deep learning: Graphs, complexes, sheaves,” Ph.D. dissertation, Apollo - University of Cambridge Repository, 2022. [Online]. Available: https://www.repository.cam.ac.uk/handle/1810/350982
2022
Later among the works it cites.
2022
Later among the works it cites.
Y. Chen, Y. R. Gel, and H. V. Poor, “Bscnets: Block simplicial complex neural networks,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 36, 2022, pp. 6333–6341
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2020
Cited alongside, same era.
M. T. Schaub, A. R. Benson, P. Horn, G. Lippner, and A. Jadbabaie, “Random walks on simplicial complexes and the normalized hodge 1-laplacian,” SIAM Review , vol. 62, no. 2, pp. 353–391, 2020
2020
Cited alongside, same era.
S. Ebli, M. Defferrard, and G. Spreemann, “Simplicial neural networks,” in TDA & Beyond , 2020
2020
Cited alongside, same era.
E. Bunch, Q. You, G. Fung, and V. Singh, “Simplicial 2-complex convolutional neural networks,” in TDA & Beyond , 2020
2020
Cited alongside, same era.
S. Liu, P. Lv, Y. Zhang, J. Fu, J. Cheng, W. Li, B. Zhou, and M. Xu, “Semi-dynamic hypergraph neural network for 3d pose estimation.” in IJCAI , 2020, pp. 782–788
2020
Cited alongside, same era.
D. Chen, Y. Lin, W. Li, P. Li, J. Zhou, and X. Sun, “Measuring and relieving the over-smoothing problem for graph neural networks from the topological view,” in Proceedings of the AAAI conference on artificial intelligence , vol. 34, 2020, pp. 3438–3445
2020
Cited alongside, same era.
K. Oono and T. Suzuki, “Graph neural networks exponentially lose expressive power for node classification,” in International Conference on Learning Representations , 2020. [Online]. Available: https://openreview.net/forum?id=S1ldO2EFPr
2020
Cited alongside, same era.
2020
Cited alongside, same era.
2021
Cited alongside, same era.
R. Yang, F. Sala, and P. Bogdan, “Efficient representation learning for higher-order data with simplicial complexes,” in Proceedings of the First Learning on Graphs Conference , ser. Proceedings of Machine Learning Research, B. Rieck and R. Pascanu, Eds., vol. 198. PMLR, 09–12 Dec 2022, pp. 13:1–13:21
2022
Later among the works it cites.
P. Veličković, “Message passing all the way up,” arXiv preprint arXiv:2202.11097 , 2022
2022
Later among the works it cites.
S. Heydari and L. Livi, “Message passing neural networks for hypergraphs,” in Proceedings of 31st International Conference on Artificial Neural Networks, Part II , ser. Lecture Notes in Computer Science, E. Pimenidis, P. P. Angelov, C. Jayne, A. Papaleonidas, and M. Aydin, Eds., vol. 13530. Springer, 2022, pp. 583–592
2022
Later among the works it cites.
M. Bronstein, “Beyond message passing: a physics-inspired paradigm for graph neural networks,” May 2022. [Online]. Available: https://thegradient.pub/graph-neural-networks-beyond-message-passing-and-weisfeiler-lehman/
2022
Later among the works it cites.
Y. Gao, Z. Zhang, H. Lin, X. Zhao, S. Du, and C. Zou, “Hypergraph learning: Methods and practices,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 44, no. 5, pp. 2548–2566, 2022
2022
Later among the works it cites.
E. Chien, C. Pan, J. Peng, and O. Milenkovic, “You are allset: A multiset function framework for hypergraph neural networks,” in International Conference on Learning Representations , 2022. [Online]. Available: https://openreview.net/forum?id=hpBTIv2uy_E
2022
Later among the works it cites.
J. Kim, S. Oh, S. Cho, and S. Hong, “Equivariant hypergraph neural networks,” in Computer Vision–ECCV 2022: 17th European Conference, Tel Aviv, Israel, October 23–27, 2022, Proceedings, Part XXI . Springer, 2022, pp. 86–103
2022
Later among the works it cites.
Y. Li, Z. Fan, J. Zhang, D. Shi, T. Xu, D. Yin, J. Deng, and X. Song, “Heterogeneous hypergraph neural network for friend recommendation with human mobility,” in Proceedings of the 31st ACM International Conference on Information & Knowledge Management , 2022, pp. 4209–4213
2022
Later among the works it cites.
M. Li, Y. Zhang, X. Li, Y. Zhang, and B. Yin, “Hypergraph transformer neural networks,” ACM Transactions on Knowledge Discovery from Data (TKDD) , 2022
2022
Later among the works it cites.
——, “Simplicial convolutional filters,” IEEE Transactions on Signal Processing , vol. 70, pp. 4633–4648, 2022
2022
Later among the works it cites.
E. Isufi and M. Yang, “Convolutional filtering in simplicial complexes,” in ICASSP 2022-2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . IEEE, 2022, pp. 5578–5582
2022
Later among the works it cites.
R. Yang, F. Sala, and P. Bogdan, “Efficient representation learning for higher-order data with simplicial complexes,” in Learning on Graphs Conference . PMLR, 2022, pp. 13–1
2022
Later among the works it cites.
M. Yang, E. Isufi, and G. Leus, “Simplicial convolutional neural networks,” in ICASSP 2022-2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . IEEE, 2022, pp. 8847–8851
2022
Later among the works it cites.
A. D. Keros, V. Nanda, and K. Subr, “Dist2cycle: A simplicial neural network for homology localization,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 36, 2022, pp. 7133–7142
2022
Later among the works it cites.
M. Hajij, K. N. Ramamurthy, A. Guzmán-Sáenz, and G. Za, “High Skip Networks: A Higher Order Generalization of Skip Connections,” in ICLR 2022 Workshop on Geometrical and Topological Representation Learning , 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
S. H. Lee, F. Ji, and W. P. Tay, “Sgat: Simplicial graph attention network,” in International Joint Conference on Artificial Intelligence , 2022
2022
Later among the works it cites.
M. Hajij, G. Zamzmi, T. Papamarkou, V. Maroulas, and X. Cai, “Simplicial complex representation learning,” in Machine Learning on Graphs (MLoG) Workshop at 15th ACM International WSDM (2022) Conference, WSDM2022-MLoG ; Conference date: 21-02-2022 Through 25-02-2022 , Jan. 2022
2022
Later among the works it cites.
T. M. Roddenberry, M. T. Schaub, and M. Hajij, “Signal processing on cell complexes,” in ICASSP 2022-2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . IEEE, 2022, pp. 8852–8856
2022
Later among the works it cites.
2022
Later among the works it cites.
2023
Closest in time.
T. K. Rusch, M. M. Bronstein, and S. Mishra, “A survey on oversmoothing in graph neural networks,” 2023
2023
Closest in time.