Description Usage Arguments Value Author(s)

Computes the sequential rank agreement (number of items present in all k lists divided by the current rank) for each rank in the k lists

1 | ```
sracpp(rankMat, maxlength, B, cens, type = 0L, epsilon = as.numeric(c(0)))
``` |

`rankMat` |
A matrix with k columns corresponding to the k ranked lists. Elements of each column are integers between 1 and the length of the lists |

`maxlength` |
The maximum depth that are needed XXX |

`B` |
The number of resamples to use in the presence of censored lists |

`cens` |
A vector of integer values that |

`type` |
The type of distance measure to use: 0 (the default) is the variance while 1 is MAD (median absolute deviation) |

`epsilon` |
A non-negative numeric vector that contains the minimum limit in proportion of lists that must show the item. Defaults to 0. If a single number is provided then the value will be recycles to the number of items. |

A vector of the same length as the rows in rankMat containing the squared (!) sequential rank agreement between the lists for each depth. If the MAD type was chosen then the sequential MAD values are returned

Claus Ekstrøm <ekstrom@sund.ku.dk>

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.