Learn R Programming

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

ConsRank (version 2.0.1)

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 package also provide some useful utilities for deal with preference rankings. 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) .

Copy Link

Version

Install

install.packages('ConsRank')

Monthly Downloads

4,846

Version

2.0.1

License

GPL-3

Maintainer

Antonio DAmbrosio

Last Published

April 28th, 2017

Functions in ConsRank (2.0.1)

BBconsensus2

Core function in computing consensus ranking as defined by Emond and Mason (2002)
BU

Brook and Upton data
APAFULL

American Psychological Association dataset, full version
APAred

American Psychological Association dataset, reduced version with only full rankings
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.
German

German political goals
DECORcore

Differential Evolution algorithm for Median Ranking
EMCons

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

Auxiliary function
Tau_X

TauX (tau exstension) rank correlation coefficient
ConsRank-package

Compute the Median Ranking According to the Kemeny's Axiomatic Approach
DECOR

Differential Evolution algorithm for Median Ranking
PenaltyBB2

Auxiliary function
QuickCons

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

Idea data set
Penalty

Auxiliary function
USAranks

USA rank data
branches

Auxliary code recalled by other routines
crossover

Apply the (binomial) crossover for DE algorithm
findbranches

Auxiliary function
scorematrix

Score matrix according Emond and Mason (2002)
sports

sports data
combincost

Auxiliary function called by DECORcore
combinpmatr

Combined input matrix of a data set
tabulaterows

Frequency distribution of a sample of rankings
kemenydesign

Auxiliary function
kemenyscore

Score matrix according Kemeny (1962)
BBFULL

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

Find a first ranking candidate to be the median ranking
kemenyd

Kemeny distance
labels

Transform a ranking into a ordering.
mutaterand1

Mutation phase
childclosint

Transform the vector into ranking for DECOR
BBconsensus

Find the first approximation to the consensus ranking. Most of the time the output is a solution, maybe not unique
EMD

Emond and Mason data
FASTDECOR

FAST algorithm calling DECOR
polyplot

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

Auxiliary function
reordering

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