PageRank for bibliographic networks

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

Journal ISSN: 0138-9130
Download: download Full text [1710 kB]
View record in Web of Science®

Authors of this publication:

Dalibor Fiala


Dalibor is an associate professor at the Department of Computer Science and Engineering at the University of West Bohemia in Pilsen, Czech Republic. He is interested in web mining, information retrieval, and information science.

François Rousselot


François is interested in knowledge acquisition and computational linguistics.

Karel Ježek

Phone:  +420 377632475, 377632400

Karel is a group coordinator and a supervisor of PhD students working at research projects of this Group.

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.