{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T15:21:30Z","timestamp":1771600890638,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T00:00:00Z","timestamp":1697846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,21]]},"DOI":"10.1145\/3583780.3614954","type":"proceedings-article","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T07:45:26Z","timestamp":1697874326000},"page":"833-842","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Liberate Pseudo Labels from Over-Dependence: Label Information Migration on Sparsely Labeled Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3002-8691","authenticated-orcid":false,"given":"Zhihui","family":"Hu","sequence":"first","affiliation":[{"name":"Hikvision Research Institute &amp; Key Laboratory of Peace-building Big Data of Zhejiang Province, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8931-3665","authenticated-orcid":false,"given":"Yao","family":"Fu","sequence":"additional","affiliation":[{"name":"Hikvision Research Institute, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5448-8775","authenticated-orcid":false,"given":"Hong","family":"Zhao","sequence":"additional","affiliation":[{"name":"Hikvision Research Institute, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0098-4700","authenticated-orcid":false,"given":"Xiaoyu","family":"Cai","sequence":"additional","affiliation":[{"name":"Hikvision Research Institute, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3482-8538","authenticated-orcid":false,"given":"Weihao","family":"Jiang","sequence":"additional","affiliation":[{"name":"Hikvision Research Institute, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5269-7821","authenticated-orcid":false,"given":"Shiliang","family":"Pu","sequence":"additional","affiliation":[{"name":"Hikvision Research Institute, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,10,21]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"A theory of learning from different domains. Machine learning","author":"Ben-David Shai","year":"2010","unstructured":"Shai Ben-David , John Blitzer , Koby Crammer , Alex Kulesza , Fernando Pereira , and Jennifer Wortman Vaughan . 2010. A theory of learning from different domains. Machine learning , Vol. 79 ( 2010 ), 151--175. Shai Ben-David, John Blitzer, Koby Crammer, Alex Kulesza, Fernando Pereira, and Jennifer Wortman Vaughan. 2010. A theory of learning from different domains. Machine learning, Vol. 79 (2010), 151--175."},{"key":"e_1_3_2_2_2_1","volume-title":"Deep gaussian embedding of graphs: Unsupervised inductive learning via ranking. arXiv preprint arXiv:1707.03815","author":"Bojchevski Aleksandar","year":"2017","unstructured":"Aleksandar Bojchevski and Stephan G\u00fcnnemann . 2017. Deep gaussian embedding of graphs: Unsupervised inductive learning via ranking. arXiv preprint arXiv:1707.03815 ( 2017 ). Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2017. Deep gaussian embedding of graphs: Unsupervised inductive learning via ranking. arXiv preprint arXiv:1707.03815 (2017)."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl242"},{"key":"e_1_3_2_2_4_1","volume-title":"Spectral networks and locally connected networks on graphs. arXiv preprint arXiv:1312.6203","author":"Bruna Joan","year":"2013","unstructured":"Joan Bruna , Wojciech Zaremba , Arthur Szlam , and Yann LeCun . 2013. Spectral networks and locally connected networks on graphs. arXiv preprint arXiv:1312.6203 ( 2013 ). Joan Bruna, Wojciech Zaremba, Arthur Szlam, and Yann LeCun. 2013. Spectral networks and locally connected networks on graphs. arXiv preprint arXiv:1312.6203 (2013)."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Mathilde Caron Piotr Bojanowski Armand Joulin and Matthijs Douze. 2018. Deep Clustering for Unsupervised Learning of Visual Features. In ECCV. 139--156. Mathilde Caron Piotr Bojanowski Armand Joulin and Matthijs Douze. 2018. Deep Clustering for Unsupervised Learning of Visual Features. In ECCV. 139--156.","DOI":"10.1007\/978-3-030-01264-9_9"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Hongxu Chen Hongzhi Yin Xiangguo Sun Tong Chen Bogdan Gabrys and Katarzyna Musial. 2020. Multi-level graph convolutional networks for cross-platform anchor link prediction. In KDD. 1503--1511. Hongxu Chen Hongzhi Yin Xiangguo Sun Tong Chen Bogdan Gabrys and Katarzyna Musial. 2020. Multi-level graph convolutional networks for cross-platform anchor link prediction. In KDD. 1503--1511.","DOI":"10.1145\/3394486.3403201"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Jiafeng Cheng Qianqian Wang Zhiqiang Tao Deyan Xie and Quanxue Gao. 2021. Multi-view attribute graph convolution networks for clustering. In IJCAI. 2973--2979. Jiafeng Cheng Qianqian Wang Zhiqiang Tao Deyan Xie and Quanxue Gao. 2021. Multi-view attribute graph convolution networks for clustering. In IJCAI. 2973--2979.","DOI":"10.24963\/ijcai.2020\/411"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467364"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Enyan Dai and Suhang Wang. 2021. Say no to the discrimination: Learning fair graph neural networks with limited sensitive attribute information. In WSDM. 680--688. Enyan Dai and Suhang Wang. 2021. Say no to the discrimination: Learning fair graph neural networks with limited sensitive attribute information. In WSDM. 680--688.","DOI":"10.1145\/3437963.3441752"},{"key":"e_1_3_2_2_10_1","unstructured":"Micha\u00ebl Defferrard Xavier Bresson and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. In NIPS. Micha\u00ebl Defferrard Xavier Bresson and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. In NIPS."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Wei Duan Junyu Xuan Maoying Qiao and Jie Lu. 2022. Learning from the Dark: Boosting Graph Convolutional Neural Networks with Diverse Negative Samples. In AAAI. Wei Duan Junyu Xuan Maoying Qiao and Jie Lu. 2022. Learning from the Dark: Boosting Graph Convolutional Neural Networks with Diverse Negative Samples. In AAAI.","DOI":"10.1609\/aaai.v36i6.20608"},{"key":"e_1_3_2_2_12_1","volume-title":"Fast graph representation learning with PyTorch Geometric. arXiv preprint arXiv:1903.02428","author":"Fey Matthias","year":"2019","unstructured":"Matthias Fey and Jan Eric Lenssen . 2019. Fast graph representation learning with PyTorch Geometric. arXiv preprint arXiv:1903.02428 ( 2019 ). Matthias Fey and Jan Eric Lenssen. 2019. Fast graph representation learning with PyTorch Geometric. arXiv preprint arXiv:1903.02428 (2019)."},{"key":"e_1_3_2_2_13_1","volume-title":"Mario Marchand, and Victor Lempitsky.","author":"Ganin Yaroslav","year":"2016","unstructured":"Yaroslav Ganin , Evgeniya Ustinova , Hana Ajakan , Pascal Germain , Hugo Larochelle , Francc ois Laviolette , Mario Marchand, and Victor Lempitsky. 2016 . Domain-adversarial training of neural networks. The journal of machine learning research, Vol. 17 , 1 (2016), 2096--2030. Yaroslav Ganin, Evgeniya Ustinova, Hana Ajakan, Pascal Germain, Hugo Larochelle, Francc ois Laviolette, Mario Marchand, and Victor Lempitsky. 2016. Domain-adversarial training of neural networks. The journal of machine learning research, Vol. 17, 1 (2016), 2096--2030."},{"key":"e_1_3_2_2_14_1","first-page":"1","article-title":"Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networks","volume":"22","author":"Hoefler Torsten","year":"2021","unstructured":"Torsten Hoefler , Dan Alistarh , Tal Ben-Nun , Nikoli Dryden , and Alexandra Peste . 2021 . Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networks . Journal of Machine Learning Research , Vol. 22 , 241 (2021), 1 -- 124 . Torsten Hoefler, Dan Alistarh, Tal Ben-Nun, Nikoli Dryden, and Alexandra Peste. 2021. Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networks. Journal of Machine Learning Research, Vol. 22, 241 (2021), 1--124.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_15_1","volume-title":"Open graph benchmark: Datasets for machine learning on graphs. Advances in neural information processing systems","author":"Hu Weihua","year":"2020","unstructured":"Weihua Hu , Matthias Fey , Marinka Zitnik , Yuxiao Dong , Hongyu Ren , Bowen Liu , Michele Catasta , and Jure Leskovec . 2020. Open graph benchmark: Datasets for machine learning on graphs. Advances in neural information processing systems , Vol. 33 ( 2020 ), 22118--22133. Weihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong, Hongyu Ren, Bowen Liu, Michele Catasta, and Jure Leskovec. 2020. Open graph benchmark: Datasets for machine learning on graphs. Advances in neural information processing systems, Vol. 33 (2020), 22118--22133."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Daniel Kifer Shai Ben-David and Johannes Gehrke. 2004. Detecting change in data streams. In VLDB. 180--191. Daniel Kifer Shai Ben-David and Johannes Gehrke. 2004. Detecting change in data streams. In VLDB. 180--191.","DOI":"10.1016\/B978-012088469-8.50019-X"},{"key":"e_1_3_2_2_17_1","volume-title":"Adam: A method for stochastic optimization. In ICLR.","author":"Kingma Diederik P","year":"2015","unstructured":"Diederik P Kingma and Jimmy Ba . 2015 . Adam: A method for stochastic optimization. In ICLR. Diederik P Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. In ICLR."},{"key":"e_1_3_2_2_18_1","unstructured":"Thomas N Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In ICLR. Thomas N Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In ICLR."},{"key":"e_1_3_2_2_19_1","unstructured":"Johannes Klicpera Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2019. Predict then propagate: Graph neural networks meet personalized pagerank. In ICLR. Johannes Klicpera Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2019. Predict then propagate: Graph neural networks meet personalized pagerank. In ICLR."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"M Leordeanu and M Hebert. 2005. A spectral technique for correspondence problems using pairwise constraints. In ICCV. 1482--1489. M Leordeanu and M Hebert. 2005. A spectral technique for correspondence problems using pairwise constraints. In ICCV. 1482--1489.","DOI":"10.1109\/ICCV.2005.20"},{"key":"e_1_3_2_2_21_1","unstructured":"Qimai Li Zhichao Han and Xiao-Ming Wu. 2018. Deeper insights into graph convolutional networks for semi-supervised learning. In AAAI. Qimai Li Zhichao Han and Xiao-Ming Wu. 2018. Deeper insights into graph convolutional networks for semi-supervised learning. In AAAI."},{"key":"e_1_3_2_2_22_1","unstructured":"Hongrui Liu Binbin Hu Xiao Wang Chuan Shi Zhiqiang Zhang and Jun Zhou. 2022. Confidence May Cheat: Self-Training on Graph Neural Networks under Distribution Shift. In WWW. 1248--1258. Hongrui Liu Binbin Hu Xiao Wang Chuan Shi Zhiqiang Zhang and Jun Zhou. 2022. Confidence May Cheat: Self-Training on Graph Neural Networks under Distribution Shift. In WWW. 1248--1258."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Paria Jamshid Lou and Mark Johnson. 2020. Improving Disfluency Detection by Self-Training a Self-Attentive Model. In ACL. Paria Jamshid Lou and Mark Johnson. 2020. Improving Disfluency Detection by Self-Training a Self-Attentive Model. In ACL.","DOI":"10.18653\/v1\/2020.acl-main.346"},{"key":"e_1_3_2_2_24_1","unstructured":"Sanket Vaibhav Mehta Jinfeng Rao Yi Tay Mihir Kale Ankur Parikh Hongtao Zhong and Emma Strubell. 2021. Improving Compositional Generalization with Self-Training for Data-to-Text Generation. In ACL. Sanket Vaibhav Mehta Jinfeng Rao Yi Tay Mihir Kale Ankur Parikh Hongtao Zhong and Emma Strubell. 2021. Improving Compositional Generalization with Self-Training for Data-to-Text Generation. In ACL."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.3390\/e10040493"},{"key":"e_1_3_2_2_26_1","volume-title":"Collective classification in network data. AI magazine","author":"Sen Prithviraj","year":"2008","unstructured":"Prithviraj Sen , Galileo Namata , Mustafa Bilgic , Lise Getoor , Brian Galligher , and Tina Eliassi-Rad . 2008. Collective classification in network data. AI magazine , Vol. 29 , 3 ( 2008 ), 93--93. Prithviraj Sen, Galileo Namata, Mustafa Bilgic, Lise Getoor, Brian Galligher, and Tina Eliassi-Rad. 2008. Collective classification in network data. AI magazine, Vol. 29, 3 (2008), 93--93."},{"key":"e_1_3_2_2_27_1","volume-title":"Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868","author":"Shchur Oleksandr","year":"2018","unstructured":"Oleksandr Shchur , Maximilian Mumme , Aleksandar Bojchevski , and Stephan G\u00fcnnemann . 2018. Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868 ( 2018 ). Oleksandr Shchur, Maximilian Mumme, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2018. Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868 (2018)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Ke Sun Zhouchen Lin and Zhanxing Zhu. 2020. Multi-Stage Self-Supervised Learning for Graph Convolutional Networks on Graphs with Few Labeled Nodes. In AAAI. 5892--5899. Ke Sun Zhouchen Lin and Zhanxing Zhu. 2020. Multi-Stage Self-Supervised Learning for Graph Convolutional Networks on Graphs with Few Labeled Nodes. In AAAI. 5892--5899.","DOI":"10.1609\/aaai.v34i04.6048"},{"key":"e_1_3_2_2_29_1","volume-title":"Dataset cartography: Mapping and diagnosing datasets with training dynamics. arXiv preprint arXiv:2009.10795","author":"Swayamdipta Swabha","year":"2020","unstructured":"Swabha Swayamdipta , Roy Schwartz , Nicholas Lourie , Yizhong Wang , Hannaneh Hajishirzi , Noah A Smith , and Yejin Choi . 2020. Dataset cartography: Mapping and diagnosing datasets with training dynamics. arXiv preprint arXiv:2009.10795 ( 2020 ). Swabha Swayamdipta, Roy Schwartz, Nicholas Lourie, Yizhong Wang, Hannaneh Hajishirzi, Noah A Smith, and Yejin Choi. 2020. Dataset cartography: Mapping and diagnosing datasets with training dynamics. arXiv preprint arXiv:2009.10795 (2020)."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Jie Tang Jing Zhang Limin Yao Juanzi Li Li Zhang and Zhong Su. 2008. ArnetMiner: extraction and mining of academic social networks. In KDD. 990--998. Jie Tang Jing Zhang Limin Yao Juanzi Li Li Zhang and Zhong Su. 2008. ArnetMiner: extraction and mining of academic social networks. In KDD. 990--998.","DOI":"10.1145\/1401890.1402008"},{"key":"e_1_3_2_2_31_1","unstructured":"Petar Velivc kovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Lio and Yoshua Bengio. 2017. Graph attention networks. In ICLR. Petar Velivc kovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Lio and Yoshua Bengio. 2017. Graph attention networks. In ICLR."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Qizhe Xie Minh-Thang Luong Eduard Hovy and Quoc V Le. 2020. Self-training with noisy student improves imagenet classification. In CVPR. 10687--10698. Qizhe Xie Minh-Thang Luong Eduard Hovy and Quoc V Le. 2020. Self-training with noisy student improves imagenet classification. In CVPR. 10687--10698.","DOI":"10.1109\/CVPR42600.2020.01070"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Liang Yang Chuan Wang Junhua Gu Xiaochun Cao and Bingxin Niu. 2021. Why Do Attributes Propagate in Graph Convolutional Neural Networks?. In AAAI. 4590--4598. Liang Yang Chuan Wang Junhua Gu Xiaochun Cao and Bingxin Niu. 2021. Why Do Attributes Propagate in Graph Convolutional Neural Networks?. In AAAI. 4590--4598.","DOI":"10.1609\/aaai.v35i5.16588"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Rex Ying Ruining He Kaifeng Chen Pong Eksombatchai William L Hamilton and Jure Leskovec. 2018. Graph convolutional neural networks for web-scale recommender systems. In KDD. 974--983. Rex Ying Ruining He Kaifeng Chen Pong Eksombatchai William L Hamilton and Jure Leskovec. 2018. Graph convolutional neural networks for web-scale recommender systems. In KDD. 974--983.","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_2_2_35_1","unstructured":"Kaichao You Mingsheng Long Zhangjie Cao Jianmin Wang and Michael I Jordan. 2019. Universal domain adaptation. In CVPR. 2720--2729. Kaichao You Mingsheng Long Zhangjie Cao Jianmin Wang and Michael I Jordan. 2019. Universal domain adaptation. In CVPR. 2720--2729."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"crossref","unstructured":"Bing Yu Haoteng Yin and Zhanxing Zhu. 2018. Spatio-temporal graph convolutional networks: a deep learning framework for traffic forecasting. In IJCAI. 3634--3640. Bing Yu Haoteng Yin and Zhanxing Zhu. 2018. Spatio-temporal graph convolutional networks: a deep learning framework for traffic forecasting. In IJCAI. 3634--3640.","DOI":"10.24963\/ijcai.2018\/505"},{"key":"e_1_3_2_2_37_1","unstructured":"Tianxiang Zhao Xianfeng Tang Xiang Zhang and Suhang Wang. 2020. Semi-Supervised Graph-to-Graph Translation. In CIKM. 1863--1872. Tianxiang Zhao Xianfeng Tang Xiang Zhang and Suhang Wang. 2020. Semi-Supervised Graph-to-Graph Translation. In CIKM. 1863--1872."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-020-01395-y"},{"key":"e_1_3_2_2_39_1","volume-title":"Effective Semi-Supervised Node Classification on Few-Labeled Graph Data. arXiv preprint arXiv:1910.02684","author":"Zhou Ziang","year":"2019","unstructured":"Ziang Zhou , Jieming Shi , Shengzhong Zhang , Zengfeng Huang , and Qing Li. 2019. Effective Semi-Supervised Node Classification on Few-Labeled Graph Data. arXiv preprint arXiv:1910.02684 ( 2019 ). Ziang Zhou, Jieming Shi, Shengzhong Zhang, Zengfeng Huang, and Qing Li. 2019. Effective Semi-Supervised Node Classification on Few-Labeled Graph Data. arXiv preprint arXiv:1910.02684 (2019)."}],"event":{"name":"CIKM '23: The 32nd ACM International Conference on Information and Knowledge Management","location":"Birmingham United Kingdom","acronym":"CIKM '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 32nd ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3614954","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583780.3614954","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:44Z","timestamp":1750178204000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3614954"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,21]]},"references-count":39,"alternative-id":["10.1145\/3583780.3614954","10.1145\/3583780"],"URL":"https:\/\/doi.org\/10.1145\/3583780.3614954","relation":{},"subject":[],"published":{"date-parts":[[2023,10,21]]},"assertion":[{"value":"2023-10-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}