Learn R Programming

⚠️There's a newer version (2.1.5) of this package.Take me there.

ConsRank (version 2.1.4)

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,904

Version

2.1.4

License

GPL-3

Maintainer

Antonio DAmbrosio

Last Published

January 24th, 2024

Functions in ConsRank (2.1.4)

consrank

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

Combined input matrix of a data set
univranks

Generate the universe of rankings
order2rank

Given an ordering, it is transformed to a ranking
partitions

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

Brook and Upton data
iwquickcons

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

TauX (tau exstension) rank correlation coefficient
iw_kemenyd

Item-weighted Kemeny distance
QuickCons

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

Auxiliary function
labels

Transform a ranking into a ordering.
kemenyscore

Score matrix according Kemeny (1962)
USAranks

USA rank data
rank2order

Given a rank, it is transformed to a ordering
kemenyd

Kemeny distance
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.
BBFULL

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

Score matrix according Emond and Mason (2002)
reordering

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

Item-weighted Combined input matrix of a data set
sports

sports data
German

German political goals
polyplot

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

Stirling numbers of the second kind
iw_tau_x

Item-weighted TauX rank correlation coefficient
tabulaterows

Frequency distribution of a sample of rankings
ConsRank-package

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

Deprecated functions in ConsRank
Idea

Idea data set
FASTDECOR

FAST algorithm calling DECOR
APAred

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

Emond and Mason data
EMCons

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

Differential Evolution algorithm for Median Ranking
APAFULL

American Psychological Association dataset, full version