{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:05:50Z","timestamp":1740099950970,"version":"3.37.3"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/Crown.html"},{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100010790","name":"Erasmus","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,12,10]]},"DOI":"10.1109\/bigdata50022.2020.9378333","type":"proceedings-article","created":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T21:10:21Z","timestamp":1616188221000},"page":"3632-3641","source":"Crossref","is-referenced-by-count":2,"title":["Measuring Distances Among Graphs En Route To Graph Clustering"],"prefix":"10.1109","author":[{"given":"Ivan","family":"Kyosev","sequence":"first","affiliation":[]},{"given":"Iulia","family":"Paun","sequence":"additional","affiliation":[]},{"given":"Yashar","family":"Moshfeghi","sequence":"additional","affiliation":[]},{"given":"Nikos","family":"Ntarmos","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(77)90064-3"},{"key":"ref13","article-title":"The pagerank citation ranking: Bringing order to the web","author":"page","year":"1999","journal-title":"Tech Rep"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/345966.345982"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.18"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23783-6_16"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0094-2"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2004.1334558"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2017.8258553"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"year":"0","key":"ref5","article-title":"Open Ontology Repository"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1990","author":"garey","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"ref2","first-page":"35","article-title":"Modern information retrieval: A brief overview","volume":"24","author":"singhal","year":"2001","journal-title":"IEEE Data Eng Bull"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v31i1.11137","article-title":"Between subgraph isomorphism and maximum common subgraph","author":"hoffmann","year":"2017","journal-title":"Proc AAAI"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0114-2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339723"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(78)90005-5"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020512"},{"key":"ref24","article-title":"Efficient estimation of word representations in vector space","volume":"abs 1301 3781","author":"mikolov","year":"2013","journal-title":"CoRR"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"ref25","first-page":"246","article-title":"Hierarchical probabilistic neural network language model","author":"morin","year":"2005","journal-title":"Proc AISTATS"}],"event":{"name":"2020 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2020,12,10]]},"location":"Atlanta, GA, USA","end":{"date-parts":[[2020,12,13]]}},"container-title":["2020 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9377717\/9377728\/09378333.pdf?arnumber=9378333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T00:55:51Z","timestamp":1671670551000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9378333\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,10]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/bigdata50022.2020.9378333","relation":{},"subject":[],"published":{"date-parts":[[2020,12,10]]}}}