Approximation of relative rank probabilities
Approximate relative rank probabilities P(rk(u)<rk(v)). In a network context, P(rk(u)<rk(v)) is the probability that u is less central than v, given the partial ranking P.
approx_rank_relative(P, iterative = TRUE, num.iter = 10)
P |
A partial ranking as matrix object calculated with neighborhood_inclusion or positional_dominance. |
iterative |
Logical scalar if iterative approximation should be used. |
num.iter |
Number of iterations to be used. defaults to 10 (see Details). |
The iterative approach generally gives better approximations
than the non iterative, if only slightly. The default number of iterations
is based on the observation, that the approximation does not improve
significantly beyond this value. This observation, however, is based on
very small networks such that increasing it for large network may yield
better results. See vignette("benchmarks",package="netrankr") for more details.
a matrix containing approximation of mutual rank probabilities.
relative.rank[i,j] is the probability that i is ranked lower than j
David Schoch
De Loof, K. and De Baets, B and De Meyer, H., 2008. Properties of mutual rank probabilities in partially ordered sets. In Multicriteria Ordering and Ranking: Partial Orders, Ambiguities and Applied Issues, 145-165.
P <- matrix(c(0,0,1,1,1,0,0,0,1,0,0,0,0,0,1,rep(0,10)),5,5,byrow=TRUE) P approx_rank_relative(P,iterative = FALSE) approx_rank_relative(P,iterative = TRUE)
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.