Branch-and-bound algorithm to find consensus ranking as definned by D'Ambrosio et al. (2015). If the number of objects to be ranked is large (greater than 20 or 25), it can work for very long time. Use either QuickCons or FASTcons with the option FULL=TRUE instead
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. The data matrix can contain both full and tied rankings, or incomplete rankings. Alternatively X can contain the rankings observed only once. In this case the argument Wk must be used
Optional: the frequency of each ranking in the data
If PS=TRUE, on the screen some information about how many branches are processed are displayed
If the objects to be ranked is large (>25 - 30), it can take long time to find the solutions
a "list" containing the following components:
|Consensus||the Consensus Ranking|
|Tau||averaged TauX rank correlation coefficient|
|Eltime||Elapsed time in seconds|
Antonio D'Ambrosio [email protected]
D'Ambrosio, A., Amodio, S., and Iorio, C. (2015). Two algorithms for finding optimal solutions of the Kemeny rank aggregation problem for full rankings. Electronic Journal of Applied Statistical Analysis, 8(2), 198-213.
FASTcons FAST algorithm algorithm.
QuickCons Quick algorithm.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.