{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:22:51Z","timestamp":1783009371783,"version":"3.54.5"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012639","name":"Prince Sultan University for paying the Article Processing Charges","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012639","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3307015","type":"journal-article","created":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T17:57:05Z","timestamp":1692640625000},"page":"90724-90738","source":"Crossref","is-referenced-by-count":7,"title":["CrossDomain Recommendation Based on MetaData Using Graph Convolution Networks"],"prefix":"10.1109","volume":"11","author":[{"given":"Rabia","family":"Khan","sequence":"first","affiliation":[{"name":"Department of Computer Software Engineering, National University of Sciences and Technology, Islamabad, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5392-5187","authenticated-orcid":false,"given":"Naima","family":"Iltaf","sequence":"additional","affiliation":[{"name":"Department of Computer Software Engineering, National University of Sciences and Technology, Islamabad, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5304-5948","authenticated-orcid":false,"given":"Rabia","family":"Latif","sequence":"additional","affiliation":[{"name":"Artificial Intelligence and Data Analytics Laboratory, College of Computer and Information Sciences (CCIS), Prince Sultan University, Riyadh, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nor Shahida Mohd","family":"Jamail","sequence":"additional","affiliation":[{"name":"Artificial Intelligence and Data Analytics Laboratory, College of Computer and Information Sciences (CCIS), Prince Sultan University, Riyadh, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2011.57"},{"key":"ref2","first-page":"2318","article-title":"Transfer learning to predict missing ratings via heterogeneous user feedbacks","volume-title":"Proc. Int. Joint Conf. Artif. Intell. (IJCAI)","volume":"22","author":"Pan"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553454"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.03.012"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331267"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-023-14424-y"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3048414"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313488"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/BRACIS.2014.45"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.08.035"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018665"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/jemt.23861"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.32604\/cmc.2021.016348"},{"key":"ref14","article-title":"Neural machine translation by jointly learning to align and translate","author":"Bahdanau","year":"2014","journal-title":"arXiv:1409.0473"},{"key":"ref15","first-page":"34","article-title":"Exploiting social tags in matrix factorization models for crossdomain collaborative filtering","volume-title":"Proc. CEUR Workshop","volume":"1245","author":"Fern\u00e1ndez-Tob\u00edas"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/343"},{"key":"ref17","article-title":"Graph convolutional matrix completion","author":"van den Berg","year":"2017","journal-title":"arXiv:1706.02263"},{"key":"ref18","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst. (NeurIPS)","author":"Hamilton"},{"key":"ref19","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Velickovic"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330989"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330836"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-020-01499-4"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/239"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/601"},{"key":"ref26","first-page":"2052","article-title":"Can movies and books collaborate? Cross-domain collaborative filtering for sparsity reduction","volume-title":"Proc. 21st Int. Joint Conf. Artif. Intell. (IJCAI)","author":"Li"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39878-0_10"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/592"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-019-01396-5"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/d19-1018"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401169"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015329"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/SDS49854.2020.9143953"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2043932.2043969"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106664"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3002531"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIA49625.2020.00013"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3013639"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.csl.2020.101182"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/INFRKM.2018.8464694"},{"key":"ref42","article-title":"Grid search, random search, genetic algorithm: A big comparison for NAS","author":"Liashchynskyi","year":"2019","journal-title":"arXiv:1912.06059"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10225535.pdf?arnumber=10225535","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T02:10:51Z","timestamp":1705025451000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10225535\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3307015","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}