Description Usage Arguments Value Author(s) References See Also Examples

View source: R/ALL.r View source: R/FASTcons.R

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.

1 |

`X` |
is a ranking data matrix |

`Wk` |
is a vector of weights |

`maxiter` |
maximum number of iterations: default = 50. |

`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 current iteration is diplayed |

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] and Sonia Amodio [email protected]

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.

`EMCons`

Emond and Mason branch-and-bound algorithm.

`QuickCons`

Quick algorithm.

1 2 3 4 5 6 7 8 |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.