, Volume 76, Issue 1, pp 135–158 | Cite as

PageRank for bibliographic networks

  • Dalibor FialaEmail author
  • François Rousselot
  • Karel Ježek


In this paper, we present several modifications of the classical PageRank formula adapted for bibliographic networks. Our versions of PageRank take into account not only the citation but also the co-authorship graph. We verify the viability of our algorithms by applying them to the data from the DBLP digital library and by comparing the resulting ranks of the winners of the ACM E. F. Codd Innovations Award. Rankings based on both the citation and co-authorship information turn out to be “better” than the standard PageRank ranking.


Digital Library Citation Network Award Winner SIGMOD Record Citation Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Balmin, A., Hristidis, V., Papakonstantinou, Y. (2004), ObjectRank: Authority-Based Keyword Search in Databases, Proc. 30th Int. Conf. Very Large Data Bases, Toronto, Canada, pp. 564–575.Google Scholar
  2. Bianchini, M., Gori, M., Scarselli, F. (2005), Inside PageRank, ACM Transactions on Internet Technology, 5(1): 92–128.CrossRefGoogle Scholar
  3. Bollen, J., Rodriquez, M. A., Van De Sompel, H. (2006), Journal status, Scientometrics, 69(3): 669–687.CrossRefGoogle Scholar
  4. Brin, S., Page, L. (1998), The Anatomy of a Large-Scale Hypertextual Web Search Engine, Proc. 7th World Wide Web Conference, pp. 107–117.Google Scholar
  5. Cunningham, S. J., Dillon, S. M. (1997), Authorship patterns in information systems, Scientometrics, 39(1): 19–27.CrossRefGoogle Scholar
  6. Elmacioglu, E., Lee, D. (2005), On six degrees of separation in DBLP-DB and more, SIGMOD Record, 34(2): 33–40.CrossRefGoogle Scholar
  7. Langville, A. N., Meyer, C. D. (2003), Deeper inside PageRank, Internet Mathematics, 1(3): 335–380.MathSciNetGoogle Scholar
  8. Liu, X., Bollen, J., Nelson, M. L., Van De Sompel, H. (2005), Co-authorship networks in the digital library research community, Information Processing and Management, 41(6): 1462–1480.CrossRefGoogle Scholar
  9. Nascimento, M. A., Sander, J., Pound, J. (2003), Analysis of SIGMOD’s co-authorship graph, SIGMOD Record, 32(3): 8–10.CrossRefGoogle Scholar
  10. Otte E., Rousseau R. (2002), Social network analysis: a powerful strategy, also for the information sciences, Journal of Information Science, 28(6): 441–453.CrossRefGoogle Scholar
  11. Rahm, E., Thor, A. (2005), Citation analysis of database publications, SIGMOD Record, 34(4): 48–53.CrossRefGoogle Scholar
  12. Sidiropoulos, A., Manolopoulos, Y. (2005), A citation-based system to assist prize awarding, SIGMOD Record, 34(4): 54–60.CrossRefGoogle Scholar
  13. Sidiropoulos, A., Manolopoulos, Y. (2006), A Generalized comparison of graph-based ranking algorithms for publications and authors, Journal of Systems and Software, 79(12): 1679–1700.CrossRefGoogle Scholar
  14. Wagner, C., Leydesdorff, L. (2003), Mapping global science using international co-authorships: A comparison of 1990 and 2000, Proc. 9th Int. Conf. Scientometrics and Informetrics, Dalian, China, pp. 330–340.Google Scholar
  15. Xing, W., Ghorbani, A. (2004), Weighted PageRank algorithm, Proc. 2nd Conf. Communication Networks and Services Research, Fredericton, Canada, pp. 305–314.Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2008

Authors and Affiliations

  • Dalibor Fiala
    • 1
    • 2
    Email author
  • François Rousselot
    • 2
  • Karel Ježek
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of West Bohemia in PilsenPlzeňCzech Republic
  2. 2.INSAStrasbourgFrance

Personalised recommendations