Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Comparing paper ranking algorithms
Dunaiski M., Visser W.  SAICSIT 2012 (Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference, Pretoria, South Africa, Oct 1-3, 2012)21-30.2012.Type:Proceedings
Date Reviewed: Dec 27 2012

Paper rankings are becoming increasingly important to those in the scientific community, who use these measures to get an overall idea of the impact of their research. More importantly, their use is widespread on Web sites that use citations as a reference for ranking scientific work. As a result, institutions and academia are getting more and more interested in these measures. One of the most widespread measures is the citation count. For example, the h-index is based on the number of citations received. Originally suggested by J. E. Hirsch, this formula ranks the scientific productivity of researchers. Other measures attempt to measure the impact of papers.

Focused on the second goal, this paper provides an intuitive and easy-to-follow description of the main algorithms used to rank papers, including PageRank, CiteRank, and YetRank. The authors introduce a new ranking algorithm, NewRank, which aims to overcome the main drawbacks of CiteRank.

The authors begin with a thorough overview of the architecture of the system they built to conduct the experimental evaluation. Lacking a formal repository that could be used to make comparisons among algorithms, the authors retrieve the whole citation graph from Microsoft Academic Search. Given that these computations are lengthy, the study is restricted to the computer science domain. The algorithms mentioned above are also compared with the simple citation count. Surprisingly, the citation count performs very well when compared to the other ranking measures. Also, NewRank improves on CiteRank and shows promising performance over the other ranking methods.

Reviewer:  Carlos Linares Lopez Review #: CR140780 (1303-0253)
Bookmark and Share
  Reviewer Selected
Editor Recommended
 
 
Graph Algorithms (G.2.2 ... )
 
 
Information Filtering (H.3.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Graph Algorithms": Date
Planar graph decomposition and all pairs shortest paths
Frederickson G. (ed) Journal of the ACM 38(1): 162-204, 1991. Type: Article
Oct 1 1991
High probability parallel transitive-closure algorithms
Ullman J., Yannakakis M. SIAM Journal on Computing 20(1): 100-125, 1991. Type: Article
Dec 1 1991
Clique partitions, graph compression and speeding-up algorithms
Feder T., Motwani R.  Theory of computing (, New Orleans, LA, May 6-8, 1991)1331991. Type: Proceedings
Oct 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy