{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T18:06:28Z","timestamp":1730225188208,"version":"3.28.0"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/hpcs48598.2019.9188094","type":"proceedings-article","created":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T20:58:33Z","timestamp":1599685113000},"page":"528-534","source":"Crossref","is-referenced-by-count":0,"title":["End-to-End Learning of Graph Similarity"],"prefix":"10.1109","author":[{"given":"Zhixin","family":"Chen","sequence":"first","affiliation":[]},{"given":"Mengxiang","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Deqing","family":"Wang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","first-page":"1115","article-title":"Exploring network structure, dynamics, and function using NetworkX","author":"hagberg","year":"2008","journal-title":"Proceedings of the 7th Python in Science Conference (SciPy2008)"},{"year":"0","key":"ref32"},{"key":"ref31","first-page":"1343","article-title":"KONECT - The Koblenz Network Collection","author":"kunegis","year":"2013","journal-title":"Proc Int Web Observatory Workshop"},{"key":"ref30","article-title":"Efficient Estimation of Word Representations in Vector Space","author":"mikolov","year":"2013","journal-title":"Computer Science"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.2297929"},{"key":"ref11","article-title":"Differentiating Non-Isomorphic Graphlets for Graph Analytics","author":"alumbaugh","year":"2017","journal-title":"IEEE International Conference on Collaboration & Internet Computing IEEE"},{"journal-title":"node2vec Scalable feature learning for networks","year":"2016","author":"grover","key":"ref12"},{"journal-title":"Graphlets versus node2vec and struc2vec in the task of network alignment","year":"2018","author":"gu","key":"ref13"},{"journal-title":"Graph Edit Distance Computation via Graph Neural Networks","year":"2018","author":"bai","key":"ref14"},{"key":"ref15","article-title":"Reasoning With Neural Tensor Networks for Knowledge Base Completion","author":"socher","year":"2013","journal-title":"International Conference on Neural Information Processing Systems Curran Associates Inc"},{"key":"ref16","first-page":"974","article-title":"Efficient estimation of graphlet frequency distributions in proteinprotein interaction networks","volume":"22 8","author":"prulj","year":"0","journal-title":"Bioinformatics"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00179-7"},{"key":"ref18","article-title":"Matching Node Embeddings for Graph","author":"nikolentzos","year":"2017","journal-title":"Similarity"},{"journal-title":"Network embedding as matrix factorization Unifyingdeepwalk line pte and node2vec","year":"2017","author":"qiu","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.05.002"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-7-S4-S6"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"ref3","first-page":"521","article-title":"Maximum common subgraph isomorphism algorithms for the matching of chemical structures","volume":"16 7","author":"raymond","year":"0","journal-title":"J Comput Aided Mol Des"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.4137\/CIN.S680"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00060-3"},{"article-title":"Discriminative Embeddings of Latent Variable Models for Structured Data","year":"2016","author":"dai","key":"ref8"},{"journal-title":"Network Global Testing by Counting Graphlets","year":"2018","author":"jin","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-013-9335-0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth436"},{"article-title":"Semi-Supervised Classification with Graph Convolutional Networks","year":"2016","author":"kipf","key":"ref1"},{"journal-title":"Convolutional networks on graphs for learning molecular fingerprints","year":"2015","author":"duvenaud","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098061"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2008.12.014"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.129"},{"key":"ref23","first-page":"3539","article-title":"What is the distance between graphs","volume":"20","author":"bunke","year":"1983","journal-title":"Bulletin of the EATCS"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89689-0_33"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.28"}],"event":{"name":"2019 International Conference on High Performance Computing & Simulation (HPCS)","start":{"date-parts":[[2019,7,15]]},"location":"Dublin, Ireland","end":{"date-parts":[[2019,7,19]]}},"container-title":["2019 International Conference on High Performance Computing & Simulation (HPCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9183768\/9188050\/09188094.pdf?arnumber=9188094","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T21:50:27Z","timestamp":1658094627000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9188094\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/hpcs48598.2019.9188094","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}