{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T06:46:03Z","timestamp":1771915563619,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":34,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819500055","type":"print"},{"value":"9789819500062","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-95-0006-2_38","type":"book-chapter","created":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T07:35:20Z","timestamp":1753342520000},"page":"449-460","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SimMix: Enhancing Label Consistency in Graph Mixup for Improved Graph Classification"],"prefix":"10.1007","author":[{"given":"Xingkai","family":"Yao","sequence":"first","affiliation":[]},{"given":"Zhongqiu","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Zongxing","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Xiaofang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,25]]},"reference":[{"key":"38_CR1","unstructured":"Ying, Z., You, J., Morris, C., Ren, X., Hamilton, W.L., Leskovec, J.: Hierarchical graph representation learning with differentiable pooling. In: NeurIPS, pp. 4805\u20134815 (2018)"},{"key":"38_CR2","unstructured":"Gilmer, J., Schoenholz, S.S., Riley, P.F., Vinyals, O., Dahl, G.E.: Neural message passing for quantum chemistry. In: ICML, pp. 1263\u20131272. PMLR (2017)"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Simonovsky, M., Komodakis, N.: Dynamic edge-conditioned filters in convolutional neural networks on graphs. In: CVPR, pp. 29\u201338. IEEE Computer Society (2017)","DOI":"10.1109\/CVPR.2017.11"},{"key":"38_CR4","unstructured":"Errica, F., Podda, M., Bacciu, D., Micheli, A.: A fair comparison of graph neural networks for graph classification. In: ICLR. OpenReview.net (2020)"},{"key":"38_CR5","unstructured":"Meng, L., Zhang, J.: IsoNN: isomorphic neural network for graph representation learning and classification. CoRR. abs\/1907.09495 (2019)"},{"key":"38_CR6","unstructured":"Zhang, H., Ciss\u00e9, M., Dauphin, Y.N., Lopez-Paz, D.: mixup: beyond empirical risk minimization. In: 6th International Conference on Learning Representations, ICLR 2018, Vancouver, BC, Canada, April 30 - May 3, 2018, Conference Track Proceedings. OpenReview.net (2018)"},{"key":"38_CR7","doi-asserted-by":"publisher","unstructured":"Guo, H., Mao, Y.: Interpolating graph pair to regularize graph classification. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, pp. 7766\u20137774 (2023)https:\/\/doi.org\/10.1609\/aaai.v37i6.25941","DOI":"10.1609\/aaai.v37i6.25941"},{"key":"38_CR8","unstructured":"Ling, H., Jiang, Z., Liu, M., Ji, S., Zou, N.: Graph mixup with soft alignments. In: Proceedings of the 40th International Conference on Machine Learning, pp. 21335\u201321349. PMLR (2023)"},{"key":"38_CR9","unstructured":"Khosla, P., et al.: Supervised contrastive learning. In: NeurIPS (2020)"},{"key":"38_CR10","unstructured":"Rong, Y., Huang, W., Xu, T., Huang, J.: DropEdge: towards deep graph convolutional networks on node classification. In: ICLR. OpenReview.net (2020)"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Chen, D., Lin, Y., Li, W., Li, P., Zhou, J., Sun, X.: Measuring and relieving the over-smoothing problem for graph neural networks from the topological view. In: AAAI, pp. 3438\u20133445. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i04.5747"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Zhao, T., Liu, Y., Neves, L., Woodford, O.J., Jiang, M., Shah, N.: Data augmentation for graph neural networks. In: AAAI, pp. 11015\u201311023. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i12.17315"},{"key":"38_CR13","unstructured":"You, Y., Chen, T., Sui, Y., Chen, T., Wang, Z., Shen, Y.: Graph contrastive learning with augmentations. In: NeurIPS (2020)"},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"Zhou, J., Shen, J., Xuan, Q.: Data augmentation for graph classification. In: CIKM, pp. 2341\u20132344. ACM (2020)","DOI":"10.1145\/3340531.3412086"},{"key":"38_CR15","unstructured":"You, Y., Chen, T., Shen, Y., Wang, Z.: Graph contrastive learning automated. In: ICML, pp. 12121\u201312132. PMLR (2021)"},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"Sun, J., Wang, B., Wu, B.: Automated graph representation learning for node classification. In: IJCNN, pp. 1\u20137. IEEE (2021)","DOI":"10.1109\/IJCNN52387.2021.9533811"},{"key":"38_CR17","unstructured":"Luo, Y., et al.: Automated data augmentations for graph classification. In: ICLR. OpenReview.net (2023)"},{"key":"38_CR18","unstructured":"Ling, H., Jiang, Z., Luo, Y., Ji, S., Zou, N.: learning fair graph representations via automated data augmentations. In: ICLR. OpenReview.net (2023)"},{"key":"38_CR19","unstructured":"Suresh, S., Li, P., Hao, C., Neville, J.: Adversarial graph augmentation to improve graph contrastive learning. In: NeurIPS, pp. 15920\u201315933 (2021)"},{"key":"38_CR20","doi-asserted-by":"crossref","unstructured":"Jin, W., Ma, Y., Liu, X., Tang, X., Wang, S., Tang, J.: Graph structure learning for robust graph neural networks. In: KDD, pp. 66\u201374. ACM (2020)","DOI":"10.1145\/3394486.3403049"},{"key":"38_CR21","doi-asserted-by":"crossref","unstructured":"Yun, S., Han, D., Chun, S., Oh, S.J., Yoo, Y., Choe, J.: CutMix: regularization strategy to train strong classifiers with localizable features. In: ICCV, pp. 6022\u20136031. IEEE (2019)","DOI":"10.1109\/ICCV.2019.00612"},{"key":"38_CR22","unstructured":"Guo, H., Mao, Y., Zhang, R.: Augmenting data with mixup for sentence classification: an empirical study. CoRR. abs\/1905.08941 (2019)"},{"key":"38_CR23","doi-asserted-by":"crossref","unstructured":"Medennikov, I., et al.: An investigation of mixup training strategies for acoustic models in ASR. In: INTERSPEECH, pp. 2903\u20132907. ISCA (2018)","DOI":"10.21437\/Interspeech.2018-2191"},{"key":"38_CR24","doi-asserted-by":"crossref","unstructured":"Qin, H., Jin, X., Zhu, H., Liao, H., El-Yacoubi, M.A., Gao, X.: SUMix: mixup with semantic and uncertain information. arXiv preprint arXiv:2407.07805 (2024)","DOI":"10.1007\/978-3-031-73021-4_5"},{"key":"38_CR25","unstructured":"Uddin, A.F.M.S., Monira, M.S., Shin, W., Chung, T., Bae, S.-H.: SaliencyMix: a saliency guided data augmentation strategy for better regularization. In: ICLR. OpenReview.net (2021)"},{"key":"38_CR26","unstructured":"Qin, J., Fang, J., Zhang, Q., Liu, W., Wang, X., Wang, X.: ResizeMix: mixing data with preserved object information and true labels. CoRR. abs\/2012.11101 (2020)"},{"key":"38_CR27","unstructured":"Verma, V., et al.: Manifold mixup: better representations by interpolating hidden states. In: ICML, pp. 6438\u20136447. PMLR (2019)"},{"key":"38_CR28","doi-asserted-by":"publisher","unstructured":"Wang, Y., Wang, W., Liang, Y., Cai, Y., Hooi, B.: Mixup for node and graph classification. In: Proceedings of the Web Conference 2021, pp. 3663\u20133674. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3442381.3449796","DOI":"10.1145\/3442381.3449796"},{"key":"38_CR29","doi-asserted-by":"crossref","unstructured":"Park, J., Shim, H., Yang, E.: Graph transplant: node saliency-guided graph mixup with local structure preservation. In: AAAI, pp. 7966\u20137974. AAAI Press (2022)","DOI":"10.1609\/aaai.v36i7.20767"},{"key":"38_CR30","doi-asserted-by":"crossref","unstructured":"Yoo, J., Shim, S., Kang, U.: Model-agnostic augmentation for accurate graph classification. In: WWW, pp. 1281\u20131291. ACM (2022)","DOI":"10.1145\/3485447.3512175"},{"key":"38_CR31","unstructured":"Han, X., Jiang, Z., Liu, N., Hu, X.: G-Mixup: graph data augmentation for graph classification. In: Proceedings of the 39th International Conference on Machine Learning, pp. 8230\u20138248. PMLR (2022)"},{"key":"38_CR32","unstructured":"Morris, C., Kriege, N.M., Bause, F., Kersting, K., Mutzel, P., Neumann, M.: TUDataset: a collection of benchmark datasets for learning with graphs. In: ICML 2020 Workshop on Graph Representation Learning and Beyond (GRL+ 2020) (2020)"},{"key":"38_CR33","unstructured":"Hu, W., et al.: Open graph benchmark: datasets for machine learning on graphs. In: NeurIPS (2020)"},{"key":"38_CR34","unstructured":"Feng, W., et al.: Graph random neural networks for semi-supervised learning on graphs. In: NeurIPS (2020)"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Technology and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0006-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T02:58:52Z","timestamp":1771901932000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0006-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819500055","9789819500062"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0006-2_38","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":"25 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare no competing interests relevant to this work.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ningbo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"26 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/icg\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}