QuickCons {ConsRank} | R Documentation |
The Quick algorithm finds up to 4 solutions. Solutions reached are most of the time optimal solutions.
QuickCons(X, Wk = NULL, FULL = FALSE, PS = FALSE)
X |
A N by M data matrix in which there are N judges and M objects to be judged. Each row is a ranking of the objects which are represented by the columns. Alternatively X can contain the rankings observed only once in the sample. In this case the argument Wk must be used |
Wk |
Optional: the frequency of each ranking in the data |
FULL |
Default FULL=FALSE. If FULL=TRUE, the searching is limited to the space of full rankings. |
PS |
Default PS=FALSE. If PS=TRUE the number of evaluated branches is diplayed |
This function is deprecated and it will be removed in the next release of the package. Use function 'consrank' instead.
a "list" containing the following components:
Consensus | the Consensus Ranking | |
Tau | averaged TauX rank correlation coefficient | |
Eltime | Elapsed time in seconds |
Antonio D'Ambrosio antdambr@unina.it
Amodio, S., D'Ambrosio, A. and Siciliano, R. (2016). Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach. European Journal of Operational Research, 249(2), 667-676.
data(EMD)
CR=QuickCons(EMD[,1:15],EMD[,16])