Learn R Programming

ConsRank (version 2.1.5)

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

Description

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) ; D'Ambrosio, A., Amodio, S., and Iorio, C. (2015) ; Amodio, S., D'Ambrosio, A., and Siciliano R. (2016) ; D'Ambrosio, A., Mazzeo, G., Iorio, C., and Siciliano, R. (2017) ; Albano, A., and Plaia, A. (2021) .

Copy Link

Version

Install

install.packages('ConsRank')

Monthly Downloads

4,846

Version

2.1.5

License

GPL-3

Maintainer

Antonio DAmbrosio

Last Published

April 15th, 2025

Functions in ConsRank (2.1.5)

iwcombinpmatr

Item-weighted Combined input matrix of a data set
QuickCons

Quick algorithm to find up to 4 solutions to the consensus ranking problem
kemenydesign

Auxiliary function
order2rank

Given an ordering, it is transformed to a ranking
labels

Transform a ranking into a ordering.
stirling2

Stirling numbers of the second kind
iw_kemenyd

Item-weighted Kemeny distance
kemenyd

Kemeny distance
iwquickcons

The item-weighted Quick algorithm to find up to 4 solutions to the consensus ranking problem
reordering

Given a vector (or a matrix), returns an ordered vector (or a matrix with ordered vectors)
rank2order

Given a rank, it is transformed to a ordering
tabulaterows

Frequency distribution of a sample of rankings
univranks

Generate the universe of rankings
partitions

Generate partitions of n items constrained into k non empty subsets
German

German political goals
kemenyscore

Score matrix according Kemeny (1962)
scorematrix

Score matrix according Emond and Mason (2002)
polyplot

Plot rankings on a permutation polytope of 3 o 4 objects containing all possible ties
tau_x

TauX (tau exstension) rank correlation coefficient
sports

sports data
ConsRank-package

Median Ranking Approach According to the Kemeny's Axiomatic Approach
ConsRank-deprecated

Deprecated functions in ConsRank
BU

Brook and Upton data
EMD

Emond and Mason data
APAred

American Psychological Association dataset, reduced version with only full rankings
DECOR

Differential Evolution algorithm for Median Ranking
iw_tau_x

Item-weighted TauX rank correlation coefficient
FASTcons

FAST algorithm to find consensus (median) ranking. FAST algorithm to find consensus (median) ranking defined by Amodio, D'Ambrosio and Siciliano (2016). It returns at least one of the solutions. If there are multiple solutions, sometimes it returns all the solutions, sometimes it returns some solutions, always it returns at least one solution.
APAFULL

American Psychological Association dataset, full version
USAranks

USA rank data
FASTDECOR

FAST algorithm calling DECOR
EMCons

Branch-and-bound algorithm to find consensus (median) ranking according to the Kemeny's axiomatic approach
consrank

Branch-and-bound and heuristic algorithms to find consensus (median) ranking according to the Kemeny's axiomatic approach
BBFULL

Branch-and-Bound algorithm to find the median ranking in the space of full (or complete) rankings.
Idea

Idea data set
combinpmatr

Combined input matrix of a data set