ABSTRACT
Recent academic procedures have depicted that work involving scientific research tends to be more prolific through collaboration and cooperation among researchers and research groups. On the other hand, discovering new collaborators who are smart enough to conduct joint-research work is accompanied with both difficulties and opportunities. One notable difficulty as well as opportunity is the big scholarly data. In this paper, we satisfy the demand of collaboration recommendation through co-authorship in an academic network. We propose a random walk model using three academic metrics as basics for recommending new collaborations. Each metric is studied through mutual paper co-authoring information and serves to compute the link importance such that a random walker is more likely to visit the valuable nodes. Our experiments on DBLP dataset show that our approach can improve the precision, recall rate and coverage rate of recommendation, compared with other state-of-the-art approaches.
- L. Backstrom and J. Leskovec. Supervised random walks: Predicting and recommending links in social networks. In Proc. of ACM WSDM'11, pages 635--644, Hong Kong, China, 2011. Google ScholarDigital Library
- D. M. Boyd and N. B. Ellison. Social network sites: Definition, history, and scholarship. Journal of Computer-Mediated Communication, 13(1):210--230, 2007.Google ScholarDigital Library
- M. A. Brandao, M. M. Moro, G. R. Lopes, and J. P. Oliveira. Using link semantics to recommend collaborations in academic social networks. In Proc. of WWW'13 Companion, pages 833--840, 2013. Google ScholarDigital Library
- H.-H. Chen, L. Gou, X. Zhang, and C. L. Giles. Collabseer: A search engine for collaboration discovery. In Proc. of ACM/IEEE JCDL'11, pages 231--240, Ottawa, Ontario, Canada, 2011. Google ScholarDigital Library
- F. Fouss, A. Pirotte, J.-M. Renders, and M. Saerens. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Transactions on Knowledge and Data Engineering, 19(3):355--369, 2007. Google ScholarDigital Library
- J. Freyne, S. Berkovsky, E. M. Daly, and W. Geyer. Social networking feeds: Recommending items of interest. In Proc. of ACM RecSys'10, pages 277--280. Google ScholarDigital Library
- M. Jamali and M. Ester. Trustwalker: A random walk model for combining trust-based and item-based recommendation. In Proc. of ACM KDD'09, pages 397--406, Paris, France, 2009. Google ScholarDigital Library
- S. Lee and B. Bozeman. The impact of research collaboration on scientific productivity. Social Studies of Science, 35(5):673--702, 2005.Google ScholarCross Ref
- M. Ley. Dblp: some lessons learned. Proceedings of the VLDB Endowment, 2(2):1493--1500, 2009. Google ScholarDigital Library
- G. Lopes, M. M. Moro, L. K. Wives, and J. P. M. de Oliveira. Collaboration recommendation on academic social networks. In Advances in Conceptual Modeling IC Applications and Challenges, volume 6413 of Lecture Notes in Computer Science, pages 190--199. Springer Berlin Heidelberg, 2010. Google ScholarDigital Library
- H. Ma, D. Zhou, C. Liu, M. R. Lyu, and I. King. Recommender systems with social regularization. In Proc. of ACM WSDM'11, pages 287--296, Hong Kong, China, 2011. Google ScholarDigital Library
- M. E. J. Newman. Scientific collaboration networks. i. network construction and fundamental results. Physical Review E, 64(1):016131, Jun 2001.Google ScholarCross Ref
- S. Perugini, M. A. Goncalves, and E. A. Fox. Recommender systems research: A connection-centric survey. Journal of Intelligent Information Systems, 23(2):107--143, 2004. Google ScholarDigital Library
- J. Tang, S. Wu, J. Sun, and H. Su. Cross-domain collaboration recommendation. In Proc. of ACM KDD'12, pages 1285--1293, Beijing, China, 2012. ACM. Google ScholarDigital Library
- J. Tang, J. Zhang, L. Yao, J. Li, L. Zhang, and Z. Su. Arnetminer: extraction and mining of academic social networks. In Proc. of ACM KDD'08, pages 990--998, Las Vegas, Nevada, USA, 2008. ACM. Google ScholarDigital Library
- H. Tong, C. Faloutsos, and J.-Y. Pan. Random walk with restart: Fast solutions and applications. Knowledge and Information Systems, 14(3):327--346, 2008. Google ScholarDigital Library
- A. Toscher, M. Jahrer, and R. Legenstein. Improved neighborhood-based algorithms for large-scale recommender systems. In Proc. of NETFLIX'08, pages 4:1--4:6, Las Vegas, Nevada, 2008. ACM. Google ScholarDigital Library
Index Terms
- ACRec: a co-authorship based random walk model for academic collaboration recommendation
Recommendations
AVER: Random Walk Based Academic Venue Recommendation
WWW '15 Companion: Proceedings of the 24th International Conference on World Wide WebAcademic venues act as the main platform of communities in academia and the bridge of connecting researchers, which have rapidly developed in recent years. However, information overload in big scholarly data creates tremendous challenges for mining ...
On the Correlation Between Research Complexity and Academic Competitiveness
Digital Libraries at Times of Massive Societal TransitionAbstractAcademic capacity is a common way to reflect the educational level of a country or district. The aim of this study is to explore the difference between the scientific research level of institutions and countries. By proposing an indicator named ...
Dynamic network analytics for recommending scientific collaborators
AbstractCollaboration is one of the most important contributors to scientific advancement and a crucial aspect of an academic’s career. However, the explosion in academic publications has, for some time, been making it more challenging to find suitable ...
Comments