Skip to main content

Ranking Scientific Papers on the Basis of Their Citations Growing Trend

  • Conference paper
  • First Online:
3rd International Winter School and Conference on Network Science (NetSci-X 2017)

Part of the book series: Springer Proceedings in Complexity ((SPCOM))

Included in the following conference series:

Abstract

Analyzing databases of academic papers citations with the tools of graph and network sciences produced many different results in the past: Publications ranking algorithms, predicting the becoming of their popularity either using the citations only or in association with the co-author or affiliations networks, understanding better the “ethnological aspects” of citation practices. The examination of the dynamical properties of such networks, i.e. how their nodes in-degree grows in time, started more recently. In this paper, we propose a novel ranking algorithm that makes a key use of these growth characteristics (for instance rewarding young, emerging stars more, and old, declining ones less) while requiring much less information and computation. To validate our ranking results and compare them with more established algorithms such as PageRank and FutureRank, four well-known datasets are used.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.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

Notes

  1. 1.

    The ArXiV HEPTH and HEPPH datasets are available online at the following address http://www.cs.cornell.edu/projects/kddcup/datasets.html. The American Physical Society dataset is available online at the following address http://journals.aps.org/datasets. The PubMed dataset is available online at the following address http://www.ncbi.nlm.nih.gov/pmc/tools/ftp/.

References

  1. Hirsch, J.E.: An index to quantify an individual’s scientific research output. Proc. Natl. Acad. Sci. 102 (46), 16669–16572 (2005). doi:10.1073/pnas.0507655102

    Article  MATH  Google Scholar 

  2. Batista, P.D., Campiteli, M.G., Kinouchi, O.: Is it possible to compare researchers with different scientific interests? Scientometrics 68 (1), 179–189 (2006)

    Article  Google Scholar 

  3. Sidiropoulos, A., Katsaros, D., Manolopoulos, Y.: Generalized Hirsch h-index for disclosing latent facts in citation networks. Scientometrics 72 (2), 253–280 (2007)

    Article  Google Scholar 

  4. Egghe, L.: Theory and practise of the g-index. Scientometrics 69, 131 (2013)

    Article  Google Scholar 

  5. Bras-Amoras, M., Domingo-Ferrer, J., Torra, V.: A bibliometric index based on the collaboration distance between cited and citing authors. J. Informet. 5 (2), 248–264 (2011)

    Article  Google Scholar 

  6. Zhang, C.-T.: The e-index, complementing the h-index for excess citations. PLoS ONE 4 (5), e5429 (2009). doi:10.1371/journal.pone.0005429

    Article  ADS  Google Scholar 

  7. Li, X.-L., Foo, C.S., Tew, K.L., Ng, S.-K.: Searching for rising stars in bibliography networks. Database Syst. Adv. Appl. 5463, 288–292 (2009)

    Article  Google Scholar 

  8. Ke, Q., Ferrara, E., Radicchi, F., Flammini, A.: Defining and identifying sleeping beauties in science. Proc. Natl. Acad. Sci. U. S. A. 16, 7426–7431 (2015)

    Article  ADS  Google Scholar 

  9. Chen, P., Xie, H., Maslov, S., Redner, S.: Finding scientific gems with Google. J. Informet. 1, 8–15 (2006). doi:10.1016/j.joi.2006.06.001

    Article  Google Scholar 

  10. Newman, M.E.J.: The first-mover advantage in scientific publication. Europhys. Lett. 86 (6), 68001 (2009)

    Article  ADS  Google Scholar 

  11. Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30 (1–7), 107–117 (1998)

    Article  Google Scholar 

  12. Krapivin, M., Marchese, M.: Focused PageRank in scientific papers ranking. In: Digital Libraries: Universal and Ubiquitous Access to Information, pp. 144–53. Springer, Berlin/Heidelberg (2008)

    Google Scholar 

  13. Walker, D., Xie, H., Yan, K.-K., Maslov, S.: Ranking scientific publications using a simple model of network traffic. J. Stat. Mech. 0706, P06010 (2007)

    Google Scholar 

  14. Radicchi, F., Fortunato, S., Markines, B., Vespignani, A.: Diffusion of scientific credits and the ranking of scientists. Phys. Rev. E 80, 056103 (2009). doi:10.1103/PhysRevE.80.056103

    Article  ADS  Google Scholar 

  15. Ghosh, R., Kuo, T.-T., Hsu, C.-N., Lin, S.-D., Lerman, K.: Time-aware ranking in dynamic citation networks. In: Proceedings of the 2011 IEEE 11th International Conference on Data Mining Workshops, pp. 373–380 (2011). doi:10.1109/ICDMW.2011.183

    Google Scholar 

  16. Yao, L., Wei, T., Zeng, A., Fan, Y., Di, Z.: Ranking scientific publications: the effect of nonlinearity. Sci. Rep. 4, Art:6683 (2014). doi:10.1038/srep06663

    Google Scholar 

  17. Newman, M.E.J.: Prediction of highly cited papers. Europhys. Lett. 105, 28002 (2014)

    Article  ADS  Google Scholar 

  18. de Solla Price, D.J.: Networks of scientific papers. Science 149, 510–515 (1965)

    Article  ADS  Google Scholar 

  19. de Solla Price, D.J.: A general theory of bibliometric and other cumulative advantage processes. J. Am. Soc. Inf. Sci. 27, 292–306 (1976)

    Article  Google Scholar 

  20. Barabasi, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999). doi:10.1126/science.286.5439.509

    Article  ADS  MathSciNet  MATH  Google Scholar 

  21. Medo, M., Cimini, G., Gualdi, S.: Temporal effects in the growth of networks. Phys. Rev. Lett. 107, 238701 (2011). doi:10.1103/PhysRevLett.107.238701

    Article  ADS  Google Scholar 

  22. Eom, Y.-H., Fortunato, S.: Characterizing and modeling citation dynamics. PLoS One 6, e24926 (2011)

    Article  ADS  Google Scholar 

  23. Wang, D., Song, C., Barabasi, A.-L.: Quantifying long-term scientific impact. Science 342, 127–132 (2013)

    Article  ADS  Google Scholar 

  24. Sayyadi, H., Getoor, L.: FutureRank: ranking scientific articles by predicting their future PageRank. In: SIAM International Conference on Data Mining SDM09 (2009)

    Google Scholar 

  25. Redner, S.: Citation statistics from 110 years of physical review. Phys. Today 58, 49 (2005)

    Google Scholar 

  26. Penner, R.: Programming Macromedia Flash MX. Dynamic Visuals, Part 3. Osborne, Berkeley (2002). ISBN13:978-0072223569, ISBN10:0072223561, http://robertpenner.com/easing/

  27. Bressan, M., Peserico, E., Pretto, L.: Approximating PageRank locally with sublinear query complexity. ArXiV (2014)

    Google Scholar 

  28. Borgs, C., Brautbar, M., Chayes, J., Teng, S.-H.: Multi-scale matrix sampling and sublinear-time PageRank computation. Internet Math. (2013). doi:10.1007/978-3-642-30541-2_4

  29. Waumans, M., Bersini, H.: Genealogical trees of scientific papers. Plos One (2016). doi:10.1371/journal.pone.0150588

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michaël Waumans .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Waumans, M., Bersini, H. (2017). Ranking Scientific Papers on the Basis of Their Citations Growing Trend. In: Shmueli, E., Barzel, B., Puzis, R. (eds) 3rd International Winter School and Conference on Network Science . NetSci-X 2017. Springer Proceedings in Complexity. Springer, Cham. https://doi.org/10.1007/978-3-319-55471-6_8

Download citation

Publish with us

Policies and ethics