{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T17:07:41Z","timestamp":1763140061696,"version":"3.45.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T00:00:00Z","timestamp":1761696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T00:00:00Z","timestamp":1761696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62306224"],"award-info":[{"award-number":["62306224"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s40747-025-02102-5","type":"journal-article","created":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:21:25Z","timestamp":1761718885000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-level contrastive learning for exploring graphs with higher-order dependencies in sequential data"],"prefix":"10.1007","volume":"11","author":[{"given":"Zhiluohan","family":"Guo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5964-0123","authenticated-orcid":false,"given":"Xiangyi","family":"Teng","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,29]]},"reference":[{"issue":"2","key":"2102_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M Newman","year":"2003","unstructured":"Newman M (2003) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256","journal-title":"SIAM Rev"},{"issue":"1","key":"2102_CR2","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1109\/TCYB.2019.2931983","volume":"51","author":"X Teng","year":"2021","unstructured":"Teng X, Liu J, Li M (2021) Overlapping community detection in directed and undirected attributed networks using a multiobjective evolutionary algorithm. IEEE Trans Cybern 51(1):138\u2013151","journal-title":"IEEE Trans Cybern"},{"issue":"3","key":"2102_CR3","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1038\/nrm1859","volume":"7","author":"P Aloy","year":"2006","unstructured":"Aloy P, Russell RB (2006) Structural systems biology: modelling protein interactions. Nat Rev Mol Cell Biol 7(3):188\u2013197","journal-title":"Nat Rev Mol Cell Biol"},{"issue":"6","key":"2102_CR4","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1109\/TKDE.2005.99","volume":"17","author":"G Adomavicius","year":"2005","unstructured":"Adomavicius G, Tuzhilin A (2005) Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE Trans Knowl Data Eng 17(6):734\u2013749","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"8","key":"2102_CR5","doi-asserted-by":"publisher","first-page":"2785","DOI":"10.1073\/pnas.0611164104","volume":"104","author":"H Jody","year":"2007","unstructured":"Jody H, Nielsen R (2007) Integration within the Felsenstein equation for improved Markov chain Monte Carlo methods in population genetics. Proc Natl Acad Sci USA 104(8):2785\u20132790","journal-title":"Proc Natl Acad Sci USA"},{"key":"2102_CR6","doi-asserted-by":"crossref","unstructured":"Belth C, Kamran F, Tjandra D, Koutra D (2019) When to remember where you came from: node representation learning in higher-order networks. In: Proceedings of the 2019 IEEE\/ACM international conference on advances in social networks analysis and mining, pp 222\u2013225","DOI":"10.1145\/3341161.3342911"},{"issue":"5","key":"2102_CR7","doi-asserted-by":"publisher","first-page":"1600028","DOI":"10.1126\/sciadv.1600028","volume":"2","author":"J Xu","year":"2016","unstructured":"Xu J, Wickramarathne TL, Chawla NV (2016) Representing higher-order dependencies in networks. Sci Adv 2(5):1600028","journal-title":"Sci Adv"},{"key":"2102_CR8","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.ins.2021.05.083","volume":"574","author":"X Teng","year":"2021","unstructured":"Teng X, Liu J, Li L (2021) A synchronous feature learning method for multiplex network embedding. Inf Sci 574:176\u2013191","journal-title":"Inf Sci"},{"issue":"4","key":"2102_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1038\/s41567-019-0459-y","volume":"15","author":"R Lambiotte","year":"2019","unstructured":"Lambiotte R, Rosvall M, Scholtes I (2019) From networks to optimal higher-order models of complex systems. Nat Phys 15(4):313\u2013320","journal-title":"Nat Phys"},{"issue":"3","key":"2102_CR10","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1093\/comnet\/cnu016","volume":"2","author":"M Kivel\u00e4","year":"2014","unstructured":"Kivel\u00e4 M, Arenas A, Barthelemy M, Gleeson JP, Moreno Y, Porter MA (2014) Multilayer networks. J Complex Netw 2(3):203\u2013271","journal-title":"J Complex Netw"},{"key":"2102_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.127046","volume":"566","author":"J Sun","year":"2024","unstructured":"Sun J, Xiang L (2024) Finite-time quasi-synchronization of multi-layer heterogeneous networks with distributed hybrid control. Neurocomputing 566:127046","journal-title":"Neurocomputing"},{"issue":"6295","key":"2102_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson AR, Gleich DF, Leskovec J (2016) Higher-order organization of complex networks. Science 353(6295):163\u2013166","journal-title":"Science"},{"key":"2102_CR13","doi-asserted-by":"crossref","unstructured":"Mo S, Teng X, Wu K, Liu J, Yuan K (2025) A universal subhyper graph-assisted embedding framework for both homogeneous and heterogeneous networks. IEEE Trans Knowl Data Eng 37(9):4935\u20134947","DOI":"10.1109\/TKDE.2025.3581963"},{"issue":"2","key":"2102_CR14","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/rsa.20645","volume":"49","author":"S Mukherjee","year":"2016","unstructured":"Mukherjee S, Steenbergen J (2016) Random walks on simplicial complexes and harmonics. Random Struct Algorithms 49(2):379\u2013405","journal-title":"Random Struct Algorithms"},{"issue":"10","key":"2102_CR15","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1038\/s41567-021-01371-4","volume":"17","author":"F Battiston","year":"2021","unstructured":"Battiston F, Amico E, Barrat A, Bianconi G, Arruda G, Franceschiello B, Iacopini I, K\u00e9fi S, Latora V, Moreno Y (2021) The physics of higher-order interactions in complex systems. Nat Phys 17(10):1093\u20131098","journal-title":"Nat Phys"},{"key":"2102_CR16","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.neucom.2020.09.077","volume":"423","author":"H Huang","year":"2021","unstructured":"Huang H, Lei M, Feng C (2021) Hypergraph network model for nested entity mention recognition. Neurocomputing 423:200\u2013206","journal-title":"Neurocomputing"},{"key":"2102_CR17","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1109\/TKDE.2024.3522975","volume":"37","author":"W Yan","year":"2024","unstructured":"Yan W, Ma H, Yang Z (2024) Segmented sequence prediction using variable-order Markov model ensemble. IEEE Trans Knowl Data Eng 37:1425\u20131438","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"2102_CR18","doi-asserted-by":"publisher","first-page":"5024","DOI":"10.1038\/ncomms6024","volume":"5","author":"I Scholtes","year":"2014","unstructured":"Scholtes I, Wider N, Pfitzner R, Garas A, Tessone CJ, Schweitzer F (2014) Causality-driven slow-down and speed-up of diffusion in non-Markovian temporal networks. Nat Commun 5(1):5024","journal-title":"Nat Commun"},{"issue":"11","key":"2102_CR19","doi-asserted-by":"publisher","first-page":"13113","DOI":"10.1007\/s11071-025-11069-4","volume":"113","author":"Y Hao","year":"2025","unstructured":"Hao Y, Wang J, Liu J, Zheng Z (2025) Causality-driven propagation speed on temporal networks. Nonlinear Dyn 113(11):13113\u201313130","journal-title":"Nonlinear Dyn"},{"key":"2102_CR20","doi-asserted-by":"crossref","unstructured":"Sahasrabuddhe R, Lambiotte R, Rosvall M (2025) Concise network models of memory dynamics reveal explainable patterns in path data. arXiv preprint arXiv:2501.08302","DOI":"10.1126\/sciadv.adw4544"},{"key":"2102_CR21","doi-asserted-by":"crossref","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) DeepWalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201914. Association for Computing Machinery, New York, pp 701\u2013710","DOI":"10.1145\/2623330.2623732"},{"key":"2102_CR22","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201916. Association for Computing Machinery, New York, pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"key":"2102_CR23","doi-asserted-by":"crossref","unstructured":"Tang J, Qu M, Wang M, Zhang M, Yan J, Mei Q (2015) LINE: large-scale information network embedding. WWW \u201915. International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE, pp 1067\u20131077","DOI":"10.1145\/2736277.2741093"},{"key":"2102_CR24","doi-asserted-by":"crossref","unstructured":"Cao S, Lu W, Xu Q (2015) GraRep: learning graph representations with global structural information. In: Proceedings of the 24th ACM international on conference on information and knowledge management. CIKM \u201915. Association for Computing Machinery, New York, pp 891\u2013900","DOI":"10.1145\/2806416.2806512"},{"key":"2102_CR25","doi-asserted-by":"crossref","unstructured":"Ou M, Cui P, Pei J, Zhang Z, Zhu W (2016) Asymmetric transitivity preserving graph embedding. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201916. Association for Computing Machinery, New York, pp 1105\u20131114","DOI":"10.1145\/2939672.2939751"},{"key":"2102_CR26","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: International conference on learning representations"},{"key":"2102_CR27","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Li\u00f2 P, Bengio Y (2018) Graph attention networks. In: International conference on learning representations"},{"key":"2102_CR28","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Inductive representation learning on large graphs. In: Proceedings of the 31st international conference on neural information processing systems. NIPS\u201917. Curran Associates Inc., Red Hook, pp 1025\u20131035"},{"key":"2102_CR29","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S (2019) How powerful are graph neural networks? In: International conference on learning representations"},{"key":"2102_CR30","unstructured":"Zeng H, Zhou H, Srivastava A, Kannan R, Prasanna V (2020) GraphSAINT: graph sampling based inductive learning method. In: International conference on learning representations"},{"issue":"4","key":"2102_CR31","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1089\/big.2019.0169","volume":"8","author":"M Saebi","year":"2020","unstructured":"Saebi M, Ciampaglia GL, Kaplan LM, Chawla NV (2020) HONEM: learning embedding for higher order networks. Big Data 8(4):255\u2013269 (PMID: 32820952)","journal-title":"Big Data"},{"key":"2102_CR32","doi-asserted-by":"crossref","unstructured":"Jin D, Gong Y, Wang Z, Yu Z, He D, Huang Y, Wang W (2022) Graph neural network for higher-order dependency networks. In: Proceedings of the ACM web conference 2022. WWW \u201922. Association for Computing Machinery, New York, pp 1622\u20131630","DOI":"10.1145\/3485447.3512161"},{"key":"2102_CR33","unstructured":"Krieg S, Burgis W, Soga P, Chawla N (2023) Deep ensembles for graphs with higher-order dependencies. In: The eleventh international conference on learning representations"},{"key":"2102_CR34","unstructured":"Veli\u010dkovi\u0107 P, Fedus W, Hamilton WL, Li\u00f2 P, Bengio Y, Hjelm RD (2019) Deep graph infomax. In: International conference on learning representations"},{"key":"2102_CR35","unstructured":"Zhu Y, Xu Y, Yu F, Liu Q, Wu S, Wang L (2020) Deep graph contrastive representation learning. arXiv preprint arXiv:2006.04131"},{"key":"2102_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109631","volume":"256","author":"P Bielak","year":"2022","unstructured":"Bielak P, Kajdanowicz T, Chawla NV (2022) Graph Barlow twins: a self-supervised representation learning framework for graphs. Knowl-Based Syst 256:109631","journal-title":"Knowl-Based Syst"},{"key":"2102_CR37","unstructured":"Thakoor S, Tallec C, Azar MG, Azabou M, Dyer EL, Munos R, Veli\u010dkovi\u0107 P, Valko M (2022) Large-scale representation learning on graphs via bootstrapping. In: International conference on learning representations"},{"key":"2102_CR38","unstructured":"Aldous D, Fill JA (2002) Reversible Markov chains and random walks on graphs. Unfinished monograph, recompiled 2014. http:\/\/www.stat.berkeley.edu\/~aldous\/RWG\/book.html"},{"key":"2102_CR39","doi-asserted-by":"publisher","first-page":"193907","DOI":"10.1109\/ACCESS.2020.3031549","volume":"8","author":"PH Le-Khac","year":"2020","unstructured":"Le-Khac PH, Healy G, Smeaton AF (2020) Contrastive representation learning: a framework and review. IEEE Access 8:193907\u2013193934","journal-title":"IEEE Access"},{"key":"2102_CR40","doi-asserted-by":"crossref","unstructured":"Hadsell R, Chopra S, LeCun Y (2006) Dimensionality reduction by learning an invariant mapping. In: 2006 IEEE computer society conference on computer vision and pattern recognition (CVPR\u201906), vol 2, pp 1735\u20131742","DOI":"10.1109\/CVPR.2006.100"},{"key":"2102_CR41","unstructured":"Chen T, Kornblith S, Norouzi M, Hinton G (2020) A simple framework for contrastive learning of visual representations. In: International conference on machine learning. PMLR, pp 1597\u20131607"},{"key":"2102_CR42","doi-asserted-by":"crossref","unstructured":"Qiu J, Chen Q, Dong Y, Zhang J, Yang H, Ding M, Wang K, Tang J (2020) GCC: graph contrastive coding for graph neural network pre-training. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining. KDD \u201920. Association for Computing Machinery, New York, pp 1150\u20131160","DOI":"10.1145\/3394486.3403168"},{"issue":"3","key":"2102_CR43","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1109\/TKDE.2007.46","volume":"19","author":"F Fouss","year":"2007","unstructured":"Fouss F, Pirotte A, Renders J-M, Saerens M (2007) Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans Knowl Data Eng 19(3):355\u2013369","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"29","key":"2102_CR44","doi-asserted-by":"publisher","first-page":"12755","DOI":"10.1073\/pnas.0903215107","volume":"107","author":"J-C Delvenne","year":"2010","unstructured":"Delvenne J-C, Yaliraki SN, Barahona M (2010) Stability of graph communities across time scales. Proc Natl Acad Sci 107(29):12755\u201312760","journal-title":"Proc Natl Acad Sci"},{"key":"2102_CR45","doi-asserted-by":"crossref","unstructured":"Krieg SJ, Kogge PM, Chawla NV (2021) GrowHON: a scalable algorithm for growing higher-order networks of sequences. In: Complex networks and their applications IX: Volume 2, Proceedings of the ninth international conference on complex networks and their applications, COMPLEX NETWORKS 2020. Springer, pp 485\u2013496","DOI":"10.1007\/978-3-030-65351-4_39"},{"key":"2102_CR46","doi-asserted-by":"crossref","unstructured":"Kullback S, Leibler RA (1951) On information and sufficiency. Ann Math Stat 22(1):79\u201386","DOI":"10.1214\/aoms\/1177729694"},{"key":"2102_CR47","unstructured":"Mikolov T, Chen K, Corrado G, Dean J (2013) Efficient estimation of word representations in vector space. In: International conference on learning representations"},{"key":"2102_CR48","unstructured":"Oord AVD, Li Y, Vinyals O (2018) Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748"},{"key":"2102_CR49","doi-asserted-by":"crossref","unstructured":"L\u00fc L, Zhou T (2011) Link prediction in complex networks: a survey. Phys A 390(6):1150\u20131170","DOI":"10.1016\/j.physa.2010.11.027"},{"key":"2102_CR50","unstructured":"Transport for London (2024) Tube\u2014Transport for London. https:\/\/tfl.gov.uk\/modes\/tube\/. Accessed 2 Dec 2024"},{"key":"2102_CR51","unstructured":"West R, Pineau J, Precup D (2009) Wikispeedia: an online game for inferring semantic distances between concepts. In: Twenty-first international joint conference on artificial intelligence"},{"issue":"1","key":"2102_CR52","doi-asserted-by":"publisher","first-page":"4630","DOI":"10.1038\/ncomms5630","volume":"5","author":"M Rosvall","year":"2014","unstructured":"Rosvall M, Esquivel AV, Lancichinetti A, West JD, Lambiotte R (2014) Memory in network flows and its effects on spreading dynamics and community detection. Nat Commun 5(1):4630","journal-title":"Nat Commun"},{"issue":"7","key":"2102_CR53","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1641\/B570707","volume":"57","author":"MD Spalding","year":"2007","unstructured":"Spalding MD, Fox HE, Allen GR, Davidson N, Ferda\u00f1a ZA, Finlayson M, Halpern BS, Jorge MA, Lombana A, Lourie SA (2007) Marine ecoregions of the world: a bioregionalization of coastal and shelf areas. Bioscience 57(7):573\u2013583","journal-title":"Bioscience"},{"issue":"7","key":"2102_CR54","doi-asserted-by":"publisher","first-page":"0220353","DOI":"10.1371\/journal.pone.0220353","volume":"15","author":"M Saebi","year":"2020","unstructured":"Saebi M, Xu J, Grey EK, Lodge DM, Corbett JJ, Chawla N (2020) Higher-order patterns of aquatic species spread through the global shipping network. PLoS ONE 15(7):0220353","journal-title":"PLoS ONE"},{"key":"2102_CR55","unstructured":"Eliasof M, Haber E, Treister E (2022) Pathgcn: learning general graph spatial operators from paths. In: International conference on machine learning. PMLR, pp 5878\u20135891"},{"issue":"11","key":"2102_CR56","first-page":"2579","volume":"9","author":"L Maaten","year":"2008","unstructured":"Maaten L, Hinton G (2008) Visualizing data using t-SNE. J Mach Learn Res 9(11):2579\u20132605","journal-title":"J Mach Learn Res"},{"key":"2102_CR57","doi-asserted-by":"crossref","unstructured":"Wilcoxon F (1992) Individual comparisons by ranking methods. In: Breakthroughs in statistics: methodology and distribution. Springer, pp 196\u2013202","DOI":"10.1007\/978-1-4612-4380-9_16"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-02102-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-025-02102-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-02102-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T17:01:44Z","timestamp":1763139704000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-025-02102-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,29]]},"references-count":57,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2102"],"URL":"https:\/\/doi.org\/10.1007\/s40747-025-02102-5","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"type":"print","value":"2199-4536"},{"type":"electronic","value":"2198-6053"}],"subject":[],"published":{"date-parts":[[2025,10,29]]},"assertion":[{"value":"20 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors have no relevant financial or non-financial interests to disclose. On behalf of all authors, the corresponding author states that there is no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This study did not involve human or animal subjects, and thus, no ethical approval was required.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"All authors have approved the manuscript for submission and without any potential conflict of interest.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent"}}],"article-number":"485"}}