
PageRank for bibliographic networks
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.
The available full text is a preprint of the article.
Keywords: Ranking algorithms, bibliographic networks, citations, co-authorships, authorities, bibliographic PageRank
Year: 2008

Authors of this publication:

Dalibor Fiala
Phone: +420 377 63 2429
E-mail: dalfia@kiv.zcu.cz
WWW: http://www.kiv.zcu.cz/~dalfia/

François Rousselot
E-mail: francois.rousselot@insa-strasbourg.fr

Karel Ježek
Phone: +420 377632475
E-mail: jezek_ka@kiv.zcu.cz
WWW: https://cs.wikipedia.org/wiki/Karel_Je%C5%BEek_(informatik)
Related Projects:

Extracting Information from Web Content and Structure | |
Authors: | Dalibor Fiala, Roman Tesař, Karel Ježek |
Desc.: | This project deals with classification of Web documents and determination of authoritative Web sites. It was supported in part by the Ministry of Education of the Czech Republic under grant FRVS 1347/2005/G1. |

Social Networks Analysis | |
Authors: | Karel Ježek, Dalibor Fiala, Michal Nykl |
Desc.: | Application of the PageRank algorithm and its modifications to the exploration of network structures, particularly citation and co-autorship networks. |