
Calculate ratings and provide rankings using Google's PageRank algorithm
markov(
jpMat,
method = "markovvl",
dampingFactor = 0.85,
ties.method = "average"
)
a Judge-Presenter matrix, or a User-Movie matrix
a character string specifying Markov's method, including "markov", "markovvl", "markovlvpd", "markovwlvp".
the PageRank theory holds that an imaginary surfer who is randomly clicking on links will eventually stop clicking. The probability, at any step, that the person will continue is a damping factor. Web 0.85, NFL 0.60, NCAA basketball 0.50
a character string specifying how ties are treated, including "average", "first", "last", "random", "max", "min", from base::rank
markov
: Markov's method, voting with losses, equivalent to markovvl
markovvl
: Markov's method, voting with losses
markovlvpd
: Markov's method, losers vote with point differentials
markovwlvp
: Markov's method, winners and losers vote with points
Brin, S. and Page, L. (1998). The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems 30, 107-117. Proceedings of the Seventh International World Wide Web Conference.
Gou, J. and Wu, S. (2020). A Judging System for Project Showcase: Rating and Ranking with Incomplete Information. Technical Report.
Langville, A. N. and Meyer, C. D. (2012). Who's Number 1?: The Science of Rating and Ranking. Princeton University Press.
# NOT RUN {
jpMat <- matrix(data=c(5,4,3,0, 5,5,3,1, 0,0,0,5, 0,0,2,0, 4,0,0,3, 1,0,0,4),
nrow=6,
byrow=TRUE)
result <- markov(jpMat,
method='markovvl',
dampingFactor=0.85,
ties.method='average')
print(result)
# }
Run the code above in your browser using DataLab