We give two efficient algorithms for computing distances between partial rankings (i.e. rankings with ties). Given two partial rankings over n elements, and with b and c equivalence classes, respectively, our first algorithm runs in O(n log n/ log log n) time, and the second in O(n log min{b, c}) time.

Data fusion is the name given to a range of methods for combining multiple sources of evidence. This mini-review summarizes the use of one such class of methods for combining the rankings obtained when similarity searching is used for ligand-based virtual screening. Two main approaches are described: similarity fusion involves combining rankings from single searches based on multiple similarity...

While it is troubling when power index values change with the index, the problem is more severe; different indices can generate radically different rankings; e.g., a 15-player game exists with over a trillion different strict index rankings of the players. In contrast, for each number of players certain indices always share the same ranking; e.g., the Shapley and Banzhaf rankings agree with thr...

We propose a framework for predicting the ranking position of a Web page based on previous rankings. Assuming a set of successive top-k rankings, we learn predictors based on different methodologies. The prediction quality is quantified as the similarity between the predicted and the actual rankings. Extensive experiments were performed on real world large scale datasets for global and query-ba...

Academic rankings mediate between the differing goals of the “republic of science” and of “new public management”. Nevertheless, rankings recently have come under scrutiny. We discuss the advantages and disadvantages of academic rankings, in particular, their unintended negative consequences on the research process, and conclude that academic rankings do not fulfil their intended goal. We discu...

We need to reason about rankings of objects in a wide variety of domains including information retrieval, sports tournaments, bibliometrics, and statistics. We propose a global constraint therefore for modeling rankings. One important application for rankings is in reasoning about the correlation or uncorrelation between sequences. For example, we might wish to have consecutive delivery schedul...