[-] Show simple item record

dc.contributor.advisorZhuang, Xinhuaeng
dc.contributor.authorZhou, Zhieng
dc.date.issued2015eng
dc.date.submitted2015 Falleng
dc.description.abstractPageRank is one of the principle ranking algorithms. This method is interpreted as a frequency of visit. As the number of web pages increasing dramatically, the time to finish updating takes longer. Alternatively, Monte Carlo method provides good estimation of the PageRank for relatively important pages after simulating random walks. The Monte Carlo score is calculated as the visited times to the particular page verses the total number of visited pages during the random walks. This estimation can be used as the initial vector for the Power Iteration. This process takes less iteration numbers than the original PageRank to converge. Then the time for the entire ranking procedure is reduced. Using Monte Carlo method together with the Power Iteration in web ranking is feasible.eng
dc.identifier.urihttps://hdl.handle.net/10355/48634
dc.languageEnglisheng
dc.publisherUniversity of Missouri--Columbiaeng
dc.relation.ispartofcommunityUniversity of Missouri--Columbia. Graduate School. Theses and Dissertationseng
dc.sourceSubmitted to MOspace by University of Missouri--Columbia Graduate Studies.eng
dc.titleEvaluation of Monte Carlo method in PageRankeng
dc.typeThesiseng
thesis.degree.disciplineComputer science (MU)eng
thesis.degree.grantorUniversity of Missouri--Columbiaeng
thesis.degree.levelMasterseng
thesis.degree.nameM.S.eng


Files in this item

[PDF]
[PDF]
[PDF]

This item appears in the following Collection(s)

[-] Show simple item record