{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T03:12:25Z","timestamp":1769915545110,"version":"3.49.0"},"reference-count":30,"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:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100004826","name":"Natural Science Foundation of Beijing Municipality","doi-asserted-by":"publisher","award":["4192008"],"award-info":[{"award-number":["4192008"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002888","name":"Beijing Municipal Commission of Education","doi-asserted-by":"publisher","award":["KM201710005023"],"award-info":[{"award-number":["KM201710005023"]}],"id":[{"id":"10.13039\/501100002888","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2902398","type":"journal-article","created":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T19:47:21Z","timestamp":1551728841000},"page":"30276-30284","source":"Crossref","is-referenced-by-count":25,"title":["HI2Rec: Exploring Knowledge in Heterogeneous Information for Movie Recommendation"],"prefix":"10.1109","volume":"7","author":[{"given":"Ming","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8826-9968","authenticated-orcid":false,"given":"Bo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6495-3893","authenticated-orcid":false,"given":"Xiangkun","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3209991"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-60131-1_19"},{"key":"ref11","article-title":"SPrank: Semantic path-based ranking for top-n recommendations using linked open data","volume":"8","author":"di noia","year":"2016","journal-title":"ACM Trans Intell Syst Technol"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507172"},{"key":"ref13","first-page":"926","article-title":"Reasoning with neural tensor networks for knowledge base completion","author":"socher","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref14","first-page":"1112","article-title":"Knowledge graph embedding by translating on hyperplanes","author":"wang","year":"2014","journal-title":"Proc 28th Conf Artif Intell (AAAI)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159666"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186175"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556259"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939673"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2017.2740022"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372071"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959131"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2003.1167344"},{"key":"ref3","first-page":"301","article-title":"Learning structured embeddings of knowledge bases","volume":"6","author":"bordes","year":"2011","journal-title":"Proc Nat Conf Artif Intell (AAAI)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2569096"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2988450.2988454"},{"key":"ref8","first-page":"3167","article-title":"A latent factor model for highly multi-relational data","author":"jenatton","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P15-1067"},{"key":"ref2","first-page":"2787","article-title":"Translating embeddings for modeling multi-relational data","author":"bordes","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref9","first-page":"2181","article-title":"Learning entity and relation embeddings for knowledge graph completion","author":"lin","year":"2015","journal-title":"Proc 29th Conf Artif Intell (AAAI)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-013-5363-6"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2685521"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2412037"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2415257"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1109\/TII.2014.2308433","article-title":"An efficient non-negative matrix-factorization-based approach to collaborative filtering for recommender systems","volume":"10","author":"luo","year":"2014","journal-title":"IEEE Trans Ind Informat"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2766528"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312682"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2016.2597829"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08657942.pdf?arnumber=8657942","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:40:57Z","timestamp":1628624457000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8657942\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2902398","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}