Attribute-Aware Graph Recurrent Networks for Scholarly Friend Recommendation Based on Internet of Scholars in Scholarly Big Data

The academic society is stepping into the age of scholarly big data, where finding suitable scholars for collaboration has become ever difficult. Scholarly recommendation approaches are designed to overcome the information overload problems. However, previous methods mainly consider network topology without considering scholars’ academic information and the manually designed similarity measurements may not have a good performance when applying to large-scale sparse networks. To this end, this article proposes to design a scholarly friend recommendation system by taking advantages of network embedding and scholar attributes. It is worth mentioning that different from traditional scientific collaborator recommendations, our goal is to recommend potential friends for scholars using academic social networks. We first construct an attributed social network by extracting scholars’ academic attributes from digital libraries. Then, we perform an attributed random walk which can jointly model network structure and scholar attributes. Finally, a novel graph recurrent neural framework is adopted to embed attributed scholar interactions within the model for recommendations. Experimental results on two real-world scholarly datasets demonstrate the effectiveness of our proposed method.

[1]  Max Welling,et al.  Semi-Supervised Classification with Graph Convolutional Networks , 2016, ICLR.

[2]  Xing Xie,et al.  Context-aware Academic Collaborator Recommendation , 2018, KDD.

[3]  Wenjie Li,et al.  A Three-Layered Mutually Reinforced Model for Personalized Citation Recommendation , 2018, IEEE Transactions on Neural Networks and Learning Systems.

[4]  Alfonso E. Romero,et al.  Scientific impact evaluation and the effect of self-citations: Mitigating the bias by discounting the h-index , 2012, J. Assoc. Inf. Sci. Technol..

[5]  Nitesh V. Chawla,et al.  New perspectives and methods in link prediction , 2010, KDD.

[6]  Palash Goyal,et al.  Graph Embedding Techniques, Applications, and Performance: A Survey , 2017, Knowl. Based Syst..

[7]  Mansaf Alam,et al.  A survey on scholarly data: From big data perspective , 2017, Inf. Process. Manag..

[8]  Jian Pei,et al.  A Survey on Network Embedding , 2017, IEEE Transactions on Knowledge and Data Engineering.

[9]  Xinbing Wang,et al.  AceKG: A Large-scale Knowledge Graph for Academic Data Mining , 2018, CIKM.

[10]  Steven Skiena,et al.  DeepWalk: online learning of social representations , 2014, KDD.

[11]  Feng Xia,et al.  Sustainable Collaborator Recommendation Based on Conference Closure , 2019, IEEE Transactions on Computational Social Systems.

[12]  Linyuan Lu,et al.  Link Prediction in Complex Networks: A Survey , 2010, ArXiv.

[13]  Nitesh V. Chawla,et al.  metapath2vec: Scalable Representation Learning for Heterogeneous Networks , 2017, KDD.

[14]  Chengqi Zhang,et al.  Network Representation Learning: A Survey , 2017, IEEE Transactions on Big Data.

[15]  David Liben-Nowell,et al.  The link-prediction problem for social networks , 2007 .

[16]  Geoffrey E. Hinton,et al.  Speech recognition with deep recurrent neural networks , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[17]  Feng Xia,et al.  MVCWalker: Random Walk-Based Most Valuable Collaborators Recommendation Exploiting Academic Factors , 2014, IEEE Transactions on Emerging Topics in Computing.

[18]  Feng Xia,et al.  Academic social networks: Modeling, analysis, mining and applications , 2019, J. Netw. Comput. Appl..

[19]  Feng Xia,et al.  Big Scholarly Data: A Survey , 2017, IEEE Transactions on Big Data.

[20]  Amr M. Tolba,et al.  Exploiting Publication Contents and Collaboration Networks for Collaborator Recommendation , 2016, PloS one.

[21]  Jie Tang,et al.  AMiner: Toward Understanding Big Scholar Data , 2016, WSDM.

[22]  Feng Xia,et al.  CSTeller: forecasting scientific collaboration sustainability based on extreme gradient boosting , 2019, World Wide Web.