{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T09:02:40Z","timestamp":1781341360240,"version":"3.54.1"},"reference-count":45,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2020,1,1]]},"DOI":"10.1587\/transinf.2019edp7108","type":"journal-article","created":{"date-parts":[[2019,12,31]],"date-time":"2019-12-31T22:06:46Z","timestamp":1577830006000},"page":"71-84","source":"Crossref","is-referenced-by-count":9,"title":["HeteroRWR: A Novel Algorithm for Top-&lt;i&gt;k&lt;\/i&gt; Co-Author Recommendation with Fusion of Citation Networks"],"prefix":"10.1587","volume":"E103.D","author":[{"given":"Sufen","family":"ZHAO","sequence":"first","affiliation":[{"name":"School of Computer Science, Wuhan University"},{"name":"School of Computer Science, Central China Normal University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rong","family":"PENG","sequence":"additional","affiliation":[{"name":"School of Computer Science, Wuhan University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meng","family":"ZHANG","sequence":"additional","affiliation":[{"name":"School of Computer Science, Central China Normal University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liansheng","family":"TAN","sequence":"additional","affiliation":[{"name":"School of Computer Science, Central China Normal University"},{"name":"Discipline of ICT, School of Technology, Environments and Design, University of Tasmania"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] S. Zhang, L. Yao, A. Sun, and Y. Tay, \u201cDeep learning based recommender system: a survey and new perspectives,\u201d ACM Comput. Surv., vol.52, no.1, pp.5:1-5:38, Feb. 2019.","DOI":"10.1145\/3285029"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] M.A. Brand\u00e3o, M.M. Moro, G.R. Lopes, and J.P.M. Oliveria, \u201cUsing link semantics to recommend collaborations in academic social networks,\u201d Proc. 22nd International World Wide Web Conference (WWW&apos;13), Companion Volume, pp.833-840, Rio de Janeiro, Brazil, May 2013. 10.1145\/2487788.2488058","DOI":"10.1145\/2487788.2488058"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] Y. Dong, J. Tang, S. Wu, J. Tian, N.V. Chawla, J. Rao, and H. Cao, \u201cLink prediction and recommendation across heterogeneous social networks,\u201d Proc. IEEE 12th International Conf. Data Mining (ICDM&apos;12), pp.181-190, Brussels, Belgium, Dec. 2012. 10.1109\/icdm.2012.140","DOI":"10.1109\/ICDM.2012.140"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] V. Mart\u00ednez, F. Berzal, and J.-C. Cubero, \u201cA survey of link prediction in complex networks,\u201d ACM Comput. Surv., vol.49, no.4, p.69, Feb. 2017. 10.1145\/3012704","DOI":"10.1145\/3012704"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] A. Valdeolivas, L. Tichit, C. Navarro, S. Perrin, G. Odelin, N. Levy, P. Cau, E. Remy, and A. Baudot, \u201cRandom walk with restart on multiplex and heterogeneous biological networks,\u201d Bioinformatics, vol.35, no.3, pp.497-505, Feb. 2019. 10.1101\/134734","DOI":"10.1093\/bioinformatics\/bty637"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] F. Xia, Z. Chen, W. Wang, J. Li, and L.T. Yang, \u201cMVCWalker: random walk-based most valuable collaborators recommendation exploiting academic factors,\u201d IEEE Trans. Emerging Topics Comput., vol.2, no.3, pp.364-375, Sept. 2014. 10.1109\/tetc.2014.2356505","DOI":"10.1109\/TETC.2014.2356505"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] H.-H. Chen, L. Gou, X. Zhang, and C.L. Giles, \u201cCollabseer: a search engine for collaboration discovery,\u201d Proc. 11th Joint International Conference on Digital Libraries (JCDL&apos;11), pp.231-240, Ottawa, ON, Canada, June 2011. 10.1145\/1998076.1998121","DOI":"10.1145\/1998076.1998121"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] D. Guo, J. Xu, J. Zhang, M. Xu, Y. Cui, and X. He, \u201cUser relationship strength modeling for friend recommendation on Instagram,\u201d Neurocomputing, vol.239, pp.9-18, Feb. 2017. 10.1016\/j.neucom.2017.01.068","DOI":"10.1016\/j.neucom.2017.01.068"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] X. Kong, H. Jiang, T.M. Bekele, W. Wang, and Z. Xu, \u201cRandom walk-based beneficial collaborators recommendation exploiting dynamic research interests and academic influence,\u201d Proc. WWW&apos;17 Companion, pp.1371-1377, Perth, Australia, April 2017. 10.1145\/3041021.3051154","DOI":"10.1145\/3041021.3051154"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] Z. Yang, D. Li, R. Lin, Y. Tang, W. Li, and H. Liu, \u201cAn academic social network friend recommendation algorithm based on decision tree,\u201d Proc. 2018 IEEE SmartWorld, Ubiquitous Intelligence &amp; Computing, Advanced &amp; Trusted Computing, Scalable Computing &amp; Communications, Cloud &amp; Big Data Computing, Internet of People and Smart City Innovation, pp.1311-1316, Guangzhou, China, Oct. 2018. 10.1109\/smartworld.2018.00228","DOI":"10.1109\/SmartWorld.2018.00228"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] G.P. Gimenses, H. Gualdron, T.R. Raddo, and J.F. Rodrigues,\u201cSupervised-learning link recommendation in the DBLP co-authoring network,\u201d Proc. 12th PerCom Workshops, pp.563-568, San Diego, CA, USA, March 2014. 10.1109\/percomw.2014.6815268","DOI":"10.1109\/PerComW.2014.6815268"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] N. Benchettara, R. Kanawati, and C. Rouveirol, \u201cA supervised machine learning link prediction approach for academic collaboration recommendation,\u201d Proc. 4th ACM Conference on Recommender Systems (RecSys&apos;10), pp.253-256, Barcelona, Spain, Sept. 2010. 10.1145\/1864708.1864760","DOI":"10.1145\/1864708.1864760"},{"key":"13","unstructured":"[13] D.D. Lee and H.S. Seung, \u201cAlgorithms for non-negative matrix factorization,\u201d Proc. NIPS 2000, pp.556-562, Denver, CO, USA, Nov. 2000."},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] A.K. Menon and C. Elkan, \u201cLink prediction via matrix factorization,\u201d Proc. 15th Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML PKDD 2011), pp.437-452, Athens, Greece, Sept. 2011. 10.1007\/978-3-642-23783-6_28","DOI":"10.1007\/978-3-642-23783-6_28"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] D. Ding, M. Zhang, S.-Y. Li, J. Tang, X. Chen, and Z.-H. Zhou, \u201cBayDNN: friend recommendation with bayesian personalized ranking deep neural network,\u201d Proc. 26th ACM International Conference on Information and Knowledge Management (CIKM&apos;17), pp.1479-1488, Singapore, Nov. 2017. 10.1145\/3132847.3132941","DOI":"10.1145\/3132847.3132941"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] X. He, L. Liao, H. Zhang, L. Nie, X. Hu, and T.-S. Chua, \u201cNeural collaborative filtering,\u201d Proc. 26th International Conference on World Wide Web (WWW&apos;17), pp.173-182, Perth, Australia, April 2017. 10.1145\/3038912.3052569","DOI":"10.1145\/3038912.3052569"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] D. Kim, C. Park, J. Oh, S. Lee, and H. Yu, \u201cConvolutional matrix factorization for document context-aware recommendation,\u201d Proc. 10th ACM Conference on Recommender Systems (RecSys&apos;16), pp.233-240, Boston, MA, USA, Sept. 2016. 10.1145\/2959100.2959165","DOI":"10.1145\/2959100.2959165"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] H. Wang, N. Wang, and D.-Y. Yeung, \u201cCollaborative deep learning for recommender systems,\u201d Proc. 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD&apos;15), pp.1235-1244, Sydney, NSW, Australia, Aug. 2015. 10.1145\/2783258.2783273","DOI":"10.1145\/2783258.2783273"},{"key":"19","unstructured":"[19] J. Verma, S. Gupta, D. Mukherjee, and T. Chakraborty, \u201cHeterogeneous edge embeddings for friend recommendation,\u201d CoRR, vol.abs\/1902.03124, Feb. 2019."},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] C.C. Chen, S.-Y. Shih, and M. Lee, \u201cWho should you follow? Combining learning to rank with social influence for informative friend recommendation,\u201d Decision Support Systems, vol.90, pp.33-45, June 2016. 10.1016\/j.dss.2016.06.017","DOI":"10.1016\/j.dss.2016.06.017"},{"key":"21","unstructured":"[21] T. Chen, W. Zhang, Q. Lu, K. Chen, Z. Zheng, and Y. Yu, \u201cSVDFeature: A toolkit for feature-based collaborative filtering,\u201d Journal of Machine Learning Research, vol.13, pp.3619-3622, Jan. 2012."},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] D. Song, D.A. Meyer, and D. Tao, \u201cTop-k Link Recommendation in Social Networks,\u201d Proc. 15th IEEE Internatinal Conference on Data Mining (ICDM&apos;15), pp.389-398, Atlantic City, NJ, USA, Nov. 2015. 10.1109\/icdm.2015.136","DOI":"10.1109\/ICDM.2015.136"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] H. Li, \u201cA short introduction to learning to rank,\u201d IEICE Transactions on Information and Systems, vol.94-D, no.10, pp.1854-1862, Oct. 2011. 10.1587\/transinf.e94.d.1854","DOI":"10.1587\/transinf.E94.D.1854"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] D. Song, D.A. Meyer, and D. Tao, \u201cEfficient latent link recommendation in signed networks,\u201d Proc. 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD&apos;15), pp.1105-1114, Sydney, NSW, Australia, Aug. 2015. 10.1145\/2783258.2783358","DOI":"10.1145\/2783258.2783358"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] H. Ying, L. Chen, Y. Xiong, and J. Wu, \u201cCollaborative deep ranking: a Hybrid pair-wise recommendation algorithm with implicit feedback,\u201d Proc. 20th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD&apos;16), vol.9652, pp.555-567, Auckland, New Zealand, April 2016. 10.1007\/978-3-319-31750-2_44","DOI":"10.1007\/978-3-319-31750-2_44"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] D. Rafailidis and F. Crestani, \u201cFriend recommendation in location-based social networks via deep pairwise learning,\u201d Proc. 10th IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM&apos;18), pp.421-428, Barcelona, Spain, Aug. 2018. 10.1109\/asonam.2018.8508362","DOI":"10.1109\/ASONAM.2018.8508362"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] J. Yu, M. Gao, J. Li, H. Yin, and H. Liu, \u201cAdaptive implicit friends identification over heterogeneous network for social recommendation,\u201d Proc. 27th ACM International Conference on Information and Knowledge Management (CIKM&apos;18), pp.357-366, Torino, Italy, Oct. 2018. 10.1145\/3269206.3271725","DOI":"10.1145\/3269206.3271725"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] H. Chen, H. Yin, W. Wang, H. Wang, Q.V.H. Nguyen, and X. Li, \u201cPME: Projected metric embedding on heterogeneous networks for link prediction,\u201d Proc. 24th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining (KDD&apos;18), pp.1177-1186, London, UK, Aug. 2018. 10.1145\/3219819.3219986","DOI":"10.1145\/3219819.3219986"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] H. Yin, L. Zou, Q.V.H. Nguyen, Z. Huang, and X. Zhou, \u201cJoint event-partner recommendation in event-based social networks,\u201d Proc. 34th IEEE International Conference on Data Engineering (ICDE&apos;18), pp.929-940, Paris, France, April 2018. 10.1109\/icde.2018.00088","DOI":"10.1109\/ICDE.2018.00088"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] Z. Yin, M. Gupta, T. Weninger, and J. Han, \u201cA unified framework for link recommendation using random walks,\u201d Proc. International Conference on Advances in Social Networks Analysis and Mining (ASONAM&apos;10), pp.152-159, Odense, Denmark, Aug. 2010. 10.1109\/asonam.2010.27","DOI":"10.1109\/ASONAM.2010.27"},{"key":"31","doi-asserted-by":"crossref","unstructured":"[31] J. Gong, X. Gao, H. Cheng, J. Liu, Y. Song, M. Zhang, and Y. Zhao, \u201cIntegrating a weighted-average method into the random walk framework to generate individual friend recommendations,\u201d SCIENCE CHINA Information Sciences, vol.60, no.11, pp.110104:1-110104:22, Nov. 2017. 10.1007\/s11432-017-9243-7","DOI":"10.1007\/s11432-017-9243-7"},{"key":"32","doi-asserted-by":"crossref","unstructured":"[32] L. Backstrom and J. Leskovec, \u201cSupervised random walks: predicting and recommending links in social networks,\u201d Proc. 4th International Conference on Web Search and Data Mining (WSDM&apos;11), pp.635-644, Hong Kong, China, Feb. 2011. 10.1145\/1935826.1935914","DOI":"10.1145\/1935826.1935914"},{"key":"33","doi-asserted-by":"crossref","unstructured":"[33] J. Jung, W. Jin, L. Sael, and U. Kang, \u201cPersonalized ranking in signed networks using signed random walk with restart,\u201d Proc. 16th International Conference on Data Mining (ICDM&apos;16), pp.973-978, Barcelona, Spain, Dec. 2016. 10.1109\/icdm.2016.0122","DOI":"10.1109\/ICDM.2016.0122"},{"key":"34","doi-asserted-by":"crossref","unstructured":"[34] Y. Li and J.C. Patra, \u201cGenome-wide infering gene-phenotype relationship by walking on the heterogeneous network,\u201d Bioinformatics, vol.26, no.9, pp.1219-1224, March 2010. 10.1093\/bioinformatics\/btq108","DOI":"10.1093\/bioinformatics\/btq108"},{"key":"35","doi-asserted-by":"crossref","unstructured":"[35] D. Zhou, S.A. Orshanskiy, H. Zha, and C.L. Giles, \u201cCo-ranking authors and documents in a heterogenous network,\u201d Proc. 7th International Conference on Data Mining (ICDM&apos;07), pp.739-744, Omaha, NE, USA, Oct. 2007. 10.1109\/icdm.2007.57","DOI":"10.1109\/ICDM.2007.57"},{"key":"36","doi-asserted-by":"crossref","unstructured":"[36] Q. Meng and P.J. Kennedy, \u201cDiscovering influential authors in heterogeneous academic networks by a co-ranking method,\u201d Proc. 22nd ACM international conference on Information &amp; Knowledge Management (CIKM&apos;13), pp.1029-1036, San Francisco, CA, USA, Oct. 2013. 10.1145\/2505515.2505534","DOI":"10.1145\/2505515.2505534"},{"key":"37","unstructured":"[37] B. Zhang and H. Shang, Applied Stochastic Processes, China Renmin University Press, Beijing, 2016."},{"key":"38","doi-asserted-by":"publisher","unstructured":"[38] A.N. Langville and C.D. Meyer, \u201cdeeper inside pagerank,\u201d Internet Mathematics, vol.1, no.3, pp.335-380, Jan. 2004. 10.1080\/15427951.2004.10129091","DOI":"10.1080\/15427951.2004.10129091"},{"key":"39","doi-asserted-by":"publisher","unstructured":"[39] J. Kim and J. Diesner, \u201cA network-based approach to coauthorship credit allocation,\u201d Scientometrics, vol.101, no.1, pp.587-602, Feb. 2014. 10.1007\/s11192-014-1253-3","DOI":"10.1007\/s11192-014-1253-3"},{"key":"40","doi-asserted-by":"publisher","unstructured":"[40] D. Liben-Nowell and J. Kleinberg, \u201cThe link-prediction problem for social networks,\u201d Journal Of The American Society for Information Science and Technology, vol.58, no.7, pp.1019-1031, March 2007. 10.1002\/asi.20591","DOI":"10.1002\/asi.20591"},{"key":"41","unstructured":"[41] H. Siyao and X. Yan, \u201cFriend recommendation of microblog in classification framework: Using multiple social behavior features,\u201d International Conference on Behavioral, Economic, and Socio-Cultural Computing (BESC&apos;14), pp.169-174, Shanghai, China, Oct. 30-Nov. 1, 2014. 10.1109\/besc.2014.7059527"},{"key":"42","doi-asserted-by":"crossref","unstructured":"[42] Y. Koren, \u201cFactorization meets the neighborhood: a multifaceted collaborative filtering model,\u201d Proc. 14th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD&apos;08), pp.426-434, Las Vegas, Nevada, USA, Aug. 2008. 10.1145\/1401890.1401944","DOI":"10.1145\/1401890.1401944"},{"key":"43","unstructured":"[43] S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme, \u201cBPR: Bayesian personized ranking from implicit feedback,\u201d Proc. 25th Conference on Uncertainty in Artificial Intelligence (UAI&apos;09), pp.452-461, Montreal, QC, Canada, June 2009."},{"key":"44","unstructured":"[44] L.-C. Canon, M.E. Sayah, and P.-C. Heam, \u201cA markov chain monte carlo approach to cost matrix generation for scheduling performance evaluation,\u201d CoRR, vol.abs\/1803.08121, March 2018."},{"key":"45","unstructured":"[45] B. Walsh, \u201cMarkov chain Monte Carlo and Gibbs sampling,\u201d Lecture Notes for EEB 581, University of Arizona, http:\/\/nitro.biosci.arizona.edu\/courses\/EEB581-2004\/handouts\/Gibbs.pdf, accessed 2004."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/1\/E103.D_2019EDP7108\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T05:20:37Z","timestamp":1578288037000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/1\/E103.D_2019EDP7108\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,1]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2019edp7108","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,1]]}}}