Learn R Programming

RankAggregator (version 0.0.1)

Aggregation of (Partial) Ordinal Rankings

Description

Easily compute an aggregate ranking (also called a median ranking or a consensus ranking) according to the axiomatic approach presented by Cook et al. (2007). This approach minimises the number of violations between all candidate consensus rankings and all input (partial) rankings, and draws on a branch and bound algorithm and a heuristic algorithm to drastically improve speed. The package also provides an option to bootstrap a consensus ranking based on resampling input rankings (with replacement). Input rankings can be either incomplete (partial) or complete. Reference: Cook, W.D., Golany, B., Penn, M. and Raviv, T. (2007) .

Copy Link

Version

Install

install.packages('RankAggregator')

Monthly Downloads

183

Version

0.0.1

License

GPL-3

Maintainer

Jay Burns

Last Published

August 31st, 2020

Functions in RankAggregator (0.0.1)

lowerBound

Lower bound value
consensusRankingBoot

Rank aggregation of partial rankings with optonal bootstrapping
evaluationMatrix

Evaluation matrix
RankAggregator

RankAggregator
consensusRanking

Rank aggregation of partial rankings
cook_example

Example data: partial rankings
upperBound

Upper bound value
extendRanking

Fully extend a partial ranking