{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T16:59:21Z","timestamp":1780765161115,"version":"3.54.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"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":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s11390-023-2583-5","type":"journal-article","created":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:20:06Z","timestamp":1737004806000},"page":"1223-1237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Inductive Lottery Ticket Learning for Graph Neural Networks"],"prefix":"10.1007","volume":"39","author":[{"given":"Yong-Duo","family":"Sui","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianlong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiang-Nan","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tat-Seng","family":"Chua","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,1,16]]},"reference":[{"key":"2583_CR1","volume-title":"Proc. the 5th International Conference on Learning Representations","author":"T N Kipf","year":"2017","unstructured":"Kipf T N, Welling M. Semi-supervised classification with graph convolutional networks. In Proc. the 5th International Conference on Learning Representations, Apr. 2017."},{"key":"2583_CR2","volume-title":"Proc. the 6th International Conference on Learning Representations","author":"P Veli\u010dkovi\u0107","year":"2018","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Li\u00f2 P, Bengio Y. Graph attention networks. In Proc. the 6th International Conference on Learning Representations, Apr. 2018."},{"key":"2583_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.aiopen.2021.01.001","volume":"1","author":"J Zhou","year":"2020","unstructured":"Zhou J, Cui G, Zhang Z, Yang C, Liu Z, Wang L, Li C, Sun M. Graph neural networks: A review of methods and applications. AI Open, 2020, 1: 57\u201381. DOI: https:\/\/doi.org\/10.1016\/j.aiopen.2021.01.001.","journal-title":"AI Open"},{"key":"2583_CR4","unstructured":"Li G, Xiong C, Thabet A, Ghanem B. DeeperGCN: All you need to train deeper GCNs. arXiv: 2006.07739, 2020. https:\/\/arxiv.org\/abs\/2006.07739, Nov. 2024."},{"issue":"6","key":"2583_CR5","doi-asserted-by":"publisher","first-page":"6923","DOI":"10.1109\/TPAMI.2021.3074057","volume":"45","author":"G Li","year":"2023","unstructured":"Li G, M\u00fcller M, Qian G, Delgadillo I C, Abualshour A, Thabet A, Ghanem B. DeepGCNs: Making GCNs go as deep as CNNs. IEEE Trans. Pattern Analysis and Machine Intelligence, 2023, 45(6): 6923\u20136939. DOI: https:\/\/doi.org\/10.1109\/TPAMI.2021.3074057.","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"2583_CR6","first-page":"22118","volume-title":"Proc. the 34th International Conference on Neural Information Processing Systems","author":"W Hu","year":"2020","unstructured":"Hu W, Fey M, Zitnik M, Dong Y, Ren H, Liu B, Catasta M, Leskovec J. Open graph benchmark: Datasets for machine learning on graphs. In Proc. the 34th International Conference on Neural Information Processing Systems, Dec. 2020, pp.22118\u201322133."},{"key":"2583_CR7","first-page":"1695","volume-title":"Proc. the 38th International Conference on Machine Learning","author":"T Chen","year":"2021","unstructured":"Chen T, Sui Y, Chen X, Zhang A, Wang Z. A unified lottery ticket hypothesis for graph neural networks. In Proc. the 38th International Conference on Machine Learning, Jul. 2021, pp.1695\u20131706."},{"key":"2583_CR8","volume-title":"Proc. the 7th International Conference on Learning Representations","author":"J Frankle","year":"2019","unstructured":"Frankle J, Carbin M. The lottery ticket hypothesis: Finding sparse, trainable neural networks. In Proc. the 7th International Conference on Learning Representations, May 2019."},{"key":"2583_CR9","volume-title":"Proc. the 7th International Conference on Learning Representations","author":"K Xu","year":"2019","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S. How powerful are graph neural networks? In Proc. the 7th International Conference on Learning Representations, May 2019."},{"key":"2583_CR10","first-page":"4805","volume-title":"Proc. the 31st International Conference on Neural Information Processing Systems","author":"Z Ying","year":"2018","unstructured":"Ying Z, You J, Morris C, Ren X, Hamilton W L, Leskovec J. Hierarchical graph representation learning with differentiable pooling. In Proc. the 31st International Conference on Neural Information Processing Systems, Dec. 2018, pp.4805\u20134815."},{"key":"2583_CR11","first-page":"16306","volume-title":"Proc. the 2021 IEEE\/CVF Conference on Computer Vision and Pattern Recognition","author":"T Chen","year":"2021","unstructured":"Chen T, Frankle J, Chang S, Liu S, Zhang Y, Carbin M. The lottery tickets hypothesis for supervised and self-supervised pre-training in computer vision models. In Proc. the 2021 IEEE\/CVF Conference on Computer Vision and Pattern Recognition, Jun. 2021, pp.16306\u201316316."},{"key":"2583_CR12","unstructured":"Jaiswal A K, Ma H, Chen T, Ding Y, Wang Z. Spending your winning lottery better after drawing it. arXiv: 2101. 03255, 2021. https:\/\/arxiv.org\/abs\/2101.03255, Nov. 2024."},{"key":"2583_CR13","volume-title":"Proc. the 7th International Conference on Learning Representations","author":"Z Liu","year":"2019","unstructured":"Liu Z, Sun M, Zhou T, Huang G, Darrell T. Rethinking the value of network pruning. In Proc. the 7th International Conference on Learning Representations, May 2019."},{"key":"2583_CR14","volume-title":"Proc. the 8th International Conference on Learning Representations","author":"C Wang","year":"2020","unstructured":"Wang C, Zhang G, Grosse R B. Picking winning tickets before training by preserving gradient flow. In Proc. the 8th International Conference on Learning Representations, Apr. 2020."},{"key":"2583_CR15","first-page":"11380","volume-title":"Proc. the 34th International Conference on Neural Information Processing Systems","author":"P Savarese","year":"2020","unstructured":"Savarese P, Silva H, Maire M. Winning the lottery with continuous sparsification. In Proc. the 34th International Conference on Neural Information Processing Systems, Dec. 2020, pp.11380\u201311390."},{"key":"2583_CR16","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/ASONAM.2016.7752223","volume-title":"Proc. the 2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining","author":"E Voudigari","year":"2016","unstructured":"Voudigari E, Salamanos N, Papageorgiou T, Yannakoudakis E J. Rank degree: An efficient algorithm for graph sampling. In Proc. the 2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, Aug. 2016, pp.120\u2013129. DOI: https:\/\/doi.org\/10.1109\/ASONAM.2016.7752223."},{"key":"2583_CR17","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1145\/1150402.1150479","volume-title":"Proc. the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"J Leskovec","year":"2006","unstructured":"Leskovec J, Faloutsos C. Sampling from large graphs. In Proc. the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Aug. 2006, pp.631\u2013636, DOI: https:\/\/doi.org\/10.1145\/1150402.1150479."},{"key":"2583_CR18","volume-title":"Proc. the 8th International Conference on Learning Representations","author":"H Zeng","year":"2020","unstructured":"Zeng H, Zhou H, Srivastava A, Kannan R, Prasanna V K. GraphSAINT: Graph sampling based inductive learning method. In Proc. the 8th International Conference on Learning Representations, Apr. 2020."},{"key":"2583_CR19","first-page":"1972","volume-title":"Proc. the 36th International Conference on Machine Learning","author":"L Franceschi","year":"2019","unstructured":"Franceschi L, Niepert M, Pontil M, He X. Learning discrete structures for graph neural networks. In Proc. the 36th International Conference on Machine Learning, Jun. 2019, pp.1972\u20131982."},{"key":"2583_CR20","volume-title":"Proc. the 33rd International Conference on Neural Information Processing Systems","author":"R Ying","year":"2019","unstructured":"Ying R, Bourgeois D, You J, Zitnik M, Leskovec J. GN-NExplainer: Generating explanations for graph neural networks. In Proc. the 33rd International Conference on Neural Information Processing Systems, Dec. 2019, Article No. 829."},{"issue":"1","key":"2583_CR21","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1109\/TKDE.2021.3072345","volume":"35","author":"Y Ye","year":"2023","unstructured":"Ye Y, Ji S. Sparse graph attention networks. IEEE Trans. Knowledge and Data Engineering, 2023, 35(1): 905\u2013916. DOI: https:\/\/doi.org\/10.1109\/TKDE.2021.3072345.","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"2583_CR22","first-page":"11458","volume-title":"Proc. the 37th International Conference on Machine Learning","author":"C Zheng","year":"2020","unstructured":"Zheng C, Zong B, Cheng W, Song D, Ni J, Yu W, Chen H, Wang W. Robust graph representation learning via neural sparsification. In Proc. the 37th International Conference on Machine Learning, Jul. 2020, pp.11458\u201311468."},{"key":"2583_CR23","volume-title":"Proc. the 8th International Conference on Learning Representations","author":"Y Rong","year":"2020","unstructured":"Rong Y, Huang W, Xu T, Huang J. DropEdge: Towards deep graph convolutional networks on node classification. In Proc. the 8th International Conference on Learning Representations, Apr. 2020."},{"key":"2583_CR24","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-030-47426-3_22","volume-title":"Proc. the 24th Pacific-Asia Conference on Knowledge Discovery and Data Mining","author":"J Li","year":"2020","unstructured":"Li J, Zhang T, Tian H, Jin S, Fardad M, Zafarani R. SGCN: A graph sparsifier based on graph convolutional networks. In Proc. the 24th Pacific-Asia Conference on Knowledge Discovery and Data Mining, May 2020, pp.275\u2013287. DOI: https:\/\/doi.org\/10.1007\/978-3-030-47426-3_22."},{"key":"2583_CR25","volume-title":"Proc. the 6th International Conference on Learning Repp resentations","author":"J Chen","year":"2018","unstructured":"Chen J, Ma T, Xiao C. FastGCN: Fast learning with graph convolutional networks via importance sampling. In Proc. the 6th International Conference on Learning Repp resentations, Apr. 30\u2013May 3, 2018."},{"key":"2583_CR26","first-page":"1025","volume-title":"Proc. the 31st International Conference on Neural Information Processing Systems","author":"W L Hamilton","year":"2017","unstructured":"Hamilton W L, Ying Z, Leskovec J. Inductive representation learning on large graphs. In Proc. the 31st International Conference on Neural Information Processing Systems, Dec. 2017, pp.1025\u20131035."},{"key":"2583_CR27","doi-asserted-by":"publisher","first-page":"8910","DOI":"10.1609\/aaai.v36i8.20873","volume-title":"Proc. the 36th the AAAI Conference on Artificial Intelligence","author":"H You","year":"2022","unstructured":"You H, Lu Z, Zhou Z, Fu Y, Lin Y. Early-bird GCNs: Graph-network co-optimization towards more efficient GCN training and inference via drawing early-bird lottery tickets. In Proc. the 36th the AAAI Conference on Artificial Intelligence, Feb. 22\u2013Mar. 1, 2022, pp.8910\u20138918. DOI: https:\/\/doi.org\/10.1609\/aaai.v36i8.20873."},{"key":"2583_CR28","unstructured":"Chen T, Bian S, Sun Y. Are powerful graph neural nets necessary? A dissection on graph classification. arXiv: 1905.04579, 2020. https:\/\/arxiv.org\/abs\/1905.04579, Nov. 2024."},{"key":"2583_CR29","unstructured":"Dwivedi V P, Joshi C K, Luu A T, Laurent T, Bengio Y, Bresson X. Benchmarking graph neural networks. The Journal of Machine Learning Research, 2023, 24(1): Article No. 43."},{"key":"2583_CR30","unstructured":"Morris C, Kriege N M, Bause F, Kersting K, Mutzel P, Neumann M. TUDataset: A collection of benchmark datasets for learning with graphs. arXiv: 2007.08663, 2020. https:\/\/arxiv.org\/abs\/2007.08663, Nov. 2024."},{"issue":"11","key":"2583_CR31","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1109\/TPAMI.2012.120","volume":"34","author":"R Achanta","year":"2012","unstructured":"Achanta R, Shaji A, Smith K, Lucchi A, Fua P, S\u00fcsstrunk S. SLIC superpixels compared to state-of-the-art superpixel methods. IEEE Trans. Pattern Analysis and Machine Intelligence, 2012, 34(11): 2274\u20132282. DOI: https:\/\/doi.org\/10.1109\/TPAMI.2012.120.","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"2583_CR32","first-page":"4204","volume-title":"Proc. the 32nd International Conference on Neural Information Processing Systems","author":"B Knyazev","year":"2019","unstructured":"Knyazev B, Taylor G W, Amer M R. Understanding attention and generalization in graph neural networks. In Proc. the 32nd International Conference on Neural Information Processing Systems, Dec. 2019, pp.4204\u20134214."},{"key":"2583_CR33","volume-title":"Proc. the 34th International Conference on Neural Information Processing Systems","author":"Y You","year":"2020","unstructured":"You Y, Chen T, Sui Y, Chen T, Wang Z, Shen Y. Graph contrastive learning with augmentations. In Proc. the 34th International Conference on Neural Information Processing Systems, Dec. 2020, Article No. 488."},{"key":"2583_CR34","volume-title":"Proc. the 100th International Conference on Learning Representations","author":"Y Wu","year":"2022","unstructured":"Wu Y, Wang X, Zhang A, He X, Chua T S. Discovering invariant rationales for graph neural networks. In Proc. the 100th International Conference on Learning Representations, Apr. 2022."},{"key":"2583_CR35","doi-asserted-by":"publisher","first-page":"1696","DOI":"10.1145\/3534678.3539366","volume-title":"Proc. the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","author":"Y Sui","year":"2022","unstructured":"Sui Y, Wang X, Wu J, Lin M, He X, Chua T S. Causal attention for interpretable and generalizable graph classification. In Proc. the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Aug. 2022, pp.1696\u20131705. DOI: https:\/\/doi.org\/10.1145\/3534678.3539366."},{"key":"2583_CR36","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1145\/3534678.3539347","volume-title":"Proc. the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","author":"G Liu","year":"2022","unstructured":"Liu G, Zhao T, Xu J, Luo T, Jiang M. Graph rationalization with environment-based augmentations. In Proc. the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Aug. 2022, pp.1069\u20131078. DOI: https:\/\/doi.org\/10.1145\/3534678.3539347."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-023-2583-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11390-023-2583-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-023-2583-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:20:19Z","timestamp":1737004819000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11390-023-2583-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":36,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["2583"],"URL":"https:\/\/doi.org\/10.1007\/s11390-023-2583-5","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11]]},"assertion":[{"value":"28 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Conflict of Interest The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics"}}]}}