Spearman

Spearman's footrule is a measure for distance between ranked lists. It is given as the sum of absolute differences between ranks of two lists. Here a modified version is implemented that allows for comparing partial lists.

For multiple ranked input lists (full or partial) representing the same set of N objects, the package 'TopKLists' <doi:10.1515/sagmb-2014-0093> offers (1) statistical inference on the lengths of informative top-k lists, (2) stochastic aggregation of full or partial lists, and (3) graphical tools for the statistical exploration of input lists, and for the visualization of aggregation results. Note that RGtk2 and gWidgets2RGtk2 have been archived on CRAN. See <https://github.com/pievos101/TopKLists> for installation instructions.

Bastian Pfeifer

TopKLists

Inference, Aggregation and Visualization for Top-K Ranked Lists

Spearman function

<dl> <dt>rank.a</dt>
<dd>A single top-k list</dd> <dt>rank.b</dt>
<dd>A vector of matrix form of top-k list(s) to be compared to the list <code>a</code></dd> <dt>k.a</dt>
<dd>Value of <code>k</code> for <code>rank.a</code></dd> <dt>k.b</dt>
<dd>Value of <code>k</code> for <code>rank.b</code></dd> <dt>n</dt>
<dd>Total number of objects, numbered from 1 to n</dd></dl>

Arguments

Jie Ding &lt;jding@jimmy.harvard.edu&gt;

Author

Modified Spearman's footrule distance — Spearman

<dl>

 <dt>rank.a</dt>
<dd>A single top-k list</dd>

 <dt>rank.b</dt>
<dd>A vector of matrix form of top-k list(s) to be compared to the list <code>a</code></dd>

 <dt>k.a</dt>
<dd>Value of <code>k</code> for <code>rank.a</code></dd>

 <dt>k.b</dt>
<dd>Value of <code>k</code> for <code>rank.b</code></dd>

 <dt>n</dt>
<dd>Total number of objects, numbered from 1 to n</dd>

</dl>

Spearman: Modified Spearman's footrule distance

Description

Usage

Value

Arguments

Author

See Also

Examples