{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T05:25:08Z","timestamp":1780637108442,"version":"3.54.1"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/asonam.2018.8508729","type":"proceedings-article","created":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T23:19:29Z","timestamp":1540509569000},"page":"47-52","source":"Crossref","is-referenced-by-count":39,"title":["Node, Motif and Subgraph: Leveraging Network Functional Blocks Through Structural Convolution"],"prefix":"10.1109","author":[{"given":"Carl","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mengxiong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vincent W.","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiawei","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2017","journal-title":"ICLRE"},{"key":"ref11","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","author":"defferrard","year":"2016","journal-title":"NIPS"},{"key":"ref12","doi-asserted-by":"crossref","DOI":"10.1126\/science.298.5594.824","article-title":"Network motifs: simple building blocks of complex networks","volume":"298","author":"milo","year":"2002","journal-title":"Science"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"ref14","article-title":"subgraph2vec: Learning distributed representations of rooted sub-graphs from large graphs","author":"narayanan","year":"2016","journal-title":"KDD Workshop"},{"key":"ref15","first-page":"564","article-title":"Bi-directional joint inference for user links and attributes on large social graphs","author":"yang","year":"2017","journal-title":"WWW"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783307"},{"key":"ref17","first-page":"2111","article-title":"Network representation learning with rich text information","author":"yang","year":"2015","journal-title":"IJCAI"},{"key":"ref18","first-page":"1201","article-title":"Graph kernels","volume":"11","author":"vishwanathan","year":"2010","journal-title":"JMLR"},{"key":"ref19","first-page":"2539","article-title":"Weisfeiler-lehman graph kernels","volume":"12","author":"shervashidze","year":"2011","journal-title":"JMLR"},{"key":"ref28","first-page":"2014","article-title":"Learning convolutional neural networks for graphs","author":"niepert","year":"2016","journal-title":"ICML"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-540-45167-9_11","article-title":"On graph kernels: Hardness results and efficient alternatives","volume":"2777","author":"g\u00e4rtner","year":"2003","journal-title":"Lecture Notes in Computer Science"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref6","article-title":"Revisiting semi-supervised learning with graph embeddings","author":"yang","year":"2016","journal-title":"ICML"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098094"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref7","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","author":"mikolov","year":"2013","journal-title":"NIPS"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","article-title":"A global geometric framework for nonlinear dimensionality reduction","volume":"290","author":"tenenbaum","year":"2000","journal-title":"Science"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806512"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807452"},{"key":"ref20","first-page":"488","article-title":"Efficient graphlet kernels for large graph comparison","author":"shervashidze","year":"2009","journal-title":"AISTATS"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg130"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1021\/jm00106a046"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(03)00628-4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"ref25","first-page":"678","article-title":"Comparison of descriptor spaces for chemical compound retrieval and classification","author":"wale","year":"2006","journal-title":"ICDM"}],"event":{"name":"2018 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","location":"Barcelona","start":{"date-parts":[[2018,8,28]]},"end":{"date-parts":[[2018,8,31]]}},"container-title":["2018 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8488381\/8508239\/08508729.pdf?arnumber=8508729","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T21:29:48Z","timestamp":1643232588000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8508729\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/asonam.2018.8508729","relation":{},"subject":[],"published":{"date-parts":[[2018,8]]}}}