{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T15:37:58Z","timestamp":1783697878980,"version":"3.55.0"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031198021","type":"print"},{"value":"9783031198038","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-19803-8_6","type":"book-chapter","created":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T13:05:16Z","timestamp":1666443916000},"page":"86-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Equivariant Hypergraph Neural Networks"],"prefix":"10.1007","author":[{"given":"Jinwoo","family":"Kim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saeyoon","family":"Oh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sungjun","family":"Cho","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Seunghoon","family":"Hong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,23]]},"reference":[{"key":"6_CR1","unstructured":"Albooyeh, M., Bertolini, D., Ravanbakhsh, S.: Incidence networks for geometric deep learning. arXiv (2019)"},{"key":"6_CR2","unstructured":"Arya, D., Gupta, D.K., Rudinac, S., Worring, M.: Hypersage: generalizing inductive representation learning on hypergraphs. arXiv (2020)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Bai, S., Zhang, F., Torr, P.H.S.: Hypergraph convolution and hypergraph attention. Pattern Recognit. (2021)","DOI":"10.1016\/j.patcog.2020.107637"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Belongie, S.J., Malik, J., Puzicha, J.: Shape matching and object recognition using shape contexts. IEEE Trans. Pattern Anal. Mach. Intell. (2002)","DOI":"10.1109\/34.993558"},{"key":"6_CR5","unstructured":"Berend, D., Tassa, T.: Improved bounds on bell numbers and on moments of sums of random variables. Probability and Mathematical Statistics. (2010)"},{"key":"6_CR6","unstructured":"Berge, C., Minieka., E.: Graphs and Hypergraphs. North-Holland Publishing Company (1981)"},{"key":"6_CR7","unstructured":"Bevilacqua, B., et al.: Equivariant subgraph aggregation networks. In: ICLR (2022)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Botsch, M., Pauly, M., Kobbelt, L., Alliez, P., L\u00e9vy, B.: Geometric modeling based on polygonal meshes. In: Eurographics Tutorials (2008)","DOI":"10.1145\/3250724"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Bourdev, L., Malik, J.: Poselets: body part detectors trained using 3d human pose annotations. In: ICCV (2009)","DOI":"10.1109\/ICCV.2009.5459303"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Bu, J., et al.: Music recommendation by unified hypergraph: combining social media information and music content. In: Proceedings of the 18th International Conference on Multimedia 2010, Firenze, Italy, 25\u201329 October, 2010 (2010)","DOI":"10.1145\/1873951.1874005"},{"key":"6_CR11","unstructured":"Cai, C., Wang, Y.: A note on over-smoothing for graph neural networks. arXiv (2020)"},{"key":"6_CR12","unstructured":"Chen, Z., Chen, L., Villar, S., Bruna, J.: Can graph neural networks count substructures? In: NeurIPS (2020)"},{"key":"6_CR13","unstructured":"Chien, E., Pan, C., Peng, J., Milenkovic, O.: You are allset: a multiset function framework for hypergraph neural networks. In: ICLR (2022)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Cho, M., Alahari, K., Ponce, J.: Learning graphs to match. In: ICCV (2013)","DOI":"10.1109\/ICCV.2013.11"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Ding, K., Wang, J., Li, J., Li, D., Liu, H.: 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 2020, Online, 16\u201320 November, 2020 (2020)","DOI":"10.18653\/v1\/2020.emnlp-main.399"},{"key":"6_CR16","unstructured":"Dong, Y., Sawin, W., Bengio, Y.: HNHN: hypergraph networks with hyperedge neurons. arXiv (2020)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Everingham, M., Van Gool, L., Williams, C.K., Winn, J., Zisserman, A.: The pascal visual object classes (voc) challenge. Int. J. Comput. Vis. (2010)","DOI":"10.1007\/s11263-009-0275-4"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Feng, Y., You, H., Zhang, Z., Ji, R., Gao, Y.: Hypergraph neural networks. In: AAAI (2019)","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Gao, Y., Wang, M., Tao, D., Ji, R., Dai, Q.: 3-d object retrieval and recognition with hypergraph analysis. IEEE Trans. Image Process. (2012)","DOI":"10.1109\/TIP.2012.2199502"},{"key":"6_CR20","unstructured":"Gilmer, J., Schoenholz, S.S., Riley, P.F., Vinyals, O., Dahl, G.E.: Neural message passing for quantum chemistry. In: ICML (2017)"},{"key":"6_CR21","unstructured":"Gu, F., Chang, H., Zhu, W., Sojoudi, S., Ghaoui, L.E.: Implicit graph neural networks. In: NeurIPS (2020)"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Gu, S., Yang, M., Medaglia, J.D., Gur, R.C., Gur, R.E., Satterthwaite, T.D., Bassett, D.S.: Functional hypergraph uncovers novel covariant structures over neurodevelopment. Human Brain Mapp. (2017)","DOI":"10.1002\/hbm.23631"},{"key":"6_CR23","unstructured":"Ha, D., Dai, A.M., Le, Q.V.: Hypernetworks. In: ICLR (2017)"},{"key":"6_CR24","unstructured":"Hamilton, W.L., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: NeurIPS (2017)"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Hornik, K., Stinchcombe, M.B., White, H.: Multilayer feedforward networks are universal approximators. Neural Networks (1989)","DOI":"10.1016\/0893-6080(89)90020-8"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Huang, J., Yang, J.: Unignn: a unified framework for graph and hypergraph neural networks. In: IJCAI (2021)","DOI":"10.24963\/ijcai.2021\/353"},{"key":"6_CR27","unstructured":"Ishiguro, K., ichi Maeda, S., Koyama, M.: Graph warp module: an auxiliary module for boosting the power of graph neural networks in molecular graph analysis. arXiv (2019)"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Kalai, G.: Linear programming, the simplex algorithm and simple polytopes. Math. Program. (1997)","DOI":"10.1007\/BF02614318"},{"key":"6_CR29","unstructured":"Keriven, N., Peyr\u00e9, G.: Universal invariant and equivariant graph neural networks. In: NeurIPS (2019)"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Kim, E., Kang, W., On, K., Heo, Y., Zhang, B.: Hypergraph attention networks for multimodal learning. In: CVPR (2020)","DOI":"10.1109\/CVPR42600.2020.01459"},{"key":"6_CR31","unstructured":"Kim, J., et al.: Pure transformers are powerful graph learners. arXiv (2022)"},{"key":"6_CR32","unstructured":"Kim, J., Oh, S., Hong, S.: Transformers generalize deepsets and can be extended to graphs and hypergraphs. In: NeurIPS (2021)"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Klimm, F., Deane, C.M., Reinert, G., Estrada, E.: Hypergraphs for predicting essential genes using multiprotein complex data. J. Complex Networks 9, cnaa028 (2021)","DOI":"10.1093\/comnet\/cnaa028"},{"key":"6_CR34","unstructured":"Knyazev, B., Taylor, G.W., Amer, M.R.: Understanding attention and generalization in graph neural networks. In: NeurIPS (2019)"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Kofidis, E., Regalia, P.A.: On the best rank-1 approximation of higher-order supersymmetric tensors. Siam J. Matrix Anal. Appl. 23, 863\u2013884 (2002)","DOI":"10.1137\/S0895479801387413"},{"key":"6_CR36","unstructured":"Lee, J., et al.: Set transformer: a framework for attention-based permutation-invariant neural networks. In: ICML (2019)"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Li, D., Xu, Z., Li, S., Sun, X.: Link prediction in social networks based on hypergraph. In: 22nd International World Wide Web Conference, WWW \u201913, Rio de Janeiro, Brazil, 13\u201317 May 2013, Companion Volume (2013)","DOI":"10.1145\/2487788.2487802"},{"key":"6_CR38","unstructured":"Li, J., Cai, D., He, X.: Learning graph-level representation for drug discovery. arXiv (2017)"},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Li, Q., Han, Z., Wu, X.: Deeper insights into graph convolutional networks for semi-supervised learning. In: AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Louis, S.M., et al.: Global attention based graph convolutional neural networks for improved materials property prediction. arXiv (2020)","DOI":"10.1039\/D0CP01474E"},{"key":"6_CR41","doi-asserted-by":"crossref","unstructured":"Lowe, D.G.: Object recognition from local scale-invariant features. In: ICCV (1999)","DOI":"10.1109\/ICCV.1999.790410"},{"key":"6_CR42","unstructured":"Maron, H., Ben-Hamu, H., Serviansky, H., Lipman, Y.: Provably powerful graph networks. In: NeurIPS (2019)"},{"key":"6_CR43","unstructured":"Maron, H., Ben-Hamu, H., Shamir, N., Lipman, Y.: Invariant and equivariant graph networks. In: ICLR (2019)"},{"key":"6_CR44","unstructured":"Maron, H., Fetaya, E., Segol, N., Lipman, Y.: On the universality of invariant networks. In: ICML (2019)"},{"key":"6_CR45","doi-asserted-by":"crossref","unstructured":"Maron, H., Litany, O., Chechik, G., Fetaya, E.: On learning sets of symmetric elements. In: ICML (2020)","DOI":"10.24963\/ijcai.2021\/653"},{"key":"6_CR46","unstructured":"Milano, F., Loquercio, A., Rosinol, A., Scaramuzza, D., Carlone, L.: Primal-dual mesh convolutional neural networks. In: NeurIPS (2020)"},{"key":"6_CR47","unstructured":"Oono, K., Suzuki, T.: Graph neural networks exponentially lose expressive power for node classification. In: ICLR (2020)"},{"key":"6_CR48","unstructured":"Puny, O., Ben-Hamu, H., Lipman, Y.: From graph low-rank global attention to 2-fwl approximation. In: ICML (2020)"},{"key":"6_CR49","unstructured":"Ray, L.A.: 2-d and 3-d image registration for medical, remote sensing, and industrial applications. J. Electronic Imaging (2005)"},{"key":"6_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-030-58604-1_25","volume-title":"Computer Vision \u2013 ECCV 2020","author":"M Rol\u00ednek","year":"2020","unstructured":"Rol\u00ednek, M., Swoboda, P., Zietlow, D., Paulus, A., Musil, V., Martius, G.: Deep graph matching via Blackbox differentiation of combinatorial solvers. In: Vedaldi, A., Bischof, H., Brox, T., Frahm, J.-M. (eds.) ECCV 2020. LNCS, vol. 12373, pp. 407\u2013424. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58604-1_25"},{"key":"6_CR51","unstructured":"Serviansky, H., et al.: Set2graph: learning graphs from sets. In: NeurIPS (2020)"},{"key":"6_CR52","doi-asserted-by":"publisher","unstructured":"Tan, S., Bu, J., Chen, C., He, X.: Using rich social media information for music recommendation via hypergraph model. In: Hoi, S., Luo, J., Boll, S., Xu, D., Jin, R., King, I. (eds.) Social Media Modeling and Computing. Springer, London (2011). https:\/\/doi.org\/10.1007\/978-0-85729-436-4_10","DOI":"10.1007\/978-0-85729-436-4_10"},{"key":"6_CR53","unstructured":"Vaswani, A., et al.: Attention is all you need. In: NeurIPS (2017)"},{"key":"6_CR54","unstructured":"Velikovic, P.: Message passing all the way up. arXiv (2022)"},{"key":"6_CR55","doi-asserted-by":"crossref","unstructured":"Wang, R., Yan, J., Yang, X.: Neural graph matching network: Learning lawler\u2019s quadratic assignment problem with extension to hypergraph and multiple-graph matching. IEEE Trans. Pattern Anal. Mach. Intell. (2021)","DOI":"10.1109\/TPAMI.2021.3078053"},{"key":"6_CR56","unstructured":"Wu, Z., Jain, P., Wright, M.A., Mirhoseini, A., Gonzalez, J.E., Stoica, I.: Representing long-range context for graph neural networks with global attention. arXiv (2021)"},{"key":"6_CR57","unstructured":"Yadati, N., Nimishakavi, M., Yadav, P., Nitin, V., Louis, A., Talukdar, P.P.: Hypergcn: A new method for training graph convolutional networks on hypergraphs. In: NeurIPS (2019)"},{"key":"6_CR58","doi-asserted-by":"crossref","unstructured":"Yavartanoo, M., Hung, S., Neshatavar, R., Zhang, Y., Lee, K.M.: Polynet: Polynomial neural network for 3d shape recognition with polyshape representation. In: 3DV (2021)","DOI":"10.1109\/3DV53792.2021.00109"},{"key":"6_CR59","unstructured":"Zaheer, M., Kottur, S., Ravanbakhsh, S., P\u00f3czos, B., Salakhutdinov, R., Smola, A.J.: Deep sets. In: NeurIPS (2017)"},{"key":"6_CR60","doi-asserted-by":"crossref","unstructured":"Zhang, M., Cui, Z., Neumann, M., Chen, Y.: An end-to-end deep learning architecture for graph classification. In: AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11782"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19803-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T14:04:32Z","timestamp":1682604272000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19803-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031198021","9783031198038"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19803-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Computer Vision","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tel Aviv","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eccv2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eccv2022.ecva.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5804","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1645","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.21","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.91","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"From the workshops, 367 reviewed full papers have been selected for publication","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}