{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:05:16Z","timestamp":1750219516837,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819681723","type":"print"},{"value":"9789819681730","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-8173-0_17","type":"book-chapter","created":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T11:41:15Z","timestamp":1750160475000},"page":"211-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Representing Higher-Order Networks with\u00a0Spectral Moments"],"prefix":"10.1007","author":[{"given":"Hao","family":"Tian","sequence":"first","affiliation":[]},{"given":"Shengmin","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Reza","family":"Zafarani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,18]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Benson, A.R., Abebe, R., Schaub, M.T., Jadbabaie, A., Kleinberg, J.M.: Simplicial closure and higher-order link prediction. CoRR abs\/1802.06916 (2018)","DOI":"10.1073\/pnas.1800683115"},{"key":"17_CR2","unstructured":"Benson, A.R., Gleich, D.F., Leskovec, J.: Higher-order organization of complex networks. CoRR abs\/1612.08447 (2016)"},{"key":"17_CR3","unstructured":"Borgwardt, K., Kriegel, H.: Shortest-path kernels on graphs. In: Fifth IEEE International Conference on Data Mining (ICDM 2005), pp. 8 (2005)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: XGBoost: a scalable tree boosting system. In: KDD, pp. 785\u2013794. KDD 2016, ACM, New York, NY, USA (2016)","DOI":"10.1145\/2939672.2939785"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Chung, F.: The laplacian of a hypergraph. In: Expanding Graphs, pp. 21\u201336 (1993)","DOI":"10.1090\/dimacs\/010\/03"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Do, M.T., Yoon, S., Hooi, B., Shin, K.: Structural patterns and generative models of real-world hypergraphs, pp. 176\u2013186. KDD 2020, Association for Computing Machinery, New York, NY, USA (2020)","DOI":"10.1145\/3394486.3403060"},{"key":"17_CR7","unstructured":"Jin, S.: Interpretable network representations (2022)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Jin, S., Ma, R., Li, J., Eftekharnejad, S., Zafarani, R.: A spectral measure for network robustness: assessment, design, and evolution. In: 2022 IEEE International Conference on Knowledge Graph (ICKG), pp. 97\u2013104. IEEE (2022)","DOI":"10.1109\/ICKG55886.2022.00020"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Jin, S., Tian, H., Li, J., Zafarani, R.: A spectral representation of networks: the path of subgraphs, pp. 698\u2013708. KDD 2022 (2022)","DOI":"10.1145\/3534678.3539433"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Jin, S., Zafarani, R.: The spectral zoo of networks: embedding and visualizing networks with spectral moments, pp. 1426\u20131434. KDD 2020 (2020)","DOI":"10.1145\/3394486.3403195"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-019-0195-3","volume":"5","author":"NM Kriege","year":"2019","unstructured":"Kriege, N.M., Johansson, F.D., Morris, C.: A survey on graph kernels. Appl. Netw. Sci. 5(1), 1\u201342 (2019). https:\/\/doi.org\/10.1007\/s41109-019-0195-3","journal-title":"Appl. Netw. Sci."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media (2010)","DOI":"10.1145\/1753326.1753532"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Lu, L., Peng, X.: High-ordered random walks and generalized laplacians on hypergraphs (2011)","DOI":"10.1007\/978-3-642-21286-4_2"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824\u2013827 (2002)","DOI":"10.1126\/science.298.5594.824"},{"key":"17_CR15","unstructured":"Narayanan, A., Chandramohan, M., Venkatesan, R., Chen, L., Liu, Y., Jaiswal, S.: graph2vec: learning distributed representations of graphs. CoRR (2017)"},{"key":"17_CR16","unstructured":"Niepert, M., Ahmed, M., Kutzkov, K.: Learning convolutional neural networks for graphs, vol.\u00a048, pp. 2014\u20132023. PMLR, New York, USA (2016)"},{"key":"17_CR17","unstructured":"Pineau, E.: Using laplacian spectrum as graph feature representation. CoRR (2019)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K., Koh, E.: Higher-order network representation learning, pp. 3\u20134. WWW 2018 (2018)","DOI":"10.1145\/3184558.3186900"},{"issue":"77","key":"17_CR19","first-page":"2539","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze, N., Schweitzer, P., van Leeuwen, E.J., Mehlhorn, K., Borgwardt, K.M.: Weisfeiler-Lehman graph kernels. J. Mach. Learn. Res. 12(77), 2539\u20132561 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"17_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3682112.3682114","volume":"26","author":"H Tian","year":"2024","unstructured":"Tian, H., Zafarani, R.: Higher-order networks representation and learning: a survey. SIGKDD Explor. Newsl. 26(1), 1\u201318 (2024)","journal-title":"SIGKDD Explor. Newsl."},{"key":"17_CR21","unstructured":"Zhang, Z., Wang, M., Xiang, Y., Huang, Y., Nehorai, A.: RetGK: graph kernels based on return probabilities of random walks (2018)"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Zhou, D., Huang, J., Sch\u00f6lkopf, B.: Learning with hypergraphs: clustering, classification, and embedding. In: Sch\u00f6lkopf, B., Platt, J., Hoffman, T. (eds.) Advances in Neural Information Processing Systems, vol.\u00a019. MIT Press (2006)","DOI":"10.7551\/mitpress\/7503.003.0205"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-8173-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T11:41:25Z","timestamp":1750160485000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-8173-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819681723","9789819681730"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-8173-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}