ConsRank2.1.5 package

Compute the Median Ranking(s) According to the Kemeny's Axiomatic Approach

BBFULL

Branch-and-Bound algorithm to find the median ranking in the space of ...

combinpmatr

Combined input matrix of a data set

ConsRank-deprecated

Deprecated functions in ConsRank

ConsRank-package

Median Ranking Approach According to the Kemeny's Axiomatic Approach

consrank

Branch-and-bound and heuristic algorithms to find consensus (median) r...

DECOR

Differential Evolution algorithm for Median Ranking

EMCons

Branch-and-bound algorithm to find consensus (median) ranking accordin...

FASTcons

FAST algorithm to find consensus (median) ranking.FAST algorithm to fi...

FASTDECOR

FAST algorithm calling DECOR

iw_kemenyd

Item-weighted Kemeny distance

iw_tau_x

Item-weighted TauX rank correlation coefficient

iwcombinpmatr

Item-weighted Combined input matrix of a data set

iwquickcons

The item-weighted Quick algorithm to find up to 4 solutions to the con...

kemenyd

Kemeny distance

kemenydesign

Auxiliary function

kemenyscore

Score matrix according Kemeny (1962)

labels

Transform a ranking into a ordering.

order2rank

Given an ordering, it is transformed to a ranking

partitions

Generate partitions of n items constrained into k non empty subsets

polyplot

Plot rankings on a permutation polytope of 3 o 4 objects containing al...

QuickCons

Quick algorithm to find up to 4 solutions to the consensus ranking pro...

rank2order

Given a rank, it is transformed to a ordering

reordering

Given a vector (or a matrix), returns an ordered vector (or a matrix w...

scorematrix

Score matrix according Emond and Mason (2002)

stirling2

Stirling numbers of the second kind

tabulaterows

Frequency distribution of a sample of rankings

tau_x

TauX (tau exstension) rank correlation coefficient

univranks

Generate the universe of rankings

Compute the median ranking according to the Kemeny's axiomatic approach. Rankings can or cannot contain ties, rankings can be both complete or incomplete. The package contains both branch-and-bound algorithms and heuristic solutions recently proposed. The searching space of the solution can either be restricted to the universe of the permutations or unrestricted to all possible ties. The package also provide some useful utilities for deal with preference rankings, including both element-weight Kemeny distance and correlation coefficient. This release declare as deprecated some functions that are still in the package for compatibility. Next release will not contains these functions. Please type '?ConsRank-deprecated' Essential references: Emond, E.J., and Mason, D.W. (2002) <doi:10.1002/mcda.313>; D'Ambrosio, A., Amodio, S., and Iorio, C. (2015) <doi:10.1285/i20705948v8n2p198>; Amodio, S., D'Ambrosio, A., and Siciliano R. (2016) <doi:10.1016/j.ejor.2015.08.048>; D'Ambrosio, A., Mazzeo, G., Iorio, C., and Siciliano, R. (2017) <doi:10.1016/j.cor.2017.01.017>; Albano, A., and Plaia, A. (2021) <doi:10.1285/i20705948v14n1p117>.