Plot of the Kendall Criterion values of aggregate ranked lists; useful for comparing performances of several algorithms.

1 2 |

`input` |
A list object containing individual ranked lists. |

`all.aggregates` |
A list comprising of aggregate top- |

`space` |
A list containing the underlying spaces. If not explicitly specified, all lists are treated as coming from a common space defined by the union of all input lists. |

`algorithm` |
A vector listing the names corresponding to the algorithms used to construct the aggregate ranked lists all.aggregates. |

`p` |
A parameter between 0 and 1 for setting the distance of a pair of elements between two lists, if at least one of the elements is not in the underlying space of one of the list or if both elements belong to one list but neither belong
to the other list. (We recommend using |

`w` |
Weight vector assigned to the input list. Prior information on the reliability of each input list can be incorporated. The default is set to equal weight for each input list. |

`...` |
Other parameters passed on to the plot function. |

Compute the weighted Kendall's distance between each of the aggregate ranked list with the input ranked lists and plot the computed distances.

A plot of Kendall's distance for each of the aggregate list.

Shili Lin <shili@stat.osu.edu

`KendallMLists`

1 2 3 4 5 | ```
#get sample data
data(TopKSpaceSampleInput)
outMC=MC(input,space)
all.aggregate=list(outMC$MC1.TopK,outMC$MC2.TopK,outMC$MC3.TopK)
Kendall.plot(input, all.aggregate,space, algorithm=c("MC1","MC2","MC3"))
``` |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.