Skip to main content

Co-author Recommender System

  • Conference paper
  • First Online:
Models, Algorithms, and Technologies for Network Analysis (NET 2016)

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 197))

Included in the following conference series:

Abstract

Modern bibliographic databases contain significant amount of information on publication activities of research communities. Researchers regularly encounter challenging task of selecting a co-author for joint research publication or searching for authors, whose papers are worth reading. We propose a new recommender system for finding possible collaborator with respect to research interests. The recommendation problem is formulated as a link prediction within the co-authorship network. The network is derived from the bibliographic database and enriched by the information on research papers obtained from Scopus and other publication ranking systems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Newman, M.E.J.: Coauthorship networks and patterns of scientific collaboration. PNAS 101(suppl 1), 5200–05205 (2004)

    Article  Google Scholar 

  2. Newman, M.E.J.: Who is the best connected scientist? a study of scientific coauthorship networks. In: Complex Networks, LNPh, pp. 337–370. Springer, Heidelberg (2000)

    Google Scholar 

  3. Morel, K.M., Serruya, S.J., Penna, G.O., Guimaraes, R.: Co-authorship network analysis: a powerful tool for strategic planning of research, development and capacity building programs on neglected diseases. PLOS Negl. Trop. Dis. 3(8), 1–7 (2009)

    Article  Google Scholar 

  4. Cetorelli, N., Peristiani, S.: Prestigious stock exchanges: a network analysis of international financial centers. J. Bank. Financ. 37(5), 1543–1551 (2013)

    Article  Google Scholar 

  5. Li, E.Y., Liaoa, C.H., Yenb, H.R.: Co-authorship networks and research impact: a social capital perspective. Res. Polic. 42(9), 1515–1530 (2013)

    Article  Google Scholar 

  6. Yan, E., Ding, Y.: Applying centrality measures to impact analysis: a coauthorship network analysis. J. Am. Soc. Inf. Sci. Technol. 60(10), 2107–2118 (2009)

    Article  Google Scholar 

  7. Sarigl, E., Pfitzner, R., Scholtes, I., Garas, A., Schweitzer, F.: Predicting scientific success based on coauthorship networks. EPJ Data Sci. 3(1), 9p (2014)

    Article  Google Scholar 

  8. Velden, T., Lagoze, C.: Patterns of collaboration in co-authorship networks in chemistry-mesoscopic analysis and interpretation, ISI - 2009, vol. 2, 12p. (2009)

    Google Scholar 

  9. Zervas, P., Tsitmidell, A., Sampson, D.G., Chen, N.S., Kinshuk.: Studying research collaboration patterns via co-authorship analysis in the field of tel: the case of ETS journal. J. Educ. Technol. Soc. 17(4), 1–16 (2014)

    Google Scholar 

  10. Wasserman, S., Faust, F.: Social Network Analysis Methods and Applications. Cambridge University Press, Cambridge (1994)

    Book  MATH  Google Scholar 

  11. Gonzlez-Pereira, B., Guerrero-Bote, V.P., Moya-Anegn, F.: A new approach to the metric of journals scientific prestige: the SJR indicator. J. Inf. 4(3), 379–391 (2010)

    Article  Google Scholar 

  12. Guerrero-Bote, V.P., Moya-Anegn, F.: A further step forward in measuring journals scientific prestige: the SJR2 indicator. J. Inf. 6(4), 674–688 (2012)

    Article  Google Scholar 

  13. Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol. 58(7), 1019–1031 (2007)

    Article  Google Scholar 

  14. Kumara, S., Raghavan, U.N., Albert, R.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 12p (2007)

    Google Scholar 

  15. Moore, C., Clauset, A., Newman, M.E.J.: Finding community structure in very large networks. Phys. Rev. E 70, 6p (2004)

    Google Scholar 

  16. Blondel, V.D., Guillaume, J., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. 2008(10), 12p (2008)

    Article  Google Scholar 

  17. Latapy, M., Pons, P.: Computing communities in large networks using random walks. In: Computer and Information Sciences - ISCIS 2005. LNCS, vol. 3733, pp. 284–293 (2005)

    Google Scholar 

  18. Bergstrom, C.T., Rosvall, M.: Maps of random walks on complex networks reveal community structure. PNAS 105(4), 1118–1123 (2008)

    Article  Google Scholar 

  19. Beel, J., Langer, S., Genzmehr, M., Gipp, B., Breitinger, C., Nurnberger, A.: Research paper recommender system evaluation: a quantitative literature survey. ACM RepSys, 15–22 (2013)

    Google Scholar 

Download references

Acknowledgements

I. Makarov was supported within the framework of the Basic Research Program at National Research University Higher School of Economics and within the framework of a subsidy by the Russian Academic Excellence Project ‘5-100’

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ilya Makarov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Makarov, I., Bulanov, O., Zhukov, L.E. (2017). Co-author Recommender System. In: Kalyagin, V., Nikolaev, A., Pardalos, P., Prokopyev, O. (eds) Models, Algorithms, and Technologies for Network Analysis. NET 2016. Springer Proceedings in Mathematics & Statistics, vol 197. Springer, Cham. https://doi.org/10.1007/978-3-319-56829-4_18

Download citation

Publish with us

Policies and ethics