{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,5]],"date-time":"2026-09-05T16:44:11Z","timestamp":1788626651264,"version":"build-2803163510"},"publisher-location":"Singapore","reference-count":37,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819722525","type":"print"},{"value":"9789819722532","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-2253-2_30","type":"book-chapter","created":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T06:02:11Z","timestamp":1713938531000},"page":"376-389","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["DEGNN: Dual Experts Graph Neural Network Handling both\u00a0Edge and\u00a0Node Feature Noise"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4089-0186","authenticated-orcid":false,"given":"Tai","family":"Hasegawa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5186-6563","authenticated-orcid":false,"given":"Sukwon","family":"Yun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2336-7409","authenticated-orcid":false,"given":"Xin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1178-8238","authenticated-orcid":false,"given":"Yin Jun","family":"Phua","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3818-7830","authenticated-orcid":false,"given":"Tsuyoshi","family":"Murata","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,25]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Zhou, J., et al.: Graph neural networks: a review of methods and applications. AI Open 1, 57\u201381 (2020)","DOI":"10.1016\/j.aiopen.2021.01.001"},{"issue":"1","key":"30_CR2","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1146\/annurev.soc.27.1.415","volume":"27","author":"M McPherson","year":"2001","unstructured":"McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of a feather: homophily in social networks. Ann. Rev. Sociol. 27(1), 415\u2013444 (2001)","journal-title":"Ann. Rev. Sociol."},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Maurya, S.K., Liu, X., Murata T.: Graph neural networks for fast node ranking approximation. In: TKDD (2021)","DOI":"10.1145\/3446217"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Zhang, M., et al.: An end-to-end deep learning architecture for graph classification. In: AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"30_CR5","unstructured":"Chung, F.R.K.: Spectral Graph Theory. number 92. American Mathematical Soc (1997)"},{"key":"30_CR6","unstructured":"Defferrard, M., Bresson, X., Vandergheynst, P.: Convolutional neural networks on graphs with fast localized spectral filtering. In: NeurIPS (2016)"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Maurya, S.K., Liu, X., Murata, T.: Fast approximations of betweenness centrality with graph neural networks. In: CIKM (2019)","DOI":"10.1145\/3357384.3358080"},{"issue":"1","key":"30_CR8","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1146\/annurev.so.16.080190.002251","volume":"16","author":"PV Marsden","year":"1990","unstructured":"Marsden, P.V.: Network data and measurement. Ann. Rev. Sociol. 16(1), 435\u2013463 (1990)","journal-title":"Ann. Rev. Sociol."},{"key":"30_CR9","unstructured":"Dai, H., et al.: Adversarial attack on graph structured data. In: ICML (2018)"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Jin, W., et al.: Adversarial attacks and defenses on graphs. In: SIGKDD (2021)","DOI":"10.1145\/3447556.3447566"},{"key":"30_CR11","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: ICLR (2017)"},{"key":"30_CR12","unstructured":"Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: NeurIPS (2017)"},{"key":"30_CR13","volume-title":"Arantxa Casanova","author":"P Veli\u010dkovi\u0107","year":"2018","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G.: Arantxa Casanova. Pietro Lio, and Yoshua Bengio. Graph attention networks. In ICLR, Adriana Romero (2018)"},{"key":"30_CR14","unstructured":"Franceschi, L., Niepert, M., Pontil, M., He, X.: Learning discrete structures for graph neural networks. In: ICML (2019)"},{"issue":"1","key":"30_CR15","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2020","unstructured":"Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., Philip, S.Y.: A comprehensive survey on graph neural networks. IEEE Trans. Neural Netw. Learn. Syst. 32(1), 4\u201324 (2020)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"9903","DOI":"10.1109\/ACCESS.2021.3050607","volume":"9","author":"R Jin","year":"2021","unstructured":"Jin, R., Xia, T., Liu, X., Murata, T.: Predicting emergency medical service demand with bipartite graph convolutional networks. IEEE Access 9, 9903\u20139915 (2021)","journal-title":"IEEE Access"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Fan, W., et al.: Graph neural networks for social recommendation. In: WWW, pp. 417\u2013426 (2019)","DOI":"10.1145\/3308558.3313488"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Jin, W., et al.: Graph structure learning for robust graph neural networks. In: SIGKDD (2020)","DOI":"10.1145\/3394486.3403049"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Zhao, T., et al.: Data augmentation for graph neural networks. In: AAAI (2021)","DOI":"10.1609\/aaai.v35i12.17315"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Li, K., et al.: Reliable representations make a stronger defender: unsupervised structure refinement for robust GNN. In: SIGKDD (2022)","DOI":"10.1145\/3534678.3539484"},{"key":"30_CR21","unstructured":"Berthelot, D., et al.: MixMatch: a holistic approach to semi-supervised learning. In: NeurIPS (2019)"},{"key":"30_CR22","unstructured":"Zhu, Y., Xu, Y., Yu, F., Liu, Q., Wu, S., Wang, L.: Deep graph contrastive representation learning. In: ICML (2020)"},{"key":"30_CR23","unstructured":"You, Y., Chen, T., Sui, Y., Chen, T., Wang, Z., Shen, Y.: Graph contrastive learning with augmentations. In: NeurIPS (2020)"},{"key":"30_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2022.101695","volume":"62","author":"SK Maurya","year":"2022","unstructured":"Maurya, S.K., Liu, X., Murata, T.: Simplifying approach to node classification in graph neural networks. J. Comput. Sci. 62, 101695 (2022)","journal-title":"J. Comput. Sci."},{"key":"30_CR25","unstructured":"Zhu, J., Yan, Y., Zhao, L., Heimann, M., Akoglu, L., Koutra, D.: Beyond homophily in graph neural networks: current limitations and effective designs. In: NeurIPS (2020)"},{"key":"30_CR26","doi-asserted-by":"crossref","unstructured":"Marcheggiani, D., Titov, I.: Encoding sentences with graph convolutional networks for semantic role labeling. In: EMNLP, pp. 1506\u20131515 (2017)","DOI":"10.18653\/v1\/D17-1159"},{"issue":"21","key":"30_CR27","doi-asserted-by":"publisher","first-page":"6001","DOI":"10.3390\/s20216001","volume":"20","author":"Z Rakhimberdina","year":"2020","unstructured":"Rakhimberdina, Z., Liu, X., Murata, T.: Population graph-based multi-model ensemble method for diagnosing autism spectrum disorder. Sensors 20(21), 6001 (2020)","journal-title":"Sensors"},{"key":"30_CR28","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.future.2022.09.018","volume":"139","author":"Y Djenouri","year":"2023","unstructured":"Djenouri, Y., Belhadi, A., Srivastava, G., Lin, J.C.: Hybrid graph convolution neural network and branch-and-bound optimization for traffic flow forecasting. Futur. Gener. Comput. Syst. 139, 100\u2013108 (2023)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"30_CR29","doi-asserted-by":"crossref","unstructured":"Choong, J.J., Liu, X., Murata, T.: Learning community structure with variational autoencoder. In: ICDM, pp. 69\u201378 (2018)","DOI":"10.1109\/ICDM.2018.00022"},{"key":"30_CR30","unstructured":"Pei, H., Wei, B., Kevin, C.-C.C., Yu, L., Yang, B.: Geom-GCN: Geometric graph convolutional networks. In: ICLR (2020)"},{"key":"30_CR31","unstructured":"Suresh, S., Li, P., Hao, C., Neville, J.: Adversarial graph augmentation to improve graph contrastive learning. In: NeurIPS (2021)"},{"issue":"6","key":"30_CR32","first-page":"5879","volume":"35","author":"Y Liu","year":"2022","unstructured":"Liu, Y., et al.: Graph self-supervised learning: a survey. IEEE Trans. Knowl. Data Eng. 35(6), 5879\u20135900 (2022)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"30_CR33","unstructured":"Shchur, O., Mumme, M., Bojchevski, A., G\u00fcnnemann, S.: Pitfalls of graph neural network evaluation. In: NeurIPS Workshop (2018)"},{"key":"30_CR34","doi-asserted-by":"crossref","unstructured":"Zhu, D., Zhang, Z., Cui, P., Zhu, W.: Robust graph convolutional networks against adversarial attacks. In: SIGKDD (2019)","DOI":"10.1145\/3292500.3330851"},{"key":"30_CR35","unstructured":"Runwal, B., Kumar, S.: Robust graph neural networks using weighted graph Laplacian (2022). arXiv preprint arXiv:2208.01853"},{"key":"30_CR36","unstructured":"Wu, T., Ren, H., Li, P., Leskovec, J.: Graph information bottleneck. In: NeurIPS (2020)"},{"key":"30_CR37","unstructured":"Zhang, M., Chen, Y.: Link prediction based on graph neural networks. In: NeurIPS (2018)"}],"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-97-2253-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T19:15:19Z","timestamp":1713986119000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-2253-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819722525","9789819722532"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-2253-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 April 2024","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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}