A role model that supports career planning is important for authors in the academic area to improve research abilities. In this study, we discovered a role model in bibliographic networks based on two perspectives: (1) high research performance to be exemplary and (2) a similar research history that can be easily followed by authors. We assume that the year-wise subgraphs in the dynamic bibliographic network signify the ‘research history’. We discovered role models of authors in three steps: (1) learning vector representations of research history in dynamic bibliographic networks, (2) measuring the similarity of authors according to the research history and (3) visualising role models. With this process, we can recommend a reasonable role model whose research path the authors can easily follow. In addition, we verified the effectiveness of the research history embeddings and the accuracy of the recommended role model in a real data set.
KongXJiangHBekeleTMet al. Random walk-based beneficial collaborators recommendation exploiting dynamic research interests and academic influence. In: BarrettRCummingsRAgichteinE.et al. (eds) Proceedings of the 26th international conference on World Wide Web companion (WWW 2017). Perth, WA, Australia: ACM Press, pp. 1371–1377.
2.
BaiXWangMLeeIet al. Scientific paper recommendation: A survey. IEEE Access2019; 7: 9324–9339.
3.
WanWHuangFWangXet al. Dynamic detection of academic team communities based on temporal coauthor network. In: Proceedings of the 2017 IEEE international symposium on parallel and distributed processing with applications and 2017 IEEE international conference on ubiquitous computing and communications (ISPA/IUCC 2017), Guangzhou, China, 12–15 December 2017, pp. 464–469. New York: IEEE.
4.
SpeizerJJ.Role models, mentors, and sponsors: the elusive concepts. Signs: J Women Cult Soc1981; 6(4): 692–712.
5.
DouvanE.The role of models in women’s professional development. Psychol Women Quart1976; 1(1): 5–20.
6.
AtwaterLE.Credibility: how leaders gain and lose it, why people demand it. Leader Quart1996; 7(3): 427–430.
7.
CruessSRCruessRLSteinertY.Role modelling: making the most of a powerful teaching strategy. BMJ2008; 336(7646): 718–721.
8.
GollapalliSDMitraPGilesCL. Ranking experts using author-document-topic graphs. In: DownieJSMcDonaldRHColeTWet al. (eds) Proceedings of the 13th ACM/IEEE-CS joint conference on Digital libraries (JCDL 2013). Indianapolis, IN: ACM Press, pp. 87–96.
9.
CifarielloPFerraginaPPonzaM.Wiser: a semantic approach for expert finding in academia based on entity linking. Inform Syst2019; 82: 1–16.
10.
CaiLTianJLiuJet al. Scholarly impact assessment: a survey of citation weighting solutions. Scientometrics2018; 118(2): 453–478.
11.
JeonHJLeeOJJungJJ.Is performance of scholars correlated to their research collaboration patterns?Front Big Data2019; 2: 39.
LeeOJJeonHJJungJJ.Learning multi-resolution representations of research patterns in bibliographic networks. J Inform2021; 15(1): 101126.
14.
DaudAAljohaniNRAbbasiRAet al. Finding rising stars in co-author networks via weighted mutual influence. In BarrettRCummingsRAgichteinEet al. (eds) Proceedings of the 26th international conference on World Wide Web companion (WWW 2017). Perth, WA, Australia: ACM Press, pp. 33–41.
15.
AnilAChughUSinghSR. On applying meta-path for network embedding in mining heterogeneous DBLP network. In: DekaBMajiPMitraSet al. (eds) Proceedings of the 8th international conference on pattern recognition and machine intelligence (PReMI 2019), lecture notes in computer science, vol. 11942. Tezpur, India: Springer, pp. 249–257.
16.
LiuHKouHYanCet al. Keywords-driven and popularity-aware paper recommendation based on undirected paper citation graph. Complexity2020; 2020: 1–15.
17.
NewmanMEJ. Coauthorship networks and patterns of scientific collaboration. Proc Nat Acad Sci2004; 101(Supplement 1): 5200–5205.
18.
LichtenwalterRNLussierJTChawlaNV. New perspectives and methods in link prediction. In: RaoBKrishnapuramBTomkinsAet al. (eds) Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD 2010). Washington, DC: ACM Press, pp. 243–252.
19.
ChoHYuY.Link prediction for interdisciplinary collaboration via co-authorship network. Soc Netw Anal Mining2018; 8(1): 25.
20.
ChuanPMSonLHAliMet al. Link prediction in co-authorship networks based on hybrid content similarity metric. Appl Intel2017; 48(8): 2470–2486.
21.
XiaFChenZWangWet al. MVCWalker: random walk-based most valuable collaborators recommendation exploiting academic factors. IEEE T Emerg Topic Comput2014; 2(3): 364–375.
22.
JungJJ.Big bibliographic data analytics by random walk model. Mob Netw Appl2014; 20(4): 533–537.
23.
YangCLiuTChenXet al. HNRWalker: recommending academic collaborators with dynamic transition probabilities in heterogeneous networks. Scientometrics2020; 123(1): 429–449.
24.
JinTWuQOuXet al. Community detection and co-author recommendation in co-author networks. Int J Mach Learn Cybern2021; 12: 597–609.
25.
ZhouXDingLLiZet al. Collaborator recommendation in heterogeneous bibliographic networks using random walks. Inform Retriev J2017; 20(4): 317–337. DOI:10.1007/s10791-017
26.
ZhaoSPengRZhangMet al. HeteroRWR: a novel algorithm for top-k co-author recommendation with fusion of citation networks. IEICE T Inform Syst2020; E103D(1): 71–84.
27.
TangJQuMWangMet al. LINE: large-scale information network embedding. In: GangemiALeonardiSPanconesiA (eds) Proceedings of the 24th international conference on World Wide Web (WWW 2015). Florence: ACM, pp. 1067–1077.
28.
WangDCuiPZhuW. Structural deep network embedding. In: KrishnapuramBShahMSmolaAJet al. (eds) Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining (KDD 2016). San Francisco, CA: ACM Press, pp. 1225–1234.
29.
PerozziBAl-RfouRSkienaS. DeepWalk: online learning of social representations. In: MacskassySAPerlichCLeskovecJet al. (eds) Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD 2014). New York: ACM Press, pp. 701–710.
30.
GroverALeskovecJ. node2vec: scalable feature learning for networks. In: KrishnapuramBShahMSmolaAJet al. (eds) Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining (KDD 2016). San Francisco, CA: ACM Press, pp. 855–864.
31.
NarayananAChandramohanMChenLet al. subgraph2vec: learning distributed representations of rooted sub-graphs from large graphs, 2016. Available at: https://arxiv.org/abs/1606.08928
32.
MakarovIGerasimovaOSulimovPet al. Co-authorship network embedding and recommending collaborators via network embedding. In: van der AalstWBatageljVGlavasGet al. (eds) Proceedings of the 7th international conference on analysis of images, social networks and texts (AIST 2018), lecture notes in computer science, vol. 11179. Moscow: Springer, pp. 32–38.
33.
KongXJiangHYangZet al. Exploiting publication contents and collaboration networks for collaborator recommendation. PLoS ONE2016; 11(2): e0148492.
34.
MikolovTSutskeverIChenKet al. Distributed representations of words and phrases and their compositionality. In: BurgesCJCBottouLGhahramaniZet al. (eds) Advances in neural information processing systems 26: proceedings of 27th annual conference on neural information processing systems (NIPS 2013). Lake Tahoe, NV: Curran Associates, pp. 3111–3119.
35.
PradhanTPalS.A multi-level fusion based decision support system for academic collaborator recommendation. Knowl-Based Syst2020; 197: 105784.
36.
GaneshJGangulySGuptaMet al. Author2vec: learning author representations by combining content and link information. In: BourdeauJHendlerJNkambouRet al. (eds) Proceedings of the 25th international conference on World Wide Web (WWW 2016). Montreal, QC, Canada: ACM, pp. 49–50.
37.
KongXMaoMLiuJet al. TNERec: topic-aware network embedding for scientific collaborator recommendation. In: WangGHanQBhuiyanMZAet al. (eds) Proceedings of the 2018 IEEE SmartWorld, ubiquitous intelligence & computing, advanced & trusted computing, scalable computing & communications, cloud & big data computing, Internet of people and smart city innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI). Guangzhou, China: IEEE, pp. 1007–1014.
38.
HuangXLiJHuX. Label informed attributed network embedding. In: De RijkeMShokouhiMTomkinsAet al. (eds) Proceedings of the 10th ACM international conference on Web search and data mining (WSDM 2017). Cambridge: ACM Press, pp. 731–739.
39.
KongXJiangHWangWet al. Exploring dynamic research interest and academic influence for scientific collaborator recommendation. Scientometrics2017; 113(1): 369–385.
40.
SunNLuYCaoY.Career age-aware scientific collaborator recommendation in scholarly big data. IEEE Access2019; 7: 136036–136045.
41.
ZhangYZhangCLiuX. Dynamic scholarly collaborator recommendation via competitive multi-agent reinforcement learning. In: CremonesiPRicciFBerkovskySet al. (eds) Proceedings of the eleventh ACM conference on recommender systems (RecSys 2017). Como: ACM, pp. 331–335.
42.
XuYZhouDMaJ.Scholar-friend recommendation in online academic communities: an approach based on heterogeneous network. Dec Supp Syst2019; 119: 1–13.
43.
Al-ZboonSATawalbehSKAi-JarrahHet al. Resolving conflict of interests in recommending reviewers for academic publications using link prediction techniques. In: AlsmiratMAJararwehY (eds) Proceedings of the 2nd international conference on new trends in computing sciences (ICTCS 2019). Granada: IEEE, pp. 91–98.
44.
WuSHouUu RLBhowmickSSet al. PISTIS: a conflict of interest declaration and detection system for peer review management. In: DasGJermaineCMBernsteinPA (eds) Proceedings of the 2018 international conference on management of data (SIGMOD 2018). Houston, TX: ACM Press, pp. 1713–1716.
45.
YaoZSunYDingWet al. Dynamic word embeddings for evolving semantic discovery. In: ChangYZhaiCLiuYet al. (eds) Proceedings of the eleventh ACM international conference on Web search and data mining (WSDM 2018). Marina Del Rey, CA: ACM Press, pp. 673–681.
46.
GoyalPKamraNHeXet al. DynGEM: deep embedding method for dynamic graphs. In: IJCAI international workshop on representation learning for graphs 2017. Available at: https://arxiv.org/abs/1805.11273
ZhouLYangYRenXet al. Dynamic network embedding by modeling triadic closure process. In: McIlraithSAWeinbergerKQ (eds) Proceedings of the thirty-second AAAI conference on artificial intelligence, (AAAI 2018), the 30th innovative applications of artificial intelligence (IAAI 2018), and the 8th AAAI symposium on educational advances in artificial intelligence (EAAI 2018). New Orleans, LA: AAAI Press, pp. 571–578. Available at: https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/view/16572
49.
ZhuLGuoDYinJet al. Scalable temporal latent space inference for link prediction in dynamic social networks. IEEE T Knowl Data Eng2016; 28(10): 2765–2777.
50.
DuNDaiHTrivediRet al. Recurrent marked temporal point processes: embedding event history to vector. In: KrishnapuramBShahMSmolaAJet al. (eds) Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining (SIGKDD 2016). San Francisco, CA: ACM, pp. 1555–1564.
51.
ZhangYXiongYKongXet al. Learning node embeddings in interaction graphs. In: LimEWinslettMSandersonMet al. (eds) Proceedings of the 2017 ACM on conference on information and knowledge management (CIKM 2017). Singapore: ACM, pp. 397–406.
52.
NarayananAChandramohanMVenkatesanRet al. graph2vec: learning distributed representations of graphs. Comput Res Reposit2017. Available at: https://arxiv.org/abs/1707.05005
53.
LeQVMikolovT. Distributed representations of sentences and documents. In: XingEPJebaraT (eds) Proceedings of the 31st international conference on machine learning (ICML 2014), JMLR workshop and conference proceedings, vol. 32. Beijing, China: JMLR, pp. 1188–1196.
54.
EinickeGMalosJReidDet al. Riccati equation and EM algorithm convergence for inertial navigation alignment. IEEE T Sig Process2009; 57(1): 370–375. DOI:10.1109/tsp.2008.2007090
55.
AkaikeH.A new look at the statistical model identification. IEEE T Autom Contr1974; 19(6): 716–723.
56.
KumarSZhangXLeskovecJ. Predicting dynamic embedding trajectory in temporal interaction networks. In: TeredesaiAKumarVLiYet al. (eds) Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining (SIGKDD 2019). Anchorage, AK: ACM, pp. 1269–1278.
57.
HirschJE.An index to quantify an individual’s scientific research output. Proc Nat Acad Sci2005; 102(46): 16569–16572.
58.
YanEDingY.Discovering author impact: a PageRank perspective. Inform Process Manag2011; 47(1): 125–134.
