{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:07:30Z","timestamp":1729627650233,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1109\/iscc.2017.8024652","type":"proceedings-article","created":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T16:26:54Z","timestamp":1504542414000},"page":"973-980","source":"Crossref","is-referenced-by-count":4,"title":["A path-based recommendations approach for online systems via hyperbolic network embedding"],"prefix":"10.1109","author":[{"given":"Nikolaos","family":"Papadis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eleni","family":"Stai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasileios","family":"Karyotis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2294052"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CCNC.2014.6866575"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972900.13"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2491728"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1038\/nature11459"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864770"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367618"},{"journal-title":"Multimedia Tools and Applications","year":"2016","author":"stai","key":"ref17"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.1201\/b15505","author":"karyotis","year":"2013","journal-title":"Evolutionary Dynamics of Complex Communications Networks"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72079-9_9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.03.012"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.08.026"},{"key":"ref5","first-page":"300","article-title":"Comprehensive Survey on Distance\/Similarity Measures between Probability Density Functions","volume":"1","author":"cha","year":"2007","journal-title":"Int'l J Math Models & Meth App Science"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062083"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.4108\/icst.collaboratecom.2011.247162"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2016.7389825"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139924801"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462131"}],"event":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2017,7,3]]},"location":"Heraklion, Greece","end":{"date-parts":[[2017,7,6]]}},"container-title":["2017 IEEE Symposium on Computers and Communications (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8016448\/8024490\/08024652.pdf?arnumber=8024652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T23:51:42Z","timestamp":1570060302000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8024652\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/iscc.2017.8024652","relation":{},"subject":[],"published":{"date-parts":[[2017,7]]}}}