{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:30:45Z","timestamp":1772119845061,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031001222","type":"print"},{"value":"9783031001239","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-00123-9_54","type":"book-chapter","created":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T21:14:54Z","timestamp":1651007694000},"page":"682-697","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Learning Robust Representation Through Graph Adversarial Contrastive Learning"],"prefix":"10.1007","author":[{"given":"Jiayan","family":"Guo","sequence":"first","affiliation":[]},{"given":"Shangyang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yue","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,8]]},"reference":[{"key":"54_CR1","unstructured":"Bojchevski, A., G\u00fcnnemann, S.: Adversarial attacks on node embeddings via graph poisoning. In: Proceedings of the 36th International Conference on Machine Learning, pp. 695\u2013704. PMLR, 09\u201315 June 2019"},{"key":"54_CR2","unstructured":"Chen, J., Wu, Y., Lin, X., Xuan, Q.: Can adversarial network attack be defended? CoRR abs\/1903.05994 (2019)"},{"key":"54_CR3","unstructured":"Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: Proceedings of the 37th International Conference on Machine Learning, pp. 1597\u20131607 (2020)"},{"key":"54_CR4","unstructured":"Cheng, P., Hao, W., Dai, S., Liu, J., Gan, Z., Carin, L.: Club: a contrastive log-ratio upper bound of mutual information. In: ICML 2020: 37th International Conference on Machine Learning, vol. 1, pp. 1779\u20131788 (2020)"},{"key":"54_CR5","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.1109\/TKDE.2019.2957786","volume":"6","author":"F Feng","year":"2021","unstructured":"Feng, F., He, X., Tang, J., Chua, T.S.: Graph adversarial training: dynamically regularizing based on graph structure. IEEE Trans. Knowl. Data Eng. 6, 2493\u20132504 (2021)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"54_CR6","unstructured":"Hassani, K., Khasahmadi, A.H.: Contrastive multi-view representation learning on graphs. In: Proceedings of the 37th International Conference on Machine Learning, pp. 4116\u20134126. Proceedings of Machine Learning Research (2020)"},{"key":"54_CR7","doi-asserted-by":"crossref","unstructured":"He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum contrast for unsupervised visual representation learning. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 9729\u20139738 (CVPR), June 2020","DOI":"10.1109\/CVPR42600.2020.00975"},{"key":"54_CR8","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: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 66\u201374 (2020)","DOI":"10.1145\/3394486.3403049"},{"key":"54_CR9","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)"},{"key":"54_CR10","unstructured":"Klicpera, J., Wei\u00df enberger, S., G\u00fcnnemann, S.: Diffusion improves graph learning. Adv. Neural Inf. Process. Syst. 32 (2019)"},{"key":"54_CR11","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701\u2013710. KDD 2014 (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"54_CR12","doi-asserted-by":"crossref","unstructured":"Qiu, J., et al.: GCC: Graph contrastive coding for graph neural network pre-training. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1150\u20131160 (2020)","DOI":"10.1145\/3394486.3403168"},{"key":"54_CR13","doi-asserted-by":"crossref","unstructured":"Tang, X., Li, Y., Sun, Y., Yao, H., Mitra, P., Wang, S.: Transferring robustness for graph neural network against poisoning attacks. In: Proceedings of the 13th International Conference on Web Search and Data Mining, pp. 600\u2013608 (2020)","DOI":"10.1145\/3336191.3371851"},{"key":"54_CR14","unstructured":"Tishby, N., Pereira, F.C.N., Bialek, W.: The information bottleneck method. In: Proceedings 37th Annual Allerton Conference on Communications, Control and Computing, 1999, pp. 368\u2013377 (2000)"},{"key":"54_CR15","doi-asserted-by":"crossref","unstructured":"Tishby, N., Zaslavsky, N.: Deep learning and the information bottleneck principle. In: 2015 IEEE Information Theory Workshop (ITW), pp. 1\u20135 (2015)","DOI":"10.1109\/ITW.2015.7133169"},{"key":"54_CR16","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)"},{"key":"54_CR17","unstructured":"Veli\u010dkovi\u0107, P., Fedus, W., Hamilton, W.L., Li\u00f2, P., Bengio, Y., Hjelm, R.D.: Deep graph infomax. arXiv preprint arXiv:1809.10341 (2018)"},{"key":"54_CR18","unstructured":"Wang, S., et al.: Adversarial defense framework for graph neural network (2019)"},{"key":"54_CR19","unstructured":"Wang, X., Liu, X., Hsieh, C.: Graphdefense: Towards robust graph convolutional networks. CoRR abs\/1911.04429 (2019)"},{"key":"54_CR20","doi-asserted-by":"crossref","unstructured":"Wu, H., Wang, C., Tyshetskiy, Y., Docherty, A., Lu, K., Zhu, L.: Adversarial examples for graph data: deep insights into attack and defense. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI-19, pp. 4816\u20134823 (2019)","DOI":"10.24963\/ijcai.2019\/669"},{"key":"54_CR21","unstructured":"Wu, T., Ren, H., Li, P., Leskovec, J.: Graph information bottleneck. arXiv preprint arXiv:2010.12811 (2020)"},{"key":"54_CR22","doi-asserted-by":"crossref","unstructured":"Xu, K., et al.: Topology attack and defense for graph neural networks: an optimization perspective. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI-19, pp. 3961\u20133967 (2019)","DOI":"10.24963\/ijcai.2019\/550"},{"key":"54_CR23","unstructured":"You, Y., Chen, T., Sui, Y., Chen, T., Wang, Z., Shen, Y.: Graph contrastive learning with augmentations. Adv. Neural Inf. Process. Syst. 33, 5812\u20135823 (2020)"},{"key":"54_CR24","doi-asserted-by":"crossref","unstructured":"Zhu, D., Zhang, Z., Cui, P., Zhu, W.: Robust graph convolutional networks against adversarial attacks. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. ACM (2019)","DOI":"10.1145\/3292500.3330851"},{"key":"54_CR25","unstructured":"Zhu, Y., Xu, Y., Yu, F., Liu, Q., Wu, S., Wang, L.: Deep graph contrastive representation learning. arXiv preprint arXiv:2006.04131 (2020)"},{"key":"54_CR26","doi-asserted-by":"crossref","unstructured":"Z\u00fcgner, D., Akbarnejad, A., G\u00fcnnemann, S.: Adversarial attacks on neural networks for graph data. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2847\u20132856 (2018)","DOI":"10.1145\/3219819.3220078"},{"key":"54_CR27","doi-asserted-by":"crossref","unstructured":"Z\u00fcgner, D., Borchert, O., Akbarnejad, A., G\u00fcnnemann, S.: Adversarial attacks on graph neural networks: Perturbations and their patterns. ACM Trans. Knowl. Discov, Data 14(5), 1\u201331 (2020)","DOI":"10.1145\/3394520"},{"key":"54_CR28","doi-asserted-by":"crossref","unstructured":"Z\u00fcgner, D., G\u00fcnnemann, S.: Adversarial attacks on graph neural networks via meta learning. In: International Conference on Learning Representations (ICLR) (2019)","DOI":"10.24963\/ijcai.2019\/872"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-00123-9_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T21:21:05Z","timestamp":1651008065000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-00123-9_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031001222","9783031001239"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-00123-9_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"8 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dasfaa2022.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"543","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conference was originally planned to take place in Hyberabad, India. 24 other papers are included in the volume.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}