{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:52Z","timestamp":1740169132962,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001866","name":"Fonds National de la Recherche Luxembourg","doi-asserted-by":"publisher","award":["LISTEN","PROCAST"],"award-info":[{"award-number":["LISTEN","PROCAST"]}],"id":[{"id":"10.13039\/501100001866","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council (ERC)","doi-asserted-by":"crossref","award":["AGNOSTIC"],"award-info":[{"award-number":["AGNOSTIC"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2927494","type":"journal-article","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T20:13:32Z","timestamp":1562703212000},"page":"92341-92354","source":"Crossref","is-referenced-by-count":15,"title":["A Bayesian Poisson\u2013Gaussian Process Model for Popularity Learning in Edge-Caching Networks"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2556-3865","authenticated-orcid":false,"given":"Sajad","family":"Mehrizi","sequence":"first","affiliation":[]},{"given":"Anestis","family":"Tsakmalis","sequence":"additional","affiliation":[]},{"given":"Symeon","family":"Chatzinotas","sequence":"additional","affiliation":[]},{"given":"Bjorn","family":"Ottersten","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2684748"},{"journal-title":"Nonlinear Programming","year":"1999","author":"bertsekas","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1992.4.3.415"},{"journal-title":"Pattern Recognition and Machine Learning","year":"2006","author":"bishop","key":"ref30"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/2827872","article-title":"The movielens datasets: History and context","volume":"5","author":"harper","year":"2016","journal-title":"ACM Trans Interact Intell Syst"},{"journal-title":"The Bayesian Choice From Decision-Theoretic Foundations to Computational Implementation","year":"2007","author":"robert","key":"ref35"},{"journal-title":"Numerical Optimization","year":"2006","author":"nocedal","key":"ref34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2885571"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2016.2636139"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2713384"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2017.2787979"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844985"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2905589"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2896380"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2536728"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISWCS.2014.6933489"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CCNC.2019.8651737"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2017.2773580"},{"key":"ref28","first-page":"113","article-title":"MCMC using Hamiltonian dynamics","volume":"54","author":"neal","year":"2010","journal-title":"Handbook of Markov Chain Monte Carlo"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2014.6963798"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139013567"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2014.7136382"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2682240"},{"journal-title":"The Matrix Cookbook","year":"2008","author":"petersen","key":"ref29"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2803816"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281606"},{"journal-title":"Global mobile data traffic forecast update 2016&#x2013;2021 white paper","year":"2017","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7537174"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7537172"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2806971"},{"key":"ref21","first-page":"161","article-title":"A transfer learning approach for cache-enabled wireless networks","author":"ba?tu?","year":"2015","journal-title":"Proc Int Symp Model Optim Mobile Ad-Hoc Wireless Netw (WiOpt)"},{"key":"ref24","first-page":"1","article-title":"A feature-based Bayesian method for content popularity prediction in edge-caching networks","author":"mehrizi","year":"2019","journal-title":"Proc IEEE Wireless Commun Netw Conf (WCNC)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2880482"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28650-9_4"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749260"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08758090.pdf?arnumber=8758090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:40:07Z","timestamp":1628624407000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8758090\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2927494","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}