{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T16:14:55Z","timestamp":1783700095795,"version":"3.55.0"},"reference-count":81,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","funder":[{"name":"National Key RD Program of China","award":["No.2018YFB1403202"],"award-info":[{"award-number":["No.2018YFB1403202"]}]},{"name":"Soft Science Research Project of Zhejiang Province Science and Technology Department","award":["No.2020C25035"],"award-info":[{"award-number":["No.2020C25035"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.61972349"],"award-info":[{"award-number":["No.61972349"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tkde.2021.3090664","type":"journal-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T20:10:43Z","timestamp":1624047043000},"page":"1-1","source":"Crossref","is-referenced-by-count":54,"title":["Hierarchical Multi-View Graph Pooling with Structure Learning"],"prefix":"10.1109","author":[{"given":"Zhen","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiajun","family":"Bu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Ester","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianfeng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhao","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chengwei","family":"Yao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dai","family":"Huifen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhi","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Can","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(03)00628-4"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"ref71","article-title":"Revisiting semi-supervised learning with graph embeddings","author":"yang","year":"2016"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"ref76","article-title":"Fast graph representation learning with pytorch geometric","author":"fey","year":"2019"},{"key":"ref77","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"srivastava","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref74","first-page":"488","article-title":"Efficient graphlet kernels for large graph comparison","author":"shervashidze","year":"2009","journal-title":"Proc 12th Int Conf Artif Intell Statist"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00059"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3133021"},{"key":"ref78","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014"},{"key":"ref79","first-page":"2837","article-title":"Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance","volume":"11","author":"vinh","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313395"},{"key":"ref32","article-title":"Edge contraction pooling for graph neural networks","author":"diehl","year":"2019"},{"key":"ref31","first-page":"2083","article-title":"Graph U-NETS","author":"gao","year":"2019","journal-title":"Proc 36th Int Conf Mach Learn"},{"key":"ref30","article-title":"Benchmarking graph neural networks","author":"dwivedi","year":"2020"},{"key":"ref37","article-title":"Hierarchical graph pooling with structure learning","author":"zhang","year":"2019"},{"key":"ref36","first-page":"874","article-title":"Spectral clustering with graph neural networks for graph pooling","author":"bianchi","year":"2020","journal-title":"Proc 37th Int Conf Mach Learn"},{"key":"ref35","first-page":"3734","article-title":"Self-attention graph pooling","author":"lee","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330982"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139088510"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1810452115"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"ref63","article-title":"The Pagerank citation ranking: Bringing order to the web","author":"page","year":"1999"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313488"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1208999"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"ref65","article-title":"Predict then propagate: Graph neural networks meet personalized pagerank","author":"klicpera","year":"2018"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11691"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01157"},{"key":"ref68","article-title":"A regularized framework for sparse and structured neural attention","author":"niculae","year":"2017"},{"key":"ref69","article-title":"Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application","author":"wang","year":"2013"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref1","first-page":"1097","article-title":"ImageNet classification with deep convolutional neural networks","author":"krizhevsky","year":"2012","journal-title":"Proc 25th Int Conf Neural Inf Process Syst"},{"key":"ref20","first-page":"1263","article-title":"Neural message passing for quantum chemistry","author":"gilmer","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref22","first-page":"4800","article-title":"Hierarchical graph representation learning with differentiable pooling","author":"ying","year":"2018","journal-title":"Proc 32nd Int Conf Neural Inf Process Syst"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00113"},{"key":"ref24","article-title":"A fair comparison of graph neural networks for graph classification","author":"errica","year":"2019"},{"key":"ref23","article-title":"How powerful are graph neural networks?","author":"xu","year":"2018"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/438"},{"key":"ref25","first-page":"593","article-title":"Modeling relational data with graph convolutional networks","author":"schlichtkrull","year":"2018","journal-title":"Proc Eur Semantic Web Conf"},{"key":"ref50","article-title":"A comprehensive survey on graph neural networks","author":"wu","year":"2019"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00658"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/630"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1115"},{"key":"ref57","article-title":"Hybrid approach of relation network and localized graph convolutional filtering for breast cancer subtype classification","author":"rhee","year":"2017"},{"key":"ref56","article-title":"Structpool: Structured graph pooling via conditional random fields","author":"yuan","year":"2020","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref53","article-title":"Order matters: Sequence to sequence for sets","author":"vinyals","year":"2015"},{"key":"ref52","article-title":"IPOOL–information-based pooling in hierarchical graph neural networks","author":"gao","year":"2019"},{"key":"ref10","first-page":"2539","article-title":"Weisfeiler-Lehman graph kernels","volume":"12","author":"shervashidze","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref11","article-title":"Spectral networks and locally connected networks on graphs","author":"bruna","year":"2013"},{"key":"ref40","first-page":"1614","article-title":"From softmax to sparsemax: A sparse model of attention and multi-label classification","author":"martins","year":"2016","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref12","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2017"},{"key":"ref13","article-title":"Graph neural networks with convolutional ARMA filters","author":"bianchi","year":"2019"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.10.016"},{"key":"ref15","first-page":"1024","article-title":"Inductive representation learning on large graphs","author":"hamilton","year":"2017","journal-title":"Proc 31st Int Conf Neural Inf Process Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.576"},{"key":"ref81","first-page":"2579","article-title":"Visualizing data using T-SNE","volume":"9","author":"maaten","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref17","article-title":"Graph attention networks","author":"veli?kovi?","year":"2018"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"ref19","first-page":"5453","article-title":"Representation learning on graphs with jumping knowledge networks","author":"xu","year":"0","journal-title":"Proc 35th Int Conf Mach Learn 2018"},{"key":"ref80","first-page":"3049","article-title":"The impact of random models on clustering similarity","volume":"18","author":"gates","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref4","article-title":"Neural machine translation by jointly learning to align and translate","author":"bahdanau","year":"2015"},{"key":"ref3","first-page":"3104","article-title":"Sequence to sequence learning with neural networks","author":"sutskever","year":"2014","journal-title":"Proc 27th Int Conf Neural Inf Process Syst"},{"key":"ref6","first-page":"568","article-title":"Two-stream convolutional networks for action recognition in videos","author":"simonyan","year":"2014","journal-title":"Proc 27th Int Conf Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.223"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"ref7","first-page":"3844","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","author":"defferrard","year":"2016","journal-title":"Proc 30th Int Conf Neural Inf Process Syst"},{"key":"ref49","article-title":"Deep learning on graphs: A survey","author":"zhang","year":"2018"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1021\/jm040835a"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159706"},{"key":"ref45","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","author":"mikolov","year":"2013","journal-title":"Proc 26th Int Conf Neural Inf Process Syst"},{"key":"ref48","article-title":"Graph neural networks: A review of methods and applications","author":"zhou","year":"2018"},{"key":"ref47","first-page":"6861","article-title":"Simplifying graph convolutional networks","author":"wu","year":"2019","journal-title":"Proc 36th Int Conf Mach Learn"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref43","article-title":"Efficient estimation of word representations in vector space","author":"mikolov","year":"2013"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/09460814.pdf?arnumber=9460814","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T15:23:10Z","timestamp":1670512990000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9460814\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":81,"URL":"https:\/\/doi.org\/10.1109\/tkde.2021.3090664","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}