{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T14:56:30Z","timestamp":1784904990975,"version":"3.55.0"},"reference-count":85,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1109\/tpami.2024.3434483","type":"journal-article","created":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T17:35:32Z","timestamp":1722015332000},"page":"19-31","source":"Crossref","is-referenced-by-count":16,"title":["Adaptive Neural Message Passing for Inductive Learning on Hypergraphs"],"prefix":"10.1109","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8652-0741","authenticated-orcid":false,"given":"Devanshu","family":"Arya","sequence":"first","affiliation":[{"name":"Serket, Amsterdam, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deepak K.","family":"Gupta","sequence":"additional","affiliation":[{"name":"Transmute AI Lab (Texmin Hub), IIT Dhanbad, Dhanbad, Jharkhand, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1904-8736","authenticated-orcid":false,"given":"Stevan","family":"Rudinac","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Amsterdam, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4097-4136","authenticated-orcid":false,"given":"Marcel","family":"Worring","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Amsterdam, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143847"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"ref3","article-title":"HyperSAGE: Generalizing inductive representation learning on hypergraphs","author":"Arya","year":"2020"},{"key":"ref4","first-page":"44","article-title":"Fusing structural and functional MRIs using graph convolutional networks for autism classification","volume-title":"Proc. 3rd Conf. Med. Imag. Deep Learn.","author":"Arya"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3343031.3350572"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CBMI.2019.8877384"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3206025.3206062"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107637"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/18M1203031"},{"key":"ref10","volume-title":"Graphs and Hypergraphs","author":"Berge","year":"1976"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8462-3_5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2693418"},{"key":"ref13","first-page":"1","article-title":"Spectral networks and locally connected networks on graphs","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Bruna"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1873951.1874005"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3178123"},{"key":"ref16","first-page":"871","article-title":"Community detection in hypergraphs: Optimal statistical limit and efficient algorithms","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Chien"},{"key":"ref17","article-title":"On the use of arxiv as a dataset","author":"Clement","year":"2019"},{"key":"ref18","article-title":"Principal neighbourhood aggregation for graph nets","author":"Corso","year":"2020"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.3389\/conf.fninf.2013.09.00041"},{"key":"ref20","first-page":"3844","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Defferrard"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.399"},{"key":"ref22","article-title":"HNHN: Hypergraph networks with hyperedge neurons","author":"Dong","year":"2020"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2019.8852002"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0184661"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2020.3030408"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.2172\/1592845"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380297"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3039374"},{"key":"ref31","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Gilmer"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2005.1555942"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/hbm.23631"},{"key":"ref34","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref35","first-page":"2427","article-title":"The total variation on hypergraphs-learning on hypergraphs revisited","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Hein"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/353"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1460096.1460104"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/366"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/NSW.2013.6609212"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.01459"},{"key":"ref41","first-page":"1","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kingma"},{"key":"ref42","article-title":"Deep learning with graph-structured representations","author":"Kipf","year":"2020"},{"key":"ref43","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnaa028"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772755"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2487802"},{"key":"ref47","article-title":"DeeperGCN: All you need to train deeper GCNs","author":"Li","year":"2020"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1002\/nla.1877"},{"key":"ref49","article-title":"Gated graph sequence neural networks","author":"Li","year":"2015"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2624140"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20591"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1488"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33765-9_59"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"ref55","article-title":"Janossy pooling: Learning deep permutation-invariant functions for variable-size inputs","author":"Murphy","year":"2018"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroimage.2017.09.005"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.media.2018.06.001"},{"key":"ref58","article-title":"Deep hyperedges: A framework for transductive and inductive learning on hypergraphs","volume-title":"Proc. Neural Inf. Process. Syst.: Workshop Sets Partitions","author":"Payne","year":"2019"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref61","article-title":"Very deep convolutional networks for large-scale image recognition","author":"Simonyan","year":"2014"},{"issue":"1","key":"ref62","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"Srivastava","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/2037676.2037679"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883041"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.3389\/fpsyt.2020.00440"},{"key":"ref66","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313562"},{"key":"ref68","article-title":"Stochastic aggregation in graph neural networks","author":"Wang","year":"2021"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33018981"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2016.7761624"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6288382"},{"key":"ref73","first-page":"1","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu"},{"key":"ref74","article-title":"Neural message passing for multi-relational ordered and recursive hypergraphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Yadati"},{"key":"ref75","first-page":"1511","article-title":"HyperGCN: A new method for training graph convolutional networks on hypergraphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Yadati"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00297"},{"key":"ref77","article-title":"Hypergraph learning with line expansion","author":"Yang","year":"2020"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380016"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330961"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11780"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2950213"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2981333"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/7503.003.0205"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1002\/9781119790327.ch5"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/34\/10777928\/10612216.pdf?arnumber=10612216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T06:28:06Z","timestamp":1733380086000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10612216\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":85,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2024.3434483","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}