{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T14:03:32Z","timestamp":1762351412184,"version":"3.41.0"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Soc. Syst."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1109\/tcss.2023.3338691","type":"journal-article","created":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T21:23:05Z","timestamp":1704230585000},"page":"3594-3605","source":"Crossref","is-referenced-by-count":2,"title":["MSDGSD: A Scalable Graph Descriptor for Processing Large Graphs"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8395-3477","authenticated-orcid":false,"given":"Muhammad","family":"Ali","sequence":"first","affiliation":[{"name":"Information Technology University, Lahore, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6715-0068","authenticated-orcid":false,"given":"Anwar","family":"Said","sequence":"additional","affiliation":[{"name":"Vanderbilt University, Nashville, TN, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9818-4693","authenticated-orcid":false,"given":"Iqra","family":"Safder","sequence":"additional","affiliation":[{"name":"Fast NUCES, Lahore, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6509-9190","authenticated-orcid":false,"given":"Saeed Ul","family":"Hassan","sequence":"additional","affiliation":[{"name":"Information Technology University, Lahore, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9153-1293","authenticated-orcid":false,"given":"Naif Radi","family":"Aljohani","sequence":"additional","affiliation":[{"name":"King Abdulaziz University, Jeddah, Saudi Arabia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6961-0961","authenticated-orcid":false,"given":"Mudassir","family":"Shabbir","sequence":"additional","affiliation":[{"name":"Information Technology University, Lahore, Pakistan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110104"},{"author":"Hu","key":"ref3","article-title":"OGB-LSC: A large-scale challenge for machine learning on graphs"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807452"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.12.075"},{"author":"Kipf","key":"ref6","article-title":"Semi-supervised classification with graph convolutional networks"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219991"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-023-08346-x"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.4171\/icm2022\/162"},{"key":"ref11","first-page":"88","article-title":"Hunt for the unique, stable, sparse and fast feature learning on graphs","volume":"30","author":"Verma","year":"2017","journal-title":"Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3442390"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3155486"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.05.032"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2021.02.005"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.enbuild.2017.04.038"},{"author":"Yang","key":"ref17","article-title":"Deep neural decision trees"},{"key":"ref18","first-page":"1545","article-title":"Weakly supervised object recognition with convolutional neural networks","volume-title":"Proc. NIPS","volume":"vol","author":"Oquab","year":"2014"},{"key":"ref19","first-page":"1","article-title":"Learning continuous phrase representations and syntactic parsing with recursive neural networks","volume-title":"Proc. NIPS Deep Learn. Unsupervised Feature Learn. Workshop","volume":"2010","author":"Socher","year":"2010"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0333-9"},{"article-title":"Convolution kernels on discrete structures","year":"1999","author":"Haussler","key":"ref21"},{"key":"ref22","first-page":"244","article-title":"Kernel descriptors for visual recognition","volume":"23","author":"Bo","year":"2010","journal-title":"Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref23","first-page":"6938","article-title":"Efficient approximation algorithms for strings kernel based sequence classification","volume":"30","author":"Farhan","year":"2017","journal-title":"Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.75"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45167-9_11"},{"key":"ref26","first-page":"1639","article-title":"Halting in random walk kernels","volume":"28","author":"Sugiyama","year":"2015","journal-title":"Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.55730\/1300-0632.3910"},{"key":"ref28","first-page":"65","article-title":"Expressivity versus efficiency of graph kernels","volume-title":"Proc. 1st Int. Workshop Min. Graphs Trees Sequences","author":"Ramon","year":"2003"},{"key":"ref29","first-page":"2982","article-title":"The multiscale laplacian graph kernel","volume":"29","author":"Kondor","year":"2016","journal-title":"Proc. Adv. Neural Inf. Process. Syst."},{"issue":"9","key":"ref30","first-page":"2539","article-title":"Weisfeiler-Lehman graph kernels,\u201d","volume":"12","author":"Shervashidze","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref31","first-page":"6436","article-title":"Wasserstein Weisfeiler-Lehman graph kernels","volume":"32","author":"Togninalli","year":"2019","journal-title":"Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2492517.2492582"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2022.3178416"},{"article-title":"NeuroGraph: Benchmarks for graph machine learning in brain connectomics","year":"2023","author":"Said","key":"ref34"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467300"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref38","first-page":"701","article-title":"Convolutional networks on graphs for learning molecular fingerprints","volume":"28","author":"Duvenaud","year":"2015","journal-title":"Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2022.3211622"},{"article-title":"Gated graph sequence neural networks","year":"2015","author":"Li","key":"ref40"},{"key":"ref41","first-page":"2186","article-title":"Anonymous walk embeddings","author":"Ivanov","year":"2018","journal-title":"Proc. Int. Conf. Mach. Learn."},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1108\/K-06-2021-0473"},{"article-title":"NetSimile: A scalable approach to size-independent network similarity","year":"2012","author":"Berlingerio","key":"ref43"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2884700"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2022.3163144"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411866"},{"key":"ref47","first-page":"20","article-title":"Graph attention networks","volume":"1050","author":"Velickovic","year":"2017","journal-title":"stat"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.30"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl301"},{"article-title":"How powerful are graph neural networks?","year":"2018","author":"Xu","key":"ref50"},{"article-title":"DeeperGCN: All you need to train deeper GCNs","year":"2020","author":"Li","key":"ref51"}],"container-title":["IEEE Transactions on Computational Social Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6570650\/10557215\/10379490.pdf?arnumber=10379490","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T19:00:56Z","timestamp":1750100456000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10379490\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":51,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcss.2023.3338691","relation":{},"ISSN":["2329-924X","2373-7476"],"issn-type":[{"type":"electronic","value":"2329-924X"},{"type":"electronic","value":"2373-7476"}],"subject":[],"published":{"date-parts":[[2024,6]]}}}