dc.contributor.advisor | Pasik-Duncan, Bozenna | |
dc.contributor.author | Clifton, Cody Edward | |
dc.date.accessioned | 2015-12-03T00:03:30Z | |
dc.date.available | 2015-12-03T00:03:30Z | |
dc.date.issued | 2015-05-31 | |
dc.date.submitted | 2015 | |
dc.identifier.other | http://dissertations.umi.com/ku:14020 | |
dc.identifier.uri | http://hdl.handle.net/1808/19025 | |
dc.description.abstract | A key feature of modern web search engines is the ability to display relevant and reputable pages near the top of the list of query results. The PageRank algorithm provides one way of achieving such a useful hierarchical indexing by assigning a measure of relative importance, called the PageRank value, to each webpage. PageRank is motivated by the inherently hypertextual structure of the World Wide Web; specifically, the idea that pages with more incoming hyperlinks should be considered more popular and that popular pages should rank highly in search results, all other factors being equal. We begin by overviewing the original PageRank algorithm and discussing subsequent developments in the mathematical theory of PageRank. We focus on important contributions to improving the quality of rankings via topic-dependent or "personalized" PageRank, as well as techniques for improving the efficiency of PageRank computation based on Monte Carlo methods, extrapolation and adaptive methods, and aggregation methods We next present a model for PageRank whose dynamics are described by a controlled stochastic system that depends on an unknown parameter. The fact that the value of the parameter is unknown implies that the system is unknown. We establish strong consistency of a least squares estimator for the parameter. Furthermore, motivated by recent work on distributed randomized methods for PageRank computation, we show that the least squares estimator remains strongly consistent within a distributed framework. Finally, we consider the problem of controlling the stochastic system model for PageRank. Under various cost criteria, we use the least squares estimates of the unknown parameter to iteratively construct an adaptive control policy whose performance, according to the long-run average cost, is equivalent to the optimal stationary control that would be used if we had knowledge of the true value of the parameter. This research lays a foundation for future work in a number of areas, including testing the estimation and control procedures on real data or larger scale simulation models, considering more general parameter estimation methods such as weighted least squares, and introducing other types of control policies. | |
dc.format.extent | 139 pages | |
dc.language.iso | en | |
dc.publisher | University of Kansas | |
dc.rights | Copyright held by the author. | |
dc.subject | Mathematics | |
dc.subject | Applied mathematics | |
dc.subject | Adaptive Control | |
dc.subject | PageRank | |
dc.subject | Parameter Estimation | |
dc.subject | Stochastic System | |
dc.title | A Stochastic System Model for PageRank: Parameter Estimation and Adaptive Control | |
dc.type | Dissertation | |
dc.contributor.cmtemember | Duncan, Tyrone E. | |
dc.contributor.cmtemember | Evans, Joseph B. | |
dc.contributor.cmtemember | Talata, Zsolt | |
dc.contributor.cmtemember | Tu, Xuemin | |
dc.thesis.degreeDiscipline | Mathematics | |
dc.thesis.degreeLevel | Ph.D. | |
dc.rights.accessrights | openAccess | |