{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:54:33Z","timestamp":1774626873508,"version":"3.50.1"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP200101199"],"award-info":[{"award-number":["DP200101199"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["LP180101309"],"award-info":[{"award-number":["LP180101309"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1109\/tnnls.2021.3104901","type":"journal-article","created":{"date-parts":[[2021,8,26]],"date-time":"2021-08-26T20:12:06Z","timestamp":1630008726000},"page":"1089-1096","source":"Crossref","is-referenced-by-count":13,"title":["Learning Graph Representations With Maximal Cliques"],"prefix":"10.1109","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1074-3492","authenticated-orcid":false,"given":"Soheila","family":"Molaei","sequence":"first","affiliation":[{"name":"Faculty of New Sciences and Technologies, University of Tehran, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4229-1542","authenticated-orcid":false,"given":"Nima Ghanbari","family":"Bousejin","sequence":"additional","affiliation":[{"name":"Faculty of New Sciences and Technologies, University of Tehran, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6559-0601","authenticated-orcid":false,"given":"Hadi","family":"Zare","sequence":"additional","affiliation":[{"name":"Faculty of New Sciences and Technologies, University of Tehran, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0517-9420","authenticated-orcid":false,"given":"Mahdi","family":"Jalili","sequence":"additional","affiliation":[{"name":"School of Engineering, RMIT University, Melbourne, VIC, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0794-527X","authenticated-orcid":false,"given":"Shirui","family":"Pan","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, Monash University, Clayton, VIC, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Graph attention networks","volume-title":"arXiv:1710.10903","author":"Veli\u010dkovi\u0107","year":"2017"},{"key":"ref2","article-title":"Representation learning on graphs: Methods and applications","volume-title":"arXiv:1709.05584","author":"Hamilton","year":"2017"},{"key":"ref3","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","volume":"70","author":"Gilmer"},{"key":"ref4","article-title":"LanczosNet: Multi-scale deep graph convolutional networks","volume-title":"arXiv:1901.01484","author":"Liao","year":"2019"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-31654-9_37"},{"key":"ref6","article-title":"Multi-stage self-supervised learning for graph convolutional networks on graphs with few labels","volume-title":"arXiv:1902.11038","author":"Sun","year":"2019"},{"key":"ref7","article-title":"MixHop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","volume-title":"arXiv:1905.00067","author":"Abu-El-Haija","year":"2019"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2693418"},{"key":"ref9","article-title":"Relational inductive biases, deep learning, and graph networks","volume-title":"arXiv:1806.01261","author":"Battaglia","year":"2018"},{"key":"ref10","first-page":"6007","article-title":"DFNets: Spectral CNNs for graphs with feedback-looped filters","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wijesinghe"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-019-05783-5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105153"},{"key":"ref13","article-title":"Learning discrete structures for graph neural networks","volume-title":"arXiv:1903.11960","author":"Franceschi","year":"2019"},{"key":"ref14","first-page":"7645","article-title":"Continual unsupervised representation learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Rao"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2492567"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.5555\/3327345.3327389"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/362"},{"key":"ref19","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"arXiv:1609.02907","author":"Kipf","year":"2016"},{"key":"ref20","article-title":"Revisiting semi-supervised learning with graph embeddings","volume-title":"arXiv:1603.08861","author":"Yang","year":"2016"},{"key":"ref21","first-page":"3844","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Defferrard"},{"key":"ref22","article-title":"Predict then propagate: Graph neural networks meet personalized pagerank","volume-title":"arXiv:1810.05997","author":"Klicpera","year":"2018"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098061"},{"key":"ref24","article-title":"Representation learning on graphs with jumping knowledge networks","volume-title":"arXiv:1806.03536","author":"Xu","year":"2018"},{"key":"ref25","article-title":"Just jump: Dynamic neighborhood aggregation in graph neural networks","volume-title":"arXiv:1904.04849","author":"Fey","year":"2019"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.5555\/2999134.2999257"},{"key":"ref27","article-title":"Spectral networks and locally connected networks on graphs","volume-title":"arXiv:1312.6203","author":"Bruna","year":"2013"},{"key":"ref28","article-title":"Simplifying graph convolutional networks","volume-title":"arXiv:1902.07153","author":"Wu","year":"2019"},{"key":"ref29","article-title":"Deep graph infomax","volume-title":"arXiv:1809.10341","author":"Veli\u010dkovi\u0107","year":"2018"},{"key":"ref30","article-title":"vGraph: A generative model for joint community detection and node representation learning","volume-title":"arXiv:1906.07159","author":"Sun","year":"2019"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref34","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref35","first-page":"4558","article-title":"Adaptive sampling towards fast graph representation learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Huang"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.2977595"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2543629"},{"key":"ref39","article-title":"Learning deep representations by mutual information estimation and maximization","volume-title":"arXiv:1808.06670","author":"Hjelm","year":"2018"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20662-7_31"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref42","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"arXiv:2005.00687","author":"Hu","year":"2020"},{"key":"ref43","article-title":"Pitfalls of graph neural network evaluation","volume-title":"arXiv:1811.05868","author":"Shchur","year":"2018"},{"key":"ref44","first-page":"249","article-title":"Understanding the difficulty of training deep feedforward neural networks","volume-title":"Proc. 13th Int. Conf. Artif. Intell. Statist.","author":"Glorot"},{"key":"ref45","article-title":"Adam: A method for stochastic optimization","volume-title":"arXiv:1412.6980","author":"Kingma","year":"2014"},{"issue":"1","key":"ref46","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":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.123"},{"key":"ref48","article-title":"Fisher\u2013Bures adversary graph convolutional networks","volume-title":"arXiv:1903.04154","author":"Sun","year":"2019"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-011-0841-3"},{"key":"ref50","first-page":"1","article-title":"GraphTSNE: A visualization technique for graph-structured data","volume-title":"Proc. ICLR Workshop Represent. Learn. Graphs Manifolds","author":"Leow"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/10036162\/09523717.pdf?arnumber=9523717","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T23:02:05Z","timestamp":1705014125000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9523717\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2]]},"references-count":50,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2021.3104901","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2]]}}}