{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T23:43:20Z","timestamp":1772667800877,"version":"3.50.1"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/EU.html"}],"funder":[{"name":"Army Research Laboratory and National Science Foundation","award":["W911NF-09-2-0053"],"award-info":[{"award-number":["W911NF-09-2-0053"]}]},{"name":"Army Research Laboratory and National Science Foundation","award":["IIS-1144111"],"award-info":[{"award-number":["IIS-1144111"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2015,7,1]]},"DOI":"10.1109\/tkde.2014.2313871","type":"journal-article","created":{"date-parts":[[2014,3,26]],"date-time":"2014-03-26T18:04:54Z","timestamp":1395857094000},"page":"1741-1753","source":"Crossref","is-referenced-by-count":9,"title":["Breaking the Barrier to Transferring Link Information across Networks"],"prefix":"10.1109","volume":"27","author":[{"given":"Guo-Jun","family":"Qi","sequence":"first","affiliation":[]},{"given":"Charu C.","family":"Aggarwal","sequence":"additional","affiliation":[]},{"given":"Thomas S.","family":"Huang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1117454.1117456","article-title":"Link mining: A survey","volume":"7","author":"doppa","year":"2005","journal-title":"SIGKDD Explorations"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.025102"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2007.35"},{"key":"ref14","first-page":"170","article-title":"Learning probabilistic models of relational structure","author":"getoor","year":"0","journal-title":"Proc 18th Int Conf Mach Learn"},{"key":"ref15","first-page":"679","article-title":"Learning probabilistic models of link structure","volume":"3","author":"getoor","year":"2002","journal-title":"J Mach Learn Res"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646084"},{"key":"ref17","first-page":"485","article-title":"Discriminative probabilistic models for relational data","author":"taskar","year":"0","journal-title":"Proc 18th Conf Uncertainty Artif Intell"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143934"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.191"},{"key":"ref28","first-page":"272","article-title":"Efficient projections onto the $\\ell_1$ -ball for learning in high dimensions","author":"duchi","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref4","article-title":"Link prediction in relational data","author":"taskar","year":"0","journal-title":"Proc Neural Inform Process Syst"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250930"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.108"},{"key":"ref5","first-page":"340","article-title":"A parameterized probabilistic model of evolution for supervised link prediction","author":"kashima","year":"0","journal-title":"Proc 6th Int Conf Data Mining"},{"key":"ref8","article-title":"Chance constrained programs for link prediction","author":"doppa","year":"0","journal-title":"Proc NIPS Workshop Analyzing Netw Learning Graphs"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"ref2","article-title":"Link prediction using supervised learning","author":"al-hassan","year":"0","journal-title":"Workshop on Link Analysis Counter-terrorism and Security"},{"key":"ref9","first-page":"601","article-title":"Correcting sample selection bias by unlabeled data","author":"huang","year":"0","journal-title":"Proc Adv Neural Inform Process Syst"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1134271.1134284"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124382"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2011.6033446"},{"key":"ref21","first-page":"1477","article-title":"Predicting positive and negative links in signed social networks by transfer learning","author":"ye","year":"0","journal-title":"Proc Int World Wide Web Conf"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344136"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835837"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063741"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7116676\/06778767.pdf?arnumber=6778767","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:53:34Z","timestamp":1642006414000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6778767\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,1]]},"references-count":28,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2014.2313871","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2015,7,1]]}}}