{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:18:11Z","timestamp":1757618291740,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819681792"},{"type":"electronic","value":"9789819681808"}],"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-8180-8_30","type":"book-chapter","created":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T09:16:21Z","timestamp":1750324581000},"page":"383-394","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Hypergraph Neural Network with Motif Interaction Enhancement"],"prefix":"10.1007","author":[{"given":"Jun","family":"Long","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shijia","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zidong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tingxuan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,20]]},"reference":[{"issue":"6","key":"30_CR1","doi-asserted-by":"publisher","first-page":"2476","DOI":"10.1109\/TKDE.2023.3322129","volume":"36","author":"Y Zhu","year":"2024","unstructured":"Zhu, Y., Tong, L., Li, G., Luo, X., Zhou, K.: FocusedCleaner: sanitizing poisoned graphs for robust GNN-based node classification. IEEE Trans. Knowl. Data Eng. 36(6), 2476\u20132489 (2024)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.neunet.2023.10.050","volume":"169","author":"L Song","year":"2024","unstructured":"Song, L., Li, H., Tan, Y., Li, Z., Shang, X.: Enhancing enterprise credit risk assessment with cascaded multi-level graph representation learning. Neural Netw. 169, 475\u2013484 (2024)","journal-title":"Neural Netw."},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Yu, J., Yin, H., Li, J., Wang, Q., Hung, N.Q.V., Zhang, X.: Self-supervised multi-channel hypergraph convolutional network for social recommendation. In: WWW 2021: The Web Conference 2021, pp. 413\u2013424 (2021)","DOI":"10.1145\/3442381.3449844"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Feng, Y., You, H., Zhang, Z., Ji, R., Gao, Y.: Hypergraph neural networks. In: The Thirty-Third AAAI Conference on Artificial Intelligence, pp. 3558\u20133565 (2019)","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Du, C., Yao, K., Zhu, H., Wang, D., Zhuang, F., Xiong, H.: Seq-HGNN: learning sequential node representation on heterogeneous graph. In: Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 1721\u20131730 (2023)","DOI":"10.1145\/3539618.3591765"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Wang, D., Zhang, Z., Zhao, Y., Huang, K., Kang, Y., Zhou, J.: Financial default prediction via motif-preserving graph neural network with curriculum learning. In: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2233\u20132242 (2023)","DOI":"10.1145\/3580305.3599351"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Zhou, D., Huang, J., Sch\u00f6lkopf, B.: Learning with hypergraphs: clustering, classification, and embedding. In: Advances in Neural Information Processing Systems, vol. 19, pp. 1601\u20131608. MIT Press (2006)","DOI":"10.7551\/mitpress\/7503.003.0205"},{"key":"30_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107637","volume":"110","author":"S Bai","year":"2021","unstructured":"Bai, S., Zhang, F., Torr, P.: Hypergraph convolution and hypergraph attention. Pattern Recognit. 110, 107637 (2021)","journal-title":"Pattern Recognit."},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Jiang, J., Wei, Y., Feng, Y., Cao, J., Gao, Y.: Dynamic hypergraph neural networks. In: Proceedings of IJCAI, Macao, China, pp. 2635\u20132641 (2019)","DOI":"10.24963\/ijcai.2019\/366"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"He, L., Chen, H., Wang, D., Jameel, S., Yu, P.S., Xu, G.: Click-through rate prediction with multi-modal hypergraphs. In: Proceedings of CIKM, Queensland, Australia, pp. 690\u2013699 (2021)","DOI":"10.1145\/3459637.3482327"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Yang, T., et al.: Co-clustering interactions via attentive hypergraph neural network. In: Proceedings of SIGIR, Madrid, Spain, pp. 859\u2013869 (2022)","DOI":"10.1145\/3477495.3531868"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ins.2022.10.006","volume":"616","author":"X Kang","year":"2022","unstructured":"Kang, X., et al.: Dynamic hypergraph neural networks based on key hyperedges. Inf. Sci. 616, 37\u201351 (2022)","journal-title":"Inf. Sci."},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Lin, H., Gao, Y.: Dynamic hypergraph structure learning. In: Proceedings of IJCAI, Stockholm, Sweden, pp. 3162\u20133169 (2018)","DOI":"10.24963\/ijcai.2018\/439"},{"issue":"3","key":"30_CR14","doi-asserted-by":"publisher","first-page":"3181","DOI":"10.1109\/TPAMI.2022.3182052","volume":"45","author":"Y Gao","year":"2023","unstructured":"Gao, Y., Feng, Y., Ji, S., Ji, R.: HGNN+: general hypergraph neural networks. IEEE Trans. Pattern Anal. Mach. Intell. 45(3), 3181\u20133199 (2023)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Lee, J.B., Rossi, R.A., Kong, X., Kim, S., Koh, E., Rao, A.: Graph convolutional networks with motif-based attention. In: Proceedings of CIKM, Beijing, China, pp. 499\u2013508 (2019)","DOI":"10.1145\/3357384.3357880"},{"key":"30_CR16","unstructured":"Chen, X., Cai, R., Fang, Y., Wu, M., Li, Z., Hao, Z.: Motif graph neural network. CoRR, vol. abs\/2112.14900 (2021)"},{"key":"30_CR17","unstructured":"Biswas, A.S., Eden, T., Rubinfeld, R.: Towards a decomposition-optimal algorithm for counting and sampling arbitrary motifs in sublinear time. In: Proceedings of APPROX\/RANDOM, Seattle, WA, pp. 55:1\u201355:19 (2021)"},{"issue":"11","key":"30_CR18","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.14778\/3342263.3342640","volume":"12","author":"M Bressan","year":"2019","unstructured":"Bressan, M., Leucci, S., Panconesi, A.: Motivo: fast motif counting via succinct color coding and adaptive sampling. Proc. VLDB Endow. 12(11), 1651\u20131663 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Jin, Y., Song, G., Shi, C.: Gralsp: graph neural networks with local structural patterns. In: Proceedings of AAAI, New York, NY, pp. 4361\u20134368 (2020)","DOI":"10.1609\/aaai.v34i04.5861"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Liu, Z., Huang, C., Yu, Y., Dong, J.: Motif-preserving dynamic attributed network embedding. In: Proceedings of WWW, Ljubljana, Slovenia, pp. 1629\u20131638 (2021)","DOI":"10.1145\/3442381.3449821"},{"key":"30_CR21","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1011597","volume":"19","author":"J Shuting","year":"2023","unstructured":"Shuting, J., et al.: A general hypergraph learning algorithm for drug multi-task predictions. PLoS Comput. Biol. 19, e1011597 (2023)","journal-title":"PLoS Comput. Biol."},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: Proceedings of KDD, New York, NY, USA, pp. 701\u2013710 (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"30_CR23","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: Proceedings of ICLR, Toulon, France (2017)"},{"key":"30_CR24","unstructured":"Hamilton, W.L., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: Proceedings of NeurIPS, Long Beach, CA, pp. 1024\u20131034 (2017)"},{"key":"30_CR25","unstructured":"Velickovic, P., Cucurull, G., Casanova, A., Romero, A., Li\u00f2, P., Bengio, Y.: Graph attention networks. In: Proceedings of ICLR, Vancouver, BC, Canada (2018)"},{"key":"30_CR26","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? In: Proceedings of ICLR, New Orleans, LA, USA (2019)"},{"issue":"7","key":"30_CR27","first-page":"3496","volume":"44","author":"FM Bianchi","year":"2021","unstructured":"Bianchi, F.M., Grattarola, D., Livi, L., et al.: Graph neural networks with convolutional ARMA filters. IEEE Trans. Pattern Anal. Mach. Intell. 44(7), 3496\u20133507 (2021)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"30_CR28","doi-asserted-by":"crossref","unstructured":"Lee, J.B., Rossi, R.A., Kong, X., Kim, S., Koh, E., Rao, A.: Graph convolutional networks with motif-based attention. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, pp. 499\u2013508. ACM (2019)","DOI":"10.1145\/3357384.3357880"},{"key":"30_CR29","doi-asserted-by":"crossref","unstructured":"Morris, C., et al.: Weisfeiler and leman go neural: higher-order graph neural networks. In: Proceedings of AAAI, Honolulu, HI, USA, pp. 4602\u20134609 (2019)","DOI":"10.1609\/aaai.v33i01.33014602"},{"issue":"3","key":"30_CR30","first-page":"93","volume":"29","author":"P Sen","year":"2008","unstructured":"Sen, P., Namata, G., Bilgic, M., Getoor, L., Gallagher, B., Eliassi-Rad, T.: Collective classification in network data. AI Mag. 29(3), 93\u2013106 (2008)","journal-title":"AI Mag."}],"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-8180-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T20:29:40Z","timestamp":1757190580000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-8180-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819681792","9789819681808"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-8180-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 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"}}]}}