{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:13:05Z","timestamp":1761581585925,"version":"3.37.3"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["2016YFB1000902"],"award-info":[{"award-number":["2016YFB1000902"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Grand Fundamental Research 973 Program of China","award":["2012CB316303","2014CB340401"],"award-info":[{"award-number":["2012CB316303","2014CB340401"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61402442","61572469","91646120","61572473","61303244","61402124"],"award-info":[{"award-number":["61402442","61572469","91646120","61572473","61303244","61402124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Soc. Syst."],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1109\/tcss.2017.2715069","type":"journal-article","created":{"date-parts":[[2017,7,18]],"date-time":"2017-07-18T18:24:15Z","timestamp":1500402255000},"page":"80-92","source":"Crossref","is-referenced-by-count":4,"title":["Link Inference in Dynamic Heterogeneous Information Network: A Knapsack-Based Approach"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0349-7617","authenticated-orcid":false,"given":"Yantao","family":"Jia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanzhuo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolong","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeya","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueqi","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1609\/icwsm.v4i1.14015","article-title":"The directed closure process in hybrid social-information networks, with an analysis of link formation on twitter","author":"romero","year":"2010","journal-title":"Proc ICWSM"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BFb0120892","article-title":"Quadratic knapsack problems","author":"gallo","year":"1980","journal-title":"Combinatorial Optimization"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1145\/2661829.2662017"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1145\/2594538.2594552"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1145\/2463676.2463704"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1145\/2382577.2382581"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1145\/2063576.2063743"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1145\/2124295.2124382"},{"key":"ref35","first-page":"4228","article-title":"Predicting links and their building time: A path-based approach","author":"li","year":"2016","journal-title":"Proc AAAI Conf Artif Intell"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1145\/1557019.1557111"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/ASONAM.2011.112"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1109\/TKDE.2015.2453956"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/ICDM.2012.144"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1145\/2487788.2487885"},{"key":"ref13","first-page":"3154","article-title":"Content-structural relation inference in knowledge base","author":"zhao","year":"2014","journal-title":"Proc 28th AAAI Conf Artif Intell"},{"key":"ref14","first-page":"529","article-title":"Random walk inference and learning in a large scale knowledge base","author":"lao","year":"2011","journal-title":"Proc Conf Empirical Methods Natural Language Process"},{"key":"ref15","first-page":"1017","article-title":"Reading the Web with learned syntactic-semantic inference rules","author":"lao","year":"2012","journal-title":"Proc Joint Conf Empirical Methods Natural Lang Process Comput Natural Lang Learn"},{"year":"2005","author":"thrun","journal-title":"Probabilistic Robotics","key":"ref16"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1002\/asi.20591"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1016\/S0378-8733(03)00009-1"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1145\/1731011.1731020"},{"year":"1979","author":"gary","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","key":"ref28"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/2481244.2481248"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.14778\/1453856.1453941"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/2124295.2124373"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/ASONAM.2011.107"},{"year":"1990","author":"martello","journal-title":"Knapsack Problems Algorithms and Computer Implementations","key":"ref29"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1145\/2020408.2020579"},{"key":"ref8","first-page":"81","article-title":"Statistical relational learning for link prediction","volume":"2003","author":"popescul","year":"2003","journal-title":"IJCAI Workshop on Learning Statistical Models from Relational Data"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/ASONAM.2012.78"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.2200\/S00433ED1V01Y201207DMK005"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/ICDMW.2011.150"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1145\/1935826.1935914"},{"key":"ref20","first-page":"69","article-title":"Temporality in link prediction: Understanding social complexity","volume":"7","author":"potgieter","year":"2008","journal-title":"Emergence Complex Organ"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1145\/1014052.1014068"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1287\/ijoc.1080.0292"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1145\/1247480.1247516"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.14778\/2078331.2078339"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1145\/1117454.1117462"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1145\/1871437.1871468"}],"container-title":["IEEE Transactions on Computational Social Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6570650\/8017658\/07983383.pdf?arnumber=7983383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T16:04:17Z","timestamp":1719331457000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7983383\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":40,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcss.2017.2715069","relation":{},"ISSN":["2329-924X"],"issn-type":[{"type":"electronic","value":"2329-924X"}],"subject":[],"published":{"date-parts":[[2017,9]]}}}