upperBound

a vector of rank positions that is a candidate complete ranking

a <code>matrix</code>, which is either the output of <code><a rd-options="" href="/link/evaluationMatrix?package=RankAggregator&version=0.0.1" data-mini-rdoc="RankAggregator::evaluationMatrix">evaluationMatrix</a></code>,
or a subset of the output of <code><a rd-options="" href="/link/evaluationMatrix?package=RankAggregator&version=0.0.1" data-mini-rdoc="RankAggregator::evaluationMatrix">evaluationMatrix</a></code>.

umat

This function is called by <code><a rd-options="" href="/link/RankAggregator?package=RankAggregator&version=0.0.1" data-mini-rdoc="RankAggregator::RankAggregator">RankAggregator</a></code>::<code><a rd-options="" href="/link/consensusRanking?package=RankAggregator&version=0.0.1" data-mini-rdoc="RankAggregator::consensusRanking">consensusRanking</a></code>.
The upper bound value is the value used by the branch and bound
algorithm in determining whether or not to replace the current incumbent
solution.

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) <doi:10.1016/j.cor.2005.05.030>.

Jay Burns

RankAggregator

Aggregation of (Partial) Ordinal Rankings

Adam Butler

upperBound function

a <code>matrix</code>, which is either the output of <code><a rd-options='' href='evaluationMatrix'>evaluationMatrix</a></code>,
or a subset of the output of <code><a rd-options='' href='evaluationMatrix'>evaluationMatrix</a></code>.

This function is called by <code><a rd-options='' href='RankAggregator'>RankAggregator</a></code>::<code><a rd-options='' href='consensusRanking'>consensusRanking</a></code>.
The upper bound value is the value used by the branch and bound
algorithm in determining whether or not to replace the current incumbent
solution.

upperBound: Upper bound value

Description

Usage

Arguments

Value