Description Usage Arguments Details Value Author(s) References See Also Examples
de Vries' I&SI ranking
1 |
mat |
square interaction matrix with winner in rows and losers in columns |
runs |
numeric, number of iterations, by default |
printmessages |
logical, should the number of I and SI be printed (as well as a message if there is more than one solution). By default |
The number of interations is set substantially higher than what was suggested in the de Vries' 1998 paper, because my algorithm here is less efficient.
The I&SI algorithm (c.f. de Vries 1998) does not necessarily result in a unique order (see example below). If such a case occurs, all (equally good) solutions are returned as a list.
a list with the best possible matrix (or matrices if there is more than one best solution)
Christof Neumann
de Vries, H. 1998. Finding a dominance order most consistent with a linear hierarchy: a new procedure and review. Animal Behaviour, 55, 827-843. (DOI: 10.1006/anbe.1997.0708)
1 2 3 4 5 6 7 8 9 10 11 12 13 | ## Not run:
data(devries98, package = "EloRating")
hindex(devries98)
ISI(devries98)
##
data(adv, package = "EloRating")
SEQ <- elo.seq(winner=adv$winner, loser=adv$loser, Date=adv$Date)
mat <- creatematrix(SEQ)
res <- ISI(mat)
# note that this matrix is not sufficiently linear to justify such ordering
hindex(mat)
## End(Not run)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.