{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T07:33:46Z","timestamp":1781249626287,"version":"3.54.1"},"reference-count":43,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.patcog.2026.113995","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T06:53:10Z","timestamp":1779432790000},"page":"113995","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"PA","title":["Fission-based Dynamic Hypergraph Neural Network"],"prefix":"10.1016","volume":"180","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4191-5077","authenticated-orcid":false,"given":"Wei","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7678-9528","authenticated-orcid":false,"given":"Xiaoyi","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6122-1139","authenticated-orcid":false,"given":"Qingzhe","family":"Cui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8946-620X","authenticated-orcid":false,"given":"Lixiang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7592-277X","authenticated-orcid":false,"given":"Xiaofeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.patcog.2026.113995_b1","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.inffus.2020.08.025","article-title":"Multiple graph kernel learning based on GMDH-type neural network","volume":"66","author":"Xu","year":"2021","journal-title":"Inf. Fusion"},{"key":"10.1016\/j.patcog.2026.113995_b2","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2020.107668","article-title":"Deep R\u00e9nyi entropy graph kernel","volume":"111","author":"Xu","year":"2021","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.113995_b3","series-title":"IPDPS","first-page":"885","article-title":"Distributed louvain algorithm for graph community detection","author":"Ghosh","year":"2018"},{"key":"10.1016\/j.patcog.2026.113995_b4","series-title":"WWW","first-page":"1082","article-title":"Traffic flow prediction via spatial temporal graph neural network","author":"Wang","year":"2020"},{"key":"10.1016\/j.patcog.2026.113995_b5","series-title":"AAAI","first-page":"3558","article-title":"Hypergraph neural networks","author":"Feng","year":"2019"},{"issue":"3","key":"10.1016\/j.patcog.2026.113995_b6","doi-asserted-by":"crossref","first-page":"3181","DOI":"10.1109\/TPAMI.2022.3182052","article-title":"HGNN+: General hypergraph neural networks","volume":"45","author":"Gao","year":"2023","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.patcog.2026.113995_b7","series-title":"Deep hypergraph structure learning","author":"Zhang","year":"2022"},{"key":"10.1016\/j.patcog.2026.113995_b8","series-title":"IJCAI","first-page":"2476","article-title":"Totally dynamic hypergraph neural networks","author":"Zhou","year":"2023"},{"issue":"5","key":"10.1016\/j.patcog.2026.113995_b9","first-page":"2548","article-title":"Hypergraph learning: Methods and practices","volume":"44","author":"Gao","year":"2022","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.patcog.2026.113995_b10","series-title":"WWW","first-page":"1127","article-title":"Graph neural networks beyond compromise between attribute and topology","author":"Yang","year":"2022"},{"key":"10.1016\/j.patcog.2026.113995_b11","first-page":"63","article-title":"Measuring statistical dependence with Hilbert-Schmidt norms","volume":"vol. 3734","author":"Gretton","year":"2005"},{"key":"10.1016\/j.patcog.2026.113995_b12","series-title":"ICML","article-title":"QBMK: quantum-based matching kernels for un-attributed graphs","author":"Bai","year":"2024"},{"key":"10.1016\/j.patcog.2026.113995_b13","first-page":"1327","article-title":"A hierarchical transitive-aligned graph kernel for un-attributed graphs","volume":"vol. 162","author":"Bai","year":"2022"},{"key":"10.1016\/j.patcog.2026.113995_b14","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2022.109242","article-title":"Position-aware and structure embedding networks for deep graph matching","volume":"136","author":"Chen","year":"2023","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.113995_b15","first-page":"44","article-title":"Coupled-feature hypergraph representation for feature selection","volume":"vol. 9069","author":"Zhang","year":"2015"},{"issue":"4","key":"10.1016\/j.patcog.2026.113995_b16","doi-asserted-by":"crossref","first-page":"4593","DOI":"10.1109\/TNNLS.2022.3144343","article-title":"Two-level graph neural network","volume":"35","author":"Ai","year":"2024","journal-title":"IEEE Trans. Neural Networks Learn. Syst."},{"issue":"4","key":"10.1016\/j.patcog.2026.113995_b17","doi-asserted-by":"crossref","first-page":"1651","DOI":"10.1109\/TNNLS.2020.3027426","article-title":"Graph motif entropy for understanding time-evolving networks","volume":"34","author":"Zhang","year":"2023","journal-title":"IEEE Trans. Neural Networks Learn. Syst."},{"key":"10.1016\/j.patcog.2026.113995_b18","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.patcog.2016.01.004","article-title":"Depth-based hypergraph complexity traces from directed line graphs","volume":"54","author":"Bai","year":"2016","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.113995_b19","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.patcog.2016.06.009","article-title":"Joint hypergraph learning and sparse regression for feature selection","volume":"63","author":"Zhang","year":"2017","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.113995_b20","series-title":"IJCAI","first-page":"1923","article-title":"Hypergraph structure learning for hypergraph neural networks","author":"Cai","year":"2022"},{"key":"10.1016\/j.patcog.2026.113995_b21","series-title":"SIGKDD","first-page":"6534","article-title":"A survey on hypergraph neural networks: An in-depth and step-by-step guide","author":"Kim","year":"2024"},{"key":"10.1016\/j.patcog.2026.113995_b22","series-title":"IJCAI","first-page":"2635","article-title":"Dynamic hypergraph neural networks","author":"Jiang","year":"2019"},{"key":"10.1016\/j.patcog.2026.113995_b23","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2020.107637","article-title":"Hypergraph convolution and hypergraph attention","volume":"110","author":"Bai","year":"2021","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.113995_b24","series-title":"ICLR","article-title":"DistillHGNN: A knowledge distillation approach for high-speed hypergraph neural networks","author":"Forouzandeh","year":"2025"},{"key":"10.1016\/j.patcog.2026.113995_b25","series-title":"ICML","article-title":"SHARP-distill: A 68\u00d7faster recommender system with hypergraph neural networks and language models","author":"Forouzandeh","year":"2025"},{"key":"10.1016\/j.patcog.2026.113995_b26","series-title":"NeurIPS","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","author":"Zhu","year":"2020"},{"key":"10.1016\/j.patcog.2026.113995_b27","series-title":"ICLR","article-title":"Ordered GNN: ordering message passing to deal with heterophily and over-smoothing","author":"Song","year":"2023"},{"key":"10.1016\/j.patcog.2026.113995_b28","series-title":"AAAI","first-page":"11740","article-title":"SEA-GWNN: simple and effective adaptive graph wavelet neural network","author":"Deb","year":"2024"},{"key":"10.1016\/j.patcog.2026.113995_b29","series-title":"ICLR","article-title":"KAN: Kolmogorov-arnold networks","author":"Liu","year":"2025"},{"key":"10.1016\/j.patcog.2026.113995_b30","series-title":"Wav-KAN: Wavelet Kolmogorov-arnold networks","author":"Bozorgasl","year":"2024"},{"key":"10.1016\/j.patcog.2026.113995_b31","series-title":"CVPR","first-page":"1738","article-title":"Video object segmentation by hypergraph cut","author":"Huang","year":"2009"},{"issue":"9","key":"10.1016\/j.patcog.2026.113995_b32","doi-asserted-by":"crossref","first-page":"2564","DOI":"10.1109\/TKDE.2015.2415497","article-title":"Visual classification by l1-hypergraph modeling","volume":"27","author":"Wang","year":"2015","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"10.1016\/j.patcog.2026.113995_b33","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1109\/TMM.2014.2298216","article-title":"Topic-sensitive influencer mining in interest-based social media networks via hypergraph learning","volume":"16","author":"Fang","year":"2014","journal-title":"IEEE Trans. Multim."},{"key":"10.1016\/j.patcog.2026.113995_b34","first-page":"2638","article-title":"Graph fission and cross-validation","volume":"vol. 238","author":"Leiner","year":"2024"},{"issue":"1","key":"10.1016\/j.patcog.2026.113995_b35","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":"10.1016\/j.patcog.2026.113995_b36","series-title":"ICLR","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2015"},{"key":"10.1016\/j.patcog.2026.113995_b37","series-title":"ICLR","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2017"},{"key":"10.1016\/j.patcog.2026.113995_b38","series-title":"ICLR","article-title":"Graph attention networks","author":"Velickovic","year":"2018"},{"key":"10.1016\/j.patcog.2026.113995_b39","series-title":"NeurIPS","first-page":"1024","article-title":"Inductive representation learning on large graphs","author":"Hamilton","year":"2017"},{"key":"10.1016\/j.patcog.2026.113995_b40","series-title":"ICLR","article-title":"Adaptive universal generalized PageRank graph neural network","author":"Chien","year":"2021"},{"key":"10.1016\/j.patcog.2026.113995_b41","series-title":"AAAI","first-page":"3950","article-title":"Beyond low-frequency information in graph convolutional networks","author":"Bo","year":"2021"},{"key":"10.1016\/j.patcog.2026.113995_b42","series-title":"ICML","article-title":"Sign is not a remedy: Multiset-to-multiset message passing for learning on heterophilic graphs","author":"Liang","year":"2024"},{"key":"10.1016\/j.patcog.2026.113995_b43","series-title":"ICML 2020 Workshop on Graph Representation Learning and beyond (GRL+)","article-title":"HNHN: Hypergraph networks with hyperedge neurons","author":"Dong","year":"2020"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S003132032600960X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S003132032600960X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T14:43:33Z","timestamp":1780929813000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S003132032600960X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":43,"alternative-id":["S003132032600960X"],"URL":"https:\/\/doi.org\/10.1016\/j.patcog.2026.113995","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fission-based Dynamic Hypergraph Neural Network","name":"articletitle","label":"Article Title"},{"value":"Pattern Recognition","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.patcog.2026.113995","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"113995"}}