{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T01:11:32Z","timestamp":1771549892173,"version":"3.50.1"},"reference-count":55,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T00:00:00Z","timestamp":1707782400000},"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":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2024,5,31]]},"abstract":"<jats:p>Graph machine learning (Graph ML) models typically require abundant labeled instances to provide sufficient supervision signals, which is commonly infeasible in real-world scenarios since labeled data for newly emerged concepts (e.g., new categorizations of nodes) on graphs is rather limited. To efficiently learn with a small amount of data on graphs, meta-learning has been investigated in Graph ML. By transferring the knowledge learned from previous experiences to new tasks, graph meta-learning approaches have demonstrated promising performance on few-shot graph learning problems. However, most existing efforts predominately assume that all the data from the seen classes is gold labeled, yet those methods may lose their efficacy when the seen data is weakly labeled with severe label noise. As such, we aim to investigate a novel problem of weakly supervised graph meta-learning for improving the model robustness in terms of knowledge transfer. To achieve this goal, we propose Meta-GIN (Meta Graph Interpolation Network), a new graph meta-learning framework. Based on a new robustness-enhanced episodic training paradigm, Meta-GIN is meta-learned to interpolate node representations from weakly labeled data and extracts highly transferable meta-knowledge, which enables the model to quickly adapt to unseen tasks with few labeled instances. Extensive experiments demonstrate the superiority of Meta-GIN over existing graph meta-learning studies on the task of weakly supervised few-shot node classification.<\/jats:p>","DOI":"10.1145\/3630260","type":"journal-article","created":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T11:36:48Z","timestamp":1699616208000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Robust Graph Meta-Learning for Weakly Supervised Few-Shot Node Classification"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6684-6752","authenticated-orcid":false,"given":"Kaize","family":"Ding","sequence":"first","affiliation":[{"name":"Northwestern University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9916-0976","authenticated-orcid":false,"given":"Jianling","family":"Wang","sequence":"additional","affiliation":[{"name":"Texas A&amp;M University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1878-817X","authenticated-orcid":false,"given":"Jundong","family":"Li","sequence":"additional","affiliation":[{"name":"University of Virginia, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8350-8528","authenticated-orcid":false,"given":"James","family":"Caverlee","sequence":"additional","affiliation":[{"name":"Texas A&amp;M University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3264-7904","authenticated-orcid":false,"given":"Huan","family":"Liu","sequence":"additional","affiliation":[{"name":"Arizona State University, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,2,13]]},"reference":[{"key":"e_1_3_2_2_2","article-title":"Learning to extrapolate knowledge: Transductive few-shot out-of-graph link prediction","author":"Baek Jinheon","year":"2020","unstructured":"Jinheon Baek, Dong Bok Lee, and Sung Ju Hwang. 2020. Learning to extrapolate knowledge: Transductive few-shot out-of-graph link prediction. In Proceedings ofNeurIPS.","journal-title":"NeurIPS."},{"key":"e_1_3_2_3_2","unstructured":"Jatin Chauhan Deepak Nathani and Manohar Kaul. 2019. Few-shot learning on graphs via super-classes based on graph spectral measures. In Proceedings of ICLR."},{"key":"e_1_3_2_4_2","volume-title":"Proceedings of ICML","author":"Chen Pengfei","year":"2019","unstructured":"Pengfei Chen, Ben Ben Liao, Guangyong Chen, and Shengyu Zhang. 2019. Understanding and utilizing deep neural networks trained with noisy labels. In Proceedings of ICML."},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975673.67"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411922"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3575637.3575646"},{"key":"e_1_3_2_8_2","doi-asserted-by":"crossref","unstructured":"Hande Dong Jiawei Chen Fuli Feng Xiangnan He Shuxian Bi Zhaolin Ding and Peng Cui. 2021. On the equivalence of decoupled graph convolution network and label propagation. In Proceedings of WWW.","DOI":"10.1145\/3442381.3449927"},{"key":"e_1_3_2_9_2","volume-title":"Proceedings of ICML","author":"Finn Chelsea","year":"2017","unstructured":"Chelsea Finn, Pieter Abbeel, and Sergey Levine. 2017. Model-agnostic meta-learning for fast adaptation of deep networks. In Proceedings of ICML."},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401055"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_12_2","volume-title":"Proceedings of NeurIPS","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Proceedings of NeurIPS."},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401222"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_3_2_15_2","volume-title":"Proceedings of NeurIPS","author":"Hendrycks Dan","year":"2018","unstructured":"Dan Hendrycks, Mantas Mazeika, Duncan Wilson, and Kevin Gimpel. 2018. Using trusted data to train deep networks on labels corrupted by severe noise. In Proceedings of NeurIPS."},{"key":"e_1_3_2_16_2","volume-title":"Proceedings of NeurIPS","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. In Proceedings of NeurIPS."},{"key":"e_1_3_2_17_2","volume-title":"Proceedings of NeurIPS","author":"Huang Kexin","year":"2020","unstructured":"Kexin Huang and Marinka Zitnik. 2020. Graph meta learning via local subgraphs. In Proceedings of NeurIPS."},{"key":"e_1_3_2_18_2","volume-title":"Proceedings of ICML","author":"Jiang Lu","year":"2018","unstructured":"Lu Jiang, Zhengyuan Zhou, Thomas Leung, Li-Jia Li, and Li Fei-Fei. 2018. MentorNet: Learning data-driven curriculum for very deep neural networks on corrupted labels. In Proceedings of ICML."},{"key":"e_1_3_2_19_2","volume-title":"Proceedings of NeurIPS","author":"Kipf Thomas N.","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In Proceedings of NeurIPS."},{"key":"e_1_3_2_20_2","volume-title":"Proceedings of NeurIPS","author":"Lan Lin","year":"2020","unstructured":"Lin Lan, Pinghui Wang, Xuefeng Du, Kaikai Song, Jing Tao, and Xiaohong Guan. 2020. Node classification on graphs with few-shot novel labels via meta transformed network embedding. In Proceedings of NeurIPS."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331283"},{"key":"e_1_3_2_22_2","article-title":"Meta-SGD: Learning to learn quickly for few-shot learning","author":"Li Zhenguo","year":"2017","unstructured":"Zhenguo Li, Fengwei Zhou, Fei Chen, and Hang Li. 2017. Meta-SGD: Learning to learn quickly for few-shot learning. arXiv preprint arXiv:1707.09835 (2017).","journal-title":"arXiv preprint arXiv:1707.09835"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462895"},{"key":"e_1_3_2_24_2","volume-title":"Proceedings of NeurIPS","author":"Liu Lu","year":"2019","unstructured":"Lu Liu, Tianyi Zhou, Guodong Long, Jing Jiang, and Chengqi Zhang. 2019. Learning to propagate for graph meta-learning. In Proceedings of NeurIPS."},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531978"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16551"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411910"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411951"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783381"},{"key":"e_1_3_2_30_2","volume-title":"Proceedings of ICLR","author":"Mishra Nikhil","year":"2018","unstructured":"Nikhil Mishra, Mostafa Rohaninejad, Xi Chen, and Pieter Abbeel. 2018. A simple neural attentive meta-learner. In Proceedings of ICLR."},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462879"},{"key":"e_1_3_2_32_2","article-title":"Exploring context and content links in social media: A latent space method","author":"Qi Guo-Jun","year":"2012","unstructured":"Guo-Jun Qi, Charu Aggarwal, Qi Tian, Heng Ji, and Thomas Huang. 2012. Exploring context and content links in social media: A latent space method. IEEE Transactions on Pattern Analysis and Machine Intelligence 34, 5 (2012), 850\u2013862.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"e_1_3_2_33_2","volume-title":"Proceedings of ICLR","author":"Ravi Sachin","year":"2017","unstructured":"Sachin Ravi and Hugo Larochelle. 2017. Optimization as a model for few-shot learning. In Proceedings of ICLR."},{"key":"e_1_3_2_34_2","volume-title":"Proceedings of ICLR","author":"Ren Mengye","year":"2018","unstructured":"Mengye Ren, Eleni Triantafillou, Sachin Ravi, Jake Snell, Kevin Swersky, Joshua B. Tenenbaum, Hugo Larochelle, and Richard S. Zemel. 2018. Meta-learning for semi-supervised few-shot classification. In Proceedings of ICLR."},{"key":"e_1_3_2_35_2","volume-title":"Proceedings of ICML","author":"Ren Mengye","year":"2018","unstructured":"Mengye Ren, Wenyuan Zeng, Bin Yang, and Raquel Urtasun. 2018. Learning to reweight examples for robust deep learning. In Proceedings of ICML."},{"key":"e_1_3_2_36_2","volume-title":"Proceedings of ICML","author":"Santoro Adam","year":"2016","unstructured":"Adam Santoro, Sergey Bartunov, Matthew Botvinick, Daan Wierstra, and Timothy Lillicrap. 2016. Meta-learning with memory-augmented neural networks. In Proceedings of ICML."},{"key":"e_1_3_2_37_2","volume-title":"Proceedings of NeurIPS","author":"Snell Jake","year":"2017","unstructured":"Jake Snell, Kevin Swersky, and Richard Zemel. 2017. Prototypical networks for few-shot learning. In Proceedings of NeurIPS."},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00131"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1402008"},{"key":"e_1_3_2_40_2","volume-title":"Proceedings of ICLR","author":"Veli\u010dkovi\u0107 Petar","year":"2018","unstructured":"Petar Veli\u010dkovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2018. Graph attention networks. In Proceedings of ICLR."},{"key":"e_1_3_2_41_2","volume-title":"Proceedings of NeurIPS","author":"Vinyals Oriol","year":"2016","unstructured":"Oriol Vinyals, Charles Blundell, Timothy Lillicrap, Koray Kavukcuoglu, and Daan Wierstra. 2016. Matching networks for one shot learning. In Proceedings of NeurIPS."},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401133"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411923"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2754499"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539265"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462915"},{"key":"e_1_3_2_47_2","article-title":"Simplifying graph convolutional networks","author":"Wu Felix","year":"2019","unstructured":"Felix Wu, Tianyi Zhang, Amauri Holanda de Souza Jr., Christopher Fifty, Tao Yu, and Kilian Q. Weinberger. 2019. Simplifying graph convolutional networks. In Proceedings of ICML.","journal-title":"Proceedings of ICML."},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6142"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5698"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00177"},{"key":"e_1_3_2_51_2","article-title":"KNN classification with one-step computation","author":"Zhang Shichao","year":"2023","unstructured":"Shichao Zhang and Jiaye Li. 2023. KNN classification with one-step computation. IEEE Transactions on Knowledge and Data Engineering 35, 3 (2023), 2711\u20132723.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_52_2","article-title":"Reachable distance function for KNN classification","author":"Zhang Shichao","year":"2023","unstructured":"Shichao Zhang, Jiaye Li, and Yangding Li. 2023. Reachable distance function for KNN classification. IEEE Transaction on Knowledge and Data Engineering 35 (2023), 7382\u20137396.","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"e_1_3_2_53_2","volume-title":"Proceedings of ASONAM","author":"Zhang Tiantian","year":"2012","unstructured":"Tiantian Zhang and Bin Wu. 2012. A method for local community detection by finding core nodes. In Proceedings of ASONAM."},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00755"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358106"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01234-2_46"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3630260","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3630260","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:45:53Z","timestamp":1750178753000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3630260"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,13]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,5,31]]}},"alternative-id":["10.1145\/3630260"],"URL":"https:\/\/doi.org\/10.1145\/3630260","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,13]]},"assertion":[{"value":"2023-04-23","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-09-26","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}