{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T06:29:59Z","timestamp":1769754599661,"version":"3.49.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030653507","type":"print"},{"value":"9783030653514","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-65351-4_39","type":"book-chapter","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T22:03:06Z","timestamp":1609797786000},"page":"485-496","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["GrowHON: A Scalable Algorithm for Growing Higher-order Networks of Sequences"],"prefix":"10.1007","author":[{"given":"Steven J.","family":"Krieg","sequence":"first","affiliation":[]},{"given":"Peter M.","family":"Kogge","sequence":"additional","affiliation":[]},{"given":"Nitesh V.","family":"Chawla","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,5]]},"reference":[{"issue":"6295","key":"39_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson, A.R., Gleich, D.F., Leskovec, J.: Higher-order organization of complex networks. Science 353(6295), 163\u2013166 (2016)","journal-title":"Science"},{"key":"39_CR2","unstructured":"Bureau of Transportation Statistics: Transtats. https:\/\/www.transtats.bts.gov\/. Accessed 30 Sep 2019"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Kumar, R., Raghavan, P., Sarlos, T.: Are web users really Markovian? In: Proceedings of the 21st International Conference on World Wide Web, pp. 609\u2013618 (2012)","DOI":"10.1145\/2187836.2187919"},{"issue":"5","key":"39_CR4","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1109\/TKDE.2018.2849727","volume":"31","author":"P Cui","year":"2018","unstructured":"Cui, P., Wang, X., Pei, J., Zhu, W.: A survey on network embedding. IEEE Trans. Knowl. Data Eng. 31(5), 833\u2013852 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3\u20135","key":"39_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"issue":"2","key":"39_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. ACM Sigmod Rec. 29(2), 1\u201312 (2000)","journal-title":"ACM Sigmod Rec."},{"key":"39_CR7","unstructured":"Healthcare Cost and Utilization Project (HCUP): Clinical classification software, March 2017. http:\/\/www.hcup-us.ahrq.gov. Accessed 8 Jan 2020"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Ioffe, S.: Improved consistent sampling, weighted minhash and l1 sketching. In: 2010 IEEE International Conference on Data Mining, pp. 246\u2013255. IEEE (2010)","DOI":"10.1109\/ICDM.2010.80"},{"issue":"4","key":"39_CR9","doi-asserted-by":"publisher","first-page":"e0151209","DOI":"10.1371\/journal.pone.0151209","volume":"11","author":"A Koher","year":"2016","unstructured":"Koher, A., Lentz, H.H., H\u00f6vel, P., Sokolov, I.M.: Infections on temporal networks-a matrix-based approach. PloS ONE 11(4), e0151209 (2016)","journal-title":"PloS ONE"},{"issue":"4","key":"39_CR10","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.: From networks to optimal higher-order models of complex systems. Nat. Phys. 15(4), 313\u2013320 (2019)","journal-title":"Nat. Phys."},{"issue":"5594","key":"39_CR11","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., et al.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"key":"39_CR12","unstructured":"Moritz, P., Nishihara, R., et\u00a0al.: Ray: A distributed framework for emerging AI applications. In: 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18), pp. 561\u2013577 (2018)"},{"key":"39_CR13","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. Technical report, Stanford InfoLab (1999)"},{"issue":"1","key":"39_CR14","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1038\/s41467-017-00148-9","volume":"8","author":"TP Peixoto","year":"2017","unstructured":"Peixoto, T.P., Rosvall, M.: Modelling sequences and temporal networks with dynamic community structures. Nat. Commun. 8(1), 582 (2017)","journal-title":"Nat. Commun."},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"Porter, M.A.: Nonlinearity+ networks: a 2020 vision. In: Emerging Frontiers in Nonlinear Science, pp. 131\u2013159. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-44992-6_6"},{"issue":"18","key":"39_CR16","doi-asserted-by":"publisher","first-page":"3508","DOI":"10.1093\/bioinformatics\/bth436","volume":"20","author":"N Pr\u017eulj","year":"2004","unstructured":"Pr\u017eulj, N., Corneil, D.G., Jurisica, I.: Modeling interactome: scale-free or geometric? Bioinformatics 20(18), 3508\u20133515 (2004)","journal-title":"Bioinformatics"},{"key":"39_CR17","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K., Koh, E.: Higher-order network representation learning. In: Companion Proceedings of the The Web Conference 2018, pp. 3\u20134. International World Wide Web Conferences Steering Committee (2018)","DOI":"10.1145\/3184558.3186900"},{"key":"39_CR18","doi-asserted-by":"publisher","first-page":"4630","DOI":"10.1038\/ncomms5630","volume":"5","author":"M Rosvall","year":"2014","unstructured":"Rosvall, M., Esquivel, A.V., Lancichinetti, A., West, J.D., Lambiotte, R.: Memory in network flows and its effects on spreading dynamics and community detection. Nat. Commun. 5, 4630 (2014)","journal-title":"Nat. Commun."},{"issue":"4","key":"39_CR19","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1089\/big.2019.0169","volume":"8","author":"M Saebi","year":"2020","unstructured":"Saebi, M., Ciampaglia, G.L., Kaplan, L.M., Chawla, N.V.: Honem: learning embedding for higher order networks. Big Data 8(4), 255\u2013269 (2020)","journal-title":"Big Data"},{"issue":"1","key":"39_CR20","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1140\/epjds\/s13688-020-00233-y","volume":"9","author":"M Saebi","year":"2020","unstructured":"Saebi, M., Xu, J., Kaplan, L.M., Ribeiro, B., Chawla, N.V.: Efficient modeling of higher-order dependencies in networks: from algorithm to application for anomaly detection. EPJ Data Sci. 9(1), 15 (2020)","journal-title":"EPJ Data Sci."},{"key":"39_CR21","doi-asserted-by":"crossref","unstructured":"Scholtes, I.: When is a network a network? In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1037\u20131046. ACM (2017)","DOI":"10.1145\/3097983.3098145"},{"key":"39_CR22","doi-asserted-by":"publisher","first-page":"5024","DOI":"10.1038\/ncomms6024","volume":"5","author":"I Scholtes","year":"2014","unstructured":"Scholtes, I., et al.: Causality-driven slow-down and speed-up of diffusion in non-Markovian temporal networks. Nat. Commun. 5, 5024 (2014)","journal-title":"Nat. Commun."},{"key":"39_CR23","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E., Pachocki, J., Mitzenmacher, M.: Scalable motif-aware graph clustering. In: Proceedings of the 26th International Conference on World Wide Web, pp. 1451\u20131460 (2017)","DOI":"10.1145\/3038912.3052653"},{"issue":"5","key":"39_CR24","doi-asserted-by":"publisher","first-page":"e1600028","DOI":"10.1126\/sciadv.1600028","volume":"2","author":"J Xu","year":"2016","unstructured":"Xu, J., Wickramarathne, T.L., Chawla, N.V.: Representing higher-order dependencies in networks. Sci. Adv. 2(5), e1600028 (2016)","journal-title":"Sci. Adv."},{"key":"39_CR25","doi-asserted-by":"crossref","unstructured":"Yin, H., Benson, A.R., Leskovec, J., Gleich, D.F.: Local higher-order graph clustering. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 555\u2013564. ACM (2017)","DOI":"10.1145\/3097983.3098069"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications IX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65351-4_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T22:45:53Z","timestamp":1609800353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65351-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030653507","9783030653514"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65351-4_39","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"value":"1860-949X","type":"print"},{"value":"1860-9503","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2020","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}