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.
KeywordsDigital Library Citation Network Award Winner SIGMOD Record Citation Graph
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- Xing, W., Ghorbani, A. (2004), Weighted PageRank algorithm, Proc. 2nd Conf. Communication Networks and Services Research, Fredericton, Canada, pp. 305–314.Google Scholar