{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T04:39:26Z","timestamp":1776400766396,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":100,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"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":[[2021,6,9]]},"DOI":"10.1145\/3448016.3457289","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:39Z","timestamp":1624036959000},"page":"2142-2155","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["A Learned Sketch for Subgraph Counting"],"prefix":"10.1145","author":[{"given":"Kangfei","family":"Zhao","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[{"name":"Chinese University of Hong Kong, Hong Kong, China"}]},{"given":"Hao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Chinese University of Hong Kong, Hong Kong, Hong Kong"}]},{"given":"Qiyan","family":"Li","sequence":"additional","affiliation":[{"name":"Wuhan University, Wuhan, China"}]},{"given":"Yu","family":"Rong","sequence":"additional","affiliation":[{"name":"Tencent AI Lab, Shenzhen, China"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"https:\/\/github.com\/yspark-dblab\/gcare.  https:\/\/github.com\/yspark-dblab\/gcare."},{"key":"e_1_3_2_2_2_1","unstructured":"https:\/\/github.com\/RapidsAtHKUST\/SubgraphMatching.  https:\/\/github.com\/RapidsAtHKUST\/SubgraphMatching."},{"key":"e_1_3_2_2_3_1","unstructured":"Pytorch. https:\/\/github.com\/pytorch\/pytorch.  Pytorch. https:\/\/github.com\/pytorch\/pytorch."},{"key":"e_1_3_2_2_4_1","unstructured":"Pytorch Geometric. https:\/\/github.com\/rusty1s\/pytorch_geometric.  Pytorch Geometric. https:\/\/github.com\/rusty1s\/pytorch_geometric."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3129246"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2016.7495625"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1201\/b17320"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.141"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0965-5"},{"key":"e_1_3_2_2_10_1","volume-title":"Proc. VLDB, 11(6)","author":"Ammar K.","year":"2018","unstructured":"K. Ammar , F. McSherry , S. Salihoglu , and M. Joglekar . Distributed evaluation of subgraph queries using worst-case optimal low-memory dataflows . Proc. VLDB, 11(6) , 2018 . K. Ammar, F. McSherry, S. Salihoglu, and M. Joglekar. Distributed evaluation of subgraph queries using worst-case optimal low-memory dataflows. Proc. VLDB, 11(6), 2018."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-19212-9_2"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.43"},{"key":"e_1_3_2_2_13_1","unstructured":"P. W. Battaglia J. B. Hamrick V. Bapst A. Sanchez-Gonzalez V. F. Zambaldi M. Malinowski A. Tacchetti D. Raposo A. Santoro R. Faulkner cC. G\u00fc lcc ehre H. F. Song A. J. Ballard J. Gilmer G. E. Dahl A. Vaswani K. R. Allen C. Nash V. Langston C. Dyer N. Heess D. Wierstra P. Kohli M. Botvinick O. Vinyals Y. Li and R. Pascanu. Relational inductive biases deep learning and graph networks. CoRR abs\/1806.01261 2018.  P. W. Battaglia J. B. Hamrick V. Bapst A. Sanchez-Gonzalez V. F. Zambaldi M. Malinowski A. Tacchetti D. Raposo A. Santoro R. Faulkner cC. G\u00fc lcc ehre H. F. Song A. J. Ballard J. Gilmer G. E. Dahl A. Vaswani K. R. Allen C. Nash V. Langston C. Dyer N. Heess D. Wierstra P. Kohli M. Botvinick O. Vinyals Y. Li and R. Pascanu. Relational inductive biases deep learning and graph networks. CoRR abs\/1806.01261 2018."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300086"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"key":"e_1_3_2_2_16_1","volume-title":"Graph homomorphisms and universal algebra course notes","author":"Bodirsky M.","year":"2015","unstructured":"M. Bodirsky . Graph homomorphisms and universal algebra course notes . 2015 . M. Bodirsky. Graph homomorphisms and universal algebra course notes. 2015."},{"key":"e_1_3_2_2_17_1","volume-title":"A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinform., 14(S-7):S13","author":"Bonnici V.","year":"2013","unstructured":"V. Bonnici , R. Giugno , A. Pulvirenti , D. E. Shasha , and A. Ferro . A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinform., 14(S-7):S13 , 2013 . V. Bonnici, R. Giugno, A. Pulvirenti, D. E. Shasha, and A. Ferro. A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinform., 14(S-7):S13, 2013."},{"key":"e_1_3_2_2_18_1","volume-title":"Protein function prediction via graph kernels. Bioinformatics, 21(suppl_1):i47--i56","author":"Borgwardt K. M.","year":"2005","unstructured":"K. M. Borgwardt , C. S. Ong , S. Sch\u00f6nauer , S. Vishwanathan , A. J. Smola , and H.-P. Kriegel . Protein function prediction via graph kernels. Bioinformatics, 21(suppl_1):i47--i56 , 2005 . K. M. Borgwardt, C. S. Ong, S. Sch\u00f6nauer, S. Vishwanathan, A. J. Smola, and H.-P. Kriegel. Protein function prediction via graph kernels. Bioinformatics, 21(suppl_1):i47--i56, 2005."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018732"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342640"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319894"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.104"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0018"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/3329772.3329780"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902309"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_2_28_1","first-page":"1024","volume-title":"Proc. NeurIPS'17","author":"Hamilton W. L.","year":"2017","unstructured":"W. L. Hamilton , Z. Ying , and J. Leskovec . Inductive representation learning on large graphs . In Proc. NeurIPS'17 , pages 1024 -- 1034 , 2017 . W. L. Hamilton, Z. Ying, and J. Leskovec. Inductive representation learning on large graphs. In Proc. NeurIPS'17, pages 1024--1034, 2017."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319880"},{"key":"e_1_3_2_2_30_1","first-page":"1","volume-title":"Foundations and Trends in Machine Learning","author":"Hanneke S.","year":"2013","unstructured":"S. Hanneke . A statistical theory of active learning . Foundations and Trends in Machine Learning , pages 1 -- 212 , 2013 . S. Hanneke. A statistical theory of active learning. Foundations and Trends in Machine Learning, pages 1--212, 2013."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383049"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389741"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376660"},{"issue":"7","key":"e_1_3_2_2_34_1","first-page":"992","article-title":"Deepdb: Learn from data, not from queries! Proc","volume":"13","author":"Hilprecht B.","year":"2020","unstructured":"B. Hilprecht , A. Schmidt , M. Kulessa , A. Molina , K. Kersting , and C. Binnig . Deepdb: Learn from data, not from queries! Proc . VLDB , 13 ( 7 ): 992 -- 1005 , 2020 . B. Hilprecht, A. Schmidt, M. Kulessa, A. Molina, K. Kersting, and C. Binnig. Deepdb: Learn from data, not from queries! Proc. VLDB, 13(7):992--1005, 2020.","journal-title":"VLDB"},{"key":"e_1_3_2_2_35_1","volume-title":"Combinatorial algorithm for counting small induced graphs and orbits. CoRR, abs\/1601.06834","author":"Hocevar T.","year":"2016","unstructured":"T. Hocevar and J. Demsar . Combinatorial algorithm for counting small induced graphs and orbits. CoRR, abs\/1601.06834 , 2016 . T. Hocevar and J. Demsar. Combinatorial algorithm for counting small induced graphs and orbits. CoRR, abs\/1601.06834, 2016."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(91)90009-T"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(89)90020-8"},{"key":"e_1_3_2_2_38_1","volume-title":"A generalization of sampling without replacement from a finite universe. Journal of the American statistical Association, 47(260):663--685","author":"Horvitz D. G.","year":"1952","unstructured":"D. G. Horvitz and D. J. Thompson . A generalization of sampling without replacement from a finite universe. Journal of the American statistical Association, 47(260):663--685 , 1952 . D. G. Horvitz and D. J. Thompson. A generalization of sampling without replacement from a finite universe. Journal of the American statistical Association, 47(260):663--685, 1952."},{"key":"e_1_3_2_2_39_1","first-page":"559","volume-title":"Advances in Computer and Computational Sciences","author":"S. Jain","year":"2017","unstructured":"S. Jain et al. Impact of memory space optimization technique on fast network motif search algorithm . In Advances in Computer and Computational Sciences , pages 559 -- 567 . Springer , 2017 . S. Jain et al. Impact of memory space optimization technique on fast network motif search algorithm. In Advances in Computer and Computational Sciences, pages 559--567. Springer, 2017."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741101"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.02.018"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3056105"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151106.3151112"},{"key":"e_1_3_2_2_44_1","volume-title":"Proc. CIDR'19","author":"Kipf A.","year":"2019","unstructured":"A. Kipf , T. Kipf , B. Radke , V. Leis , P. A. Boncz , and A. Kemper . Learned cardinalities: Estimating correlated joins with deep learning . In Proc. CIDR'19 , 2019 . A. Kipf, T. Kipf, B. Radke, V. Leis, P. A. Boncz, and A. Kemper. Learned cardinalities: Estimating correlated joins with deep learning. In Proc. CIDR'19, 2019."},{"key":"e_1_3_2_2_45_1","volume-title":"Proc. ICLR'17","author":"Kipf T. N.","year":"2017","unstructured":"T. N. Kipf and M. Welling . Semi-supervised classification with graph convolutional networks . In Proc. ICLR'17 , 2017 . T. N. Kipf and M. Welling. Semi-supervised classification with graph convolutional networks. In Proc. ICLR'17, 2017."},{"key":"e_1_3_2_2_46_1","first-page":"10","volume-title":"Proc. ICDM'13","author":"Kolda T. G.","year":"2013","unstructured":"T. G. Kolda , A. Pinar , and C. Seshadhri . Triadic measures on graphs: The power of wedge sampling . In Proc. ICDM'13 , pages 10 -- 18 , 2013 . T. G. Kolda, A. Pinar, and C. Seshadhri. Triadic measures on graphs: The power of wedge sampling. In Proc. ICDM'13, pages 10--18, 2013."},{"key":"e_1_3_2_2_47_1","first-page":"231","volume-title":"Proc. NIPS'94","author":"Krogh A.","year":"1994","unstructured":"A. Krogh and J. Vedelsby . Neural network ensembles, cross validation, and active learning . In Proc. NIPS'94 , pages 231 -- 238 , 1994 . A. Krogh and J. Vedelsby. Neural network ensembles, cross validation, and active learning. In Proc. NIPS'94, pages 231--238, 1994."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-335-6.50026-X"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915235"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313461"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403247"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389768"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3324958"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1992.4.4.590"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx758"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342643"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/219717.219748"},{"key":"e_1_3_2_2_59_1","first-page":"3671","volume-title":"Proc. ICML'18","author":"Mussmann S.","year":"2018","unstructured":"S. Mussmann and P. Liang . On the relationship between data efficiency and error for uncertainty sampling . In Proc. ICML'18 , pages 3671 -- 3679 , 2018 . S. Mussmann and P. Liang. On the relationship between data efficiency and error for uncertainty sampling. In Proc. ICML'18, pages 3671--3679, 2018."},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767868"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196990"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-017-0027-2"},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492517.2492535"},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389702"},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052597"},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl301"},{"key":"e_1_3_2_2_68_1","volume-title":"Proc. ICML'20","author":"Regol F.","unstructured":"F. Regol , S. Pal , Y. Zhang , and M. Coates . Active learning on attributed graphs via graph cognizant logistic regression and preemptive query generation . In Proc. ICML'20 . F. Regol, S. Pal, Y. Zhang, and M. Coates. Active learning on attributed graphs via graph cognizant logistic regression and preemptive query generation. In Proc. ICML'20."},{"key":"e_1_3_2_2_69_1","volume-title":"Apar'i cio, and F. Silva. A survey on subgraph counting: Concepts, algorithms and applications to network motifs and graphlets. CoRR, abs\/1910.13011","author":"Ribeiro P.","year":"2019","unstructured":"P. Ribeiro , P. Paredes , M. E. P. Silva , D. Apar'i cio, and F. Silva. A survey on subgraph counting: Concepts, algorithms and applications to network motifs and graphlets. CoRR, abs\/1910.13011 , 2019 . P. Ribeiro, P. Paredes, M. E. P. Silva, D. Apar'i cio, and F. Silva. A survey on subgraph counting: Concepts, algorithms and applications to network motifs and graphlets. CoRR, abs\/1910.13011, 2019."},{"key":"e_1_3_2_2_70_1","volume-title":"Synthesis Lectures on Artificial Intelligence and Machine Learning","author":"Settles B.","year":"2012","unstructured":"B. Settles . Active Learning . Synthesis Lectures on Artificial Intelligence and Machine Learning . Morgan & Claypool Publishers , 2012 . B. Settles. Active Learning. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, 2012."},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"e_1_3_2_2_72_1","first-page":"488","volume-title":"Proc. AISTATS'09","author":"Shervashidze N.","year":"2009","unstructured":"N. Shervashidze , S. V. N. Vishwanathan , T. Petri , K. Mehlhorn , and K. M. Borgwardt . Efficient graphlet kernels for large graph comparison . In Proc. AISTATS'09 , pages 488 -- 495 , 2009 . N. Shervashidze, S. V. N. Vishwanathan, T. Petri, K. Mehlhorn, and K. M. Borgwardt. Efficient graphlet kernels for large graph comparison. In Proc. AISTATS'09, pages 488--495, 2009."},{"key":"e_1_3_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2670313"},{"key":"e_1_3_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186003"},{"key":"e_1_3_2_2_75_1","volume-title":"Exploring complex networks. nature, 410(6825):268--276","author":"Strogatz S. H.","year":"2001","unstructured":"S. H. Strogatz . Exploring complex networks. nature, 410(6825):268--276 , 2001 . S. H. Strogatz. Exploring complex networks. nature, 410(6825):268--276, 2001."},{"key":"e_1_3_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368296"},{"key":"e_1_3_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380581"},{"key":"e_1_3_2_2_78_1","volume-title":"Data-driven prediction of drug effects and interactions. Science translational medicine, 4(125):125ra31--125ra31","author":"Tatonetti N. P.","year":"2012","unstructured":"N. P. Tatonetti , P. Y. Patrick , R. Daneshjou , and R. B. Altman . Data-driven prediction of drug effects and interactions. Science translational medicine, 4(125):125ra31--125ra31 , 2012 . N. P. Tatonetti, P. Y. Patrick, R. Daneshjou, and R. B. Altman. Data-driven prediction of drug effects and interactions. Science translational medicine, 4(125):125ra31--125ra31, 2012."},{"key":"e_1_3_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00117"},{"key":"e_1_3_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2009.0029"},{"key":"e_1_3_2_2_82_1","first-page":"5998","volume-title":"Proc. NeurIPS'17","author":"Vaswani A.","year":"2017","unstructured":"A. Vaswani , N. Shazeer , N. Parmar , J. Uszkoreit , L. Jones , A. N. Gomez , L. Kaiser , and I. Polosukhin . Attention is all you need . In Proc. NeurIPS'17 , pages 5998 -- 6008 , 2017 . A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, and I. Polosukhin. Attention is all you need. In Proc. NeurIPS'17, pages 5998--6008, 2017."},{"key":"e_1_3_2_2_83_1","volume-title":"Proc. ICLR'18","author":"Velickovic P.","year":"2018","unstructured":"P. Velickovic , G. Cucurull , A. Casanova , A. Romero , P. Li\u00f2 , and Y. Bengio . Graph attention networks . In Proc. ICLR'18 , 2018 . P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Li\u00f2, and Y. Bengio. Graph attention networks. In Proc. ICLR'18, 2018."},{"key":"e_1_3_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824051"},{"key":"e_1_3_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2756836"},{"key":"e_1_3_2_2_86_1","volume-title":"Collective dynamics of 'small-world'networks. nature, 393(6684):440--442","author":"Watts D. J.","year":"1998","unstructured":"D. J. Watts and S. H. Strogatz . Collective dynamics of 'small-world'networks. nature, 393(6684):440--442 , 1998 . D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world'networks. nature, 393(6684):440--442, 1998."},{"issue":"9","key":"e_1_3_2_2_87_1","first-page":"12","article-title":"A reduction of a graph to a canonical form and an algebra arising during this reduction","volume":"2","author":"Weisfeiler B.","year":"1968","unstructured":"B. Weisfeiler and A. A. Lehman . A reduction of a graph to a canonical form and an algebra arising during this reduction . Nauchno-Technicheskaya Informatsia , 2 ( 9 ): 12 -- 16 , 1968 . B. Weisfeiler and A. A. Lehman. A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Technicheskaya Informatsia, 2(9):12--16, 1968.","journal-title":"Nauchno-Technicheskaya Informatsia"},{"key":"e_1_3_2_2_88_1","volume-title":"Proc. ICLR'19","author":"Xu K.","year":"2019","unstructured":"K. Xu , W. Hu , J. Leskovec , and S. Jegelka . How powerful are graph neural networks ? In Proc. ICLR'19 , 2019 . K. Xu, W. Hu, J. Leskovec, and S. Jegelka. How powerful are graph neural networks? In Proc. ICLR'19, 2019."},{"key":"e_1_3_2_2_89_1","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377376"},{"key":"e_1_3_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368294"},{"key":"e_1_3_2_2_91_1","first-page":"4805","volume-title":"Proc. NeurIPS'18","author":"Ying Z.","year":"2018","unstructured":"Z. Ying , J. You , C. Morris , X. Ren , W. L. Hamilton , and J. Leskovec . Hierarchical graph representation learning with differentiable pooling . In Proc. NeurIPS'18 , pages 4805 -- 4815 , 2018 . Z. Ying, J. You, C. Morris, X. Ren, W. L. Hamilton, and J. Leskovec. Hierarchical graph representation learning with differentiable pooling. In Proc. NeurIPS'18, pages 4805--4815, 2018."},{"key":"e_1_3_2_2_92_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407840"},{"key":"e_1_3_2_2_93_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/594"},{"key":"e_1_3_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.249"},{"key":"e_1_3_2_2_95_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2223226"},{"key":"e_1_3_2_2_96_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7698"},{"key":"e_1_3_2_2_97_1","volume-title":"A survey on multi-task learning. CoRR, abs\/1707.08114","author":"Zhang Y.","year":"2017","unstructured":"Y. Zhang and Q. Yang . A survey on multi-task learning. CoRR, abs\/1707.08114 , 2017 . Y. Zhang and Q. Yang. A survey on multi-task learning. CoRR, abs\/1707.08114, 2017."},{"key":"e_1_3_2_2_98_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183739"},{"key":"e_1_3_2_2_99_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms14049"},{"key":"e_1_3_2_2_100_1","volume-title":"Graph neural networks: A review of methods and applications. CoRR, abs\/1812.08434","author":"Zhou J.","year":"2018","unstructured":"J. Zhou , G. Cui , Z. Zhang , C. Yang , Z. Liu , and M. Sun . Graph neural networks: A review of methods and applications. CoRR, abs\/1812.08434 , 2018 . J. Zhou, G. Cui, Z. Zhang, C. Yang, Z. Liu, and M. Sun. Graph neural networks: A review of methods and applications. CoRR, abs\/1812.08434, 2018."}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457289","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3457289","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:06Z","timestamp":1750195686000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":100,"alternative-id":["10.1145\/3448016.3457289","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3457289","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}