{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T13:25:43Z","timestamp":1770989143496,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,10,16]],"date-time":"2019-10-16T00:00:00Z","timestamp":1571184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,10,16]],"date-time":"2019-10-16T00:00:00Z","timestamp":1571184000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61872219"],"award-info":[{"award-number":["61872219"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Key Research and Development Program of China","award":["2017YFB1400600"],"award-info":[{"award-number":["2017YFB1400600"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2019,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n              <jats:p>Nowadays, recommender system has become one of the main tools to search for users\u2019 interested papers. Since one paper often contains only a part of keywords that a user is interested in, recommender system returns a set of papers that satisfy the user\u2019s need of keywords. Besides, to satisfy the users\u2019 requirements of further research on a certain domain, the recommended papers must be correlated. However, each paper of an existing paper citation network hardly has cited relationships with others, so the correlated links among papers are very sparse. In addition, while a mass of research approaches have been put forward in terms of link prediction to address the network sparsity problems, these approaches have no relationship with the effect of self-citations and the potential correlations among papers (i.e., these correlated relationships are not included in the paper citation network as their published time is close). Therefore, we propose a link prediction approach that combines time, keywords, and authors\u2019 information and optimizes the existing paper citation network. Finally, a number of experiments are performed on the real-world Hep-Th datasets. The experimental results demonstrate the feasibility of our proposal and achieve good performance.<\/jats:p>","DOI":"10.1186\/s13638-019-1561-7","type":"journal-article","created":{"date-parts":[[2019,10,16]],"date-time":"2019-10-16T12:15:44Z","timestamp":1571228144000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":97,"title":["Link prediction in paper citation network to construct paper correlation graph"],"prefix":"10.1186","volume":"2019","author":[{"given":"Hanwen","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaizhen","family":"Kou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lianyong","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,16]]},"reference":[{"key":"1561_CR1","doi-asserted-by":"crossref","unstructured":"L. Pan et al., Academic Paper Recommendation Based on Heterogeneous Graph. Chinese Computational Linguistics and Natural Language Processing Based on Naturally Annotated Big Data (Springer, Guangzhou, 2015), pp. 381\u2013392","DOI":"10.1007\/978-3-319-25816-4_31"},{"key":"1561_CR2","doi-asserted-by":"publisher","unstructured":"X. Zhou et al., Academic influence aware and multidimensional network analysis for research collaboration navigation based on scholarly big data. IEEE Trans. Emerg. Top. Comput. (2018). \n                    https:\/\/doi.org\/10.1109\/TETC.2018.2860051","DOI":"10.1109\/TETC.2018.2860051"},{"issue":"6","key":"1561_CR3","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1109\/THMS.2017.2725341","volume":"48","author":"X Zhou","year":"2018","unstructured":"X. Zhou et al., Analysis of user network and correlation for community discovery based on topic-aware similarity and behavioral influence. IEEE Trans. Hum. Mach. Syst. 48(6), 559\u2013571 (2018). \n                    https:\/\/doi.org\/10.1109\/THMS.2017.2725341","journal-title":"IEEE Trans. Hum. Mach. Syst."},{"issue":"2","key":"1561_CR4","first-page":"9","volume":"6","author":"LM Aiello","year":"2012","unstructured":"L.M. Aiello et al., Friendship prediction and homophily in social media. ACM Trans. Web (TWEB) 6(2), 9 (2012)","journal-title":"ACM Trans. Web (TWEB)"},{"key":"1561_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/09537325.2012.748893","volume":"25","author":"C Lee","year":"2013","unstructured":"C. Lee et al., How to assess patent infringement risks: A semantic patent claim analysis using dependency relationships. Tech. Anal. Strat. Manag. 25, 23\u201338 (2013)","journal-title":"Tech. Anal. Strat. Manag."},{"issue":"6","key":"1561_CR6","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L L\u00fc","year":"2011","unstructured":"L. L\u00fc et al., Link prediction in complex networks: A survey. Phys. A 390(6), 1150\u20131170 (2011)","journal-title":"Phys. A"},{"key":"1561_CR7","first-page":"98","volume":"453","author":"A Clauset","year":"2008","unstructured":"A. Clauset et al., Hierarchical structure and the prediction of missing links in networks. Nat. Publ. Group 453, 98\u2013101 (2008)","journal-title":"Nat. Publ. Group"},{"key":"1561_CR8","first-page":"1147","volume-title":"Proceedings of the 20th ACM International Conference on Information and Knowledge Management. CIKM\u201911","author":"RH Li","year":"2011","unstructured":"R.H. Li et al., in Proceedings of the 20th ACM International Conference on Information and Knowledge Management. CIKM\u201911. Link prediction: The power of maximal entropy random walk (2011), pp. 1147\u20131156"},{"issue":"11","key":"1561_CR9","doi-asserted-by":"publisher","first-page":"2857","DOI":"10.1109\/TKDE.2016.2597823","volume":"28","author":"Z Wang","year":"2016","unstructured":"Z. Wang et al., An approach to cold-start link prediction: Establishing connections between non-topological and topological information. IEEE Trans. Knowl. Data Eng. 28(11), 2857\u20132870 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1561_CR10","doi-asserted-by":"crossref","unstructured":"E. Bastami et al., A gravitation-based link prediction approach in social networks. Swarm Evol. Comput. Available online (2018)","DOI":"10.1016\/j.swevo.2018.03.001"},{"issue":"2","key":"1561_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"M.E.J. Newman et al., The structure and function of complex networks. SIAM Rev. 45(2), 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"issue":"1","key":"1561_CR12","doi-asserted-by":"publisher","first-page":"18001","DOI":"10.1209\/0295-5075\/89\/18001","volume":"89","author":"L L\u00fc","year":"2010","unstructured":"L. L\u00fc et al., Link prediction in weighted networks: The role of weak ties. Europhys. Lett. Assoc. 89(1), 18001 (2010)","journal-title":"Europhys. Lett. Assoc."},{"key":"1561_CR13","first-page":"831","volume-title":"Proc. 17th ACM Conf. Comput. Supported Cooperative Work Social Comput","author":"L Backstrom","year":"2014","unstructured":"L. Backstrom et al., in Proc. 17th ACM Conf. Comput. Supported Cooperative Work Social Comput. Romantic partnerships and the dispersion of social ties: A network analysis of relationship status on Facebook (2014), pp. 831\u2013841"},{"key":"1561_CR14","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.knosys.2018.05.027","volume":"156","author":"CP Muniz","year":"2018","unstructured":"C.P. Muniz et al., Combining contextual, temporal and topological information for unsupervised link prediction in social network. Knowl.-Based Syst. 156, 129\u2013137 (2018)","journal-title":"Knowl.-Based Syst."},{"issue":"7","key":"1561_CR15","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"D. Liben-Nowell et al., The link-prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol. 58(7), 1019\u20131031 (2007)","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"issue":"8","key":"1561_CR16","doi-asserted-by":"publisher","first-page":"2470","DOI":"10.1007\/s10489-017-1086-x","volume":"48","author":"PM Chuan","year":"2018","unstructured":"P.M. Chuan et al., Link prediction in co-authorship networks based on hybrid content similarity metric. Appl. Intell. 48(8), 2470\u20132248 (2018)","journal-title":"Appl. Intell."},{"key":"1561_CR17","first-page":"4397061","volume":"2016","author":"L Qi","year":"2016","unstructured":"L. Qi et al., Time-Aware IoE Service Recommendation on Sparse Data. Mob. Inf. Syst. 2016, 4397061, 12 Pages (2016)","journal-title":"Mob. Inf. Syst."},{"key":"1561_CR18","volume-title":"ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)","author":"J Leskovec","year":"2005","unstructured":"J. Leskovec et al., in ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD). Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations (2005)"},{"key":"1561_CR19","unstructured":"Z. Wen et al., h-index-based link prediction methods in citation network. Scientometrics (2018)"},{"key":"1561_CR20","doi-asserted-by":"publisher","unstructured":"L. Qi et al., Finding all you need: Web APIs recommendation in web of things through keywords search. IEEE Trans. Comput. Soc. Syst. (2019). \n                    https:\/\/doi.org\/10.1109\/TCSS.2019.2906925","DOI":"10.1109\/TCSS.2019.2906925"},{"key":"1561_CR21","doi-asserted-by":"publisher","first-page":"105489","DOI":"10.1016\/j.asoc.2019.105489","volume":"81","author":"W Li","year":"2019","unstructured":"W. Li et al., On improving the accuracy with auto-encoder on conjunctivitis. Appl. Soft Comput. 81, 105489 (2019)","journal-title":"Appl. Soft Comput."},{"key":"1561_CR22","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.patrec.2019.03.021","volume":"123","author":"S Ding","year":"2019","unstructured":"S. Ding et al., Image caption generation with high-level image features. Pattern Recogn. Lett. 123, 89\u201395 (2019)","journal-title":"Pattern Recogn. Lett."},{"key":"1561_CR23","doi-asserted-by":"crossref","unstructured":"Z. Gao et al., Adaptive fusion and category-level dictionary learning model for multi-view human action recognition. IEEE Internet Things J. (2019)","DOI":"10.1109\/JIOT.2019.2911669"},{"key":"1561_CR24","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/j.ins.2018.11.030","volume":"480","author":"L Qi","year":"2019","unstructured":"L. Qi et al., Time-aware distributed service recommendation with privacy-preservation. Inf. Sci. 480, 354\u2013364 (2019)","journal-title":"Inf. Sci."},{"key":"1561_CR25","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.future.2018.10.053","volume":"94","author":"S Zhang","year":"2019","unstructured":"S. Zhang et al., A caching and spatial K-anonymity driven privacy enhancement scheme in continuous location-based services. Futur. Gener. Comput. Syst. 94, 40\u201350 (2019)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"1561_CR26","doi-asserted-by":"publisher","unstructured":"X. Wang et al., Improved multi-order distributed HOSVD with its incremental computing for smart city services. IEEE Trans. Sustain. Comput. (2018). \n                    https:\/\/doi.org\/10.1109\/TSUSC.2018.2881439","DOI":"10.1109\/TSUSC.2018.2881439"},{"key":"1561_CR27","first-page":"3075849","volume":"2018","author":"W Gong","year":"2018","unstructured":"W. Gong et al., Privacy-aware multidimensional mobile service quality prediction and recommendation in distributed fog environment. Wirel. Commun. Mob. Comput. 2018, 3075849, 8 pages (2018)","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"1561_CR28","doi-asserted-by":"publisher","unstructured":"S. Zhang et al., A trajectory privacy-preserving scheme based on a dual-K mechanism for continuous location-based services. Inf. Sci. (2019). \n                    https:\/\/doi.org\/10.1016\/j.ins.2019.05.054","DOI":"10.1016\/j.ins.2019.05.054"},{"key":"1561_CR29","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.future.2019.01.012","volume":"96","author":"X Xu","year":"2019","unstructured":"X. Xu et al., An edge computing-enabled computation offloading method with privacy preservation for internet of connected vehicles. Futur. Gener. Comput. Syst. 96, 89\u2013100 (2019)","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"11","key":"1561_CR30","doi-asserted-by":"publisher","first-page":"2616","DOI":"10.1109\/JSAC.2017.2760458","volume":"35","author":"L Qi","year":"2017","unstructured":"L. Qi et al., A distributed locality-sensitive hashing based approach for cloud service recommendation from multi-source data. IEEE J. Sel. Areas Commun. 35(11), 2616\u20132624 (2017)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"1561_CR31","first-page":"3437854","volume":"2017","author":"Y Xu","year":"2017","unstructured":"Y. Xu et al., Privacy-preserving and scalable service recommendation based on SimHash in a distributed cloud environment. Complexity 2017, 3437854, 9 pages (2017)","journal-title":"Complexity"},{"issue":"11","key":"1561_CR32","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1109\/MCOM.2017.1700360","volume":"55","author":"X Wang","year":"2017","unstructured":"X. Wang et al., A cloud-edge computing framework for cyber-physical-social services. IEEE Commun. Mag. 55(11), 80\u201385 (2017)","journal-title":"IEEE Commun. Mag."},{"key":"1561_CR33","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.future.2018.02.050","volume":"88","author":"L Qi","year":"2018","unstructured":"L. Qi et al., A two-stage locality-sensitive hashing based approach for privacy-preserving mobile service recommendation in cross-platform edge environment. Futur. Gener. Comput. Syst. 88, 636\u2013643 (2018)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"1561_CR34","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.knosys.2018.02.014","volume":"147","author":"Y Zhang","year":"2018","unstructured":"Y. Zhang et al., Service recommendation based on quotient space granularity analysis and covering algorithm on Spark. Knowl.-Based Syst. 147, 25\u201335 (2018)","journal-title":"Knowl.-Based Syst."},{"key":"1561_CR35","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.future.2018.12.039","volume":"94","author":"Z Gao","year":"2019","unstructured":"Z. Gao et al., Cognitive-inspired class-statistic matching with triple-constrain for camera free 3D object retrieval. Futur. Gener. Comput. Syst. 94, 641\u2013653 (2019)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"1561_CR36","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.future.2018.08.007","volume":"91","author":"S Wan","year":"2019","unstructured":"S. Wan et al., Multi-dimensional data indexing and range query processing via Voronoi diagram for internet of things. Futur. Gener. Comput. Syst. 91, 382\u2013391 (2019)","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"1","key":"1561_CR37","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/MNET.2018.1800192","volume":"33","author":"X Wang","year":"2019","unstructured":"X. Wang et al., A tensor-based big data-driven routing recommendation approach for heterogeneous networks. IEEE Netw. Mag. 33(1), 64\u201369 (2019)","journal-title":"IEEE Netw. Mag."},{"key":"1561_CR38","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.future.2018.10.054","volume":"93","author":"S Ding","year":"2019","unstructured":"S. Ding et al., A long video caption generation algorithm for big video data retrieval. Futur. Gener. Comput. Syst. 93, 583\u2013595 (2019)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"1561_CR39","doi-asserted-by":"publisher","unstructured":"L. Qi et al., A QoS-aware virtual machine scheduling method for energy conservation in Cloud-based Cyber-Physical Systems. World Wide Web J. (2019). \n                    https:\/\/doi.org\/10.1007\/s11280-019-00684-y","DOI":"10.1007\/s11280-019-00684-y"},{"key":"1561_CR40","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.future.2017.06.022","volume":"86","author":"S Zhang","year":"2018","unstructured":"S. Zhang et al., Enhancing privacy through uniform grid and caching in location-based services. Futur. Gener. Comput. Syst. 86, 881\u2013892 (2018)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"1561_CR41","doi-asserted-by":"publisher","first-page":"46926","DOI":"10.1109\/ACCESS.2018.2866641","volume":"6","author":"L Qi","year":"2018","unstructured":"L. Qi et al., Dynamic mobile crowdsourcing selection for electricity load forecasting. IEEE Access 6, 46926\u201346937 (2018)","journal-title":"IEEE Access"},{"key":"1561_CR42","doi-asserted-by":"publisher","unstructured":"Y. Zhang et al., Covering-based web service quality prediction via neighborhood-aware matrix factorization. IEEE Trans. Serv. Comput. (2019). \n                    https:\/\/doi.org\/10.1109\/TSC.2019.2891517","DOI":"10.1109\/TSC.2019.2891517"},{"issue":"5","key":"1561_CR43","doi-asserted-by":"publisher","first-page":"4191","DOI":"10.1109\/JIOT.2018.2842470","volume":"5","author":"S Zhang","year":"2018","unstructured":"S. Zhang et al., A dual privacy preserving scheme in continuous location-based services. IEEE Internet Things J. 5(5), 4191\u20134200 (2018)","journal-title":"IEEE Internet Things J."},{"key":"1561_CR44","doi-asserted-by":"publisher","unstructured":"X. Wang et al., NQA: A nested anti-collision algorithm for RFID systems. ACM Trans. Embed. Comput. Syst. 18(4) (2019). \n                    https:\/\/doi.org\/10.1145\/3330139","DOI":"10.1145\/3330139"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-019-1561-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13638-019-1561-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-019-1561-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T23:08:23Z","timestamp":1602716903000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-019-1561-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,16]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["1561"],"URL":"https:\/\/doi.org\/10.1186\/s13638-019-1561-7","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,16]]},"assertion":[{"value":"10 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"233"}}