BBFULL: Branch-and-Bound algorithm to find the median ranking in the...

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

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

Description

Branch-and-bound algorithm to find consensus ranking as defined 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

Usage

BBFULL(X, Wk = NULL, PS = TRUE)

Arguments

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. 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
Wk	Optional: the frequency of each ranking in the data
PS	If PS=TRUE, on the screen some information about how many branches are processed are displayed

Details

This function is deprecated and it will be removed in the next release of the package. Use function 'consrank' instead.

If the objects to be ranked is large (>25 - 30), it can take long time to find the solutions

Value

a "list" containing the following components:

Consensus		the Consensus Ranking
Tau		averaged TauX rank correlation coefficient
Eltime		Elapsed time in seconds

Author(s)

Antonio D'Ambrosio [e-mail]

References

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.

See Also

consrank

Examples

#data(APAFULL)
#CR=BBFULL(APAFULL)

ConsRank documentation built on March 31, 2023, 7:25 p.m.