Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 157 for “"PageRank"”.
-
Using PageRank Algorithm in Analyzing Dictionary Graphs and PageRank in Dynamic Graphs
… the correlation between the degree and PageRank of all nodes for a graph obtained from Merriam-Webster dictionary, a French dictionary and WordNet hypernym and synonym dictionaries. Our conclusion was that PageRank can be a good tool to compare the quality of dictionaries. We studied …
-
Mathematics behind Google's PageRank algorithm
… engines. With its use of the algorithm it called PageRank, it retrieved search results that were much more relevant to the interests of its users. The PageRank algorithm works on the basic theory that the more important and useful a page is, the more other pages will link to it. Therefore a page …
-
Virtual web for PageRank computing
… has been demanding an even more efficient PageRank updating algorithm. Web evolution may involve two kinds: (1) link structure modification; (2) page insertion/deletion. When the web evolution is restricted to only link insertion/deletion, we demonstrate the benefit of using the previous …
-
Web Search Algorithms and PageRank
… underlying the Google search engine is the PageRank algorithm, first introduced by Sergey Brin and Lawrence Page, the founders of Google. A ranking of web pages is made considering many criteria. PageRank exploits the graph structure of the web. The web’s hyperlink structure forms a massive …
-
Improving automated fault localization using PageRank
… localization by differentiating tests using PageRank algorithm. Given the original program spectrum information, PRFL uses PageRank to recompute the spectrum information by considering the contributions of different tests. Then, traditional SBFL techniques can be applied on the recomputed …
-
Evaluation of Monte Carlo method in PageRank
PageRank 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 …
-
Local Graph Clustering Using l1-regularized PageRank Algorithms
… that the combination of Approximate Personalized PageRank (APPR) algorithm and sweep method can efficiently detect a small cluster around the starting vertex. This research explores the optimization framework proposed in the work by Fountoulakis et al., where a connection between the APPR and an …
-
Manipulation Of Pagerank And Collective Hidden Markov Models
… explores issues surrounding the manipulation of PageRank, a popular link-analysis based reputation system for the web. PageRank is an essential part of web search, but it is also subject to manipulation by selfish web authors. We develop an alternative to PageRank, based on expected hitting time …
-
Applications of Persistent Homology to Markov Chains and Pagerank
… and geometric embedding. In particular, Google's PageRank algorithm has revolutionized web search and many other applications involving social, biological, and technological networks. In this thesis, I design, develop and implement the TDA method of persistent homology for applications in network …
-
Fuzzy Markov Chains and Experiments with FuzzRank, an Alternative to PageRank
… in several situations, for example in the PageRank algorithm which powers Google search. In this thesis we study the foundations of fuzzy logic and Markov chains before introducing fuzzy Markov chains. Fuzzy Markov chains were introduced in 1970 as an alternative to the usual Markov chains …
-
The Non-Backtracking Spectrum of a Graph and Non-Bactracking PageRank
… Second, we investigate the difference between PageRank and non-backtracking PageRank. We show some instances where there is no difference and develop an algorithm to compare PageRank and non-backtracking PageRank under certain conditions using $\mu$-PageRank.
-
A Stochastic System Model for PageRank: Parameter Estimation and Adaptive Control
… 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 …
-
Será PageRank um algoritmo fidedigno para avaliar a credibilidade de um Website?
O PageRank é um algoritmo criado pelo Google para hierarquizar os websites em termos de credibilidade, ordenando-os assim por ordem do mais credível ao menos credível na sua base de dados e motor de busca da marca. O objectivo da presente investigação foi apurar, através de uma pesquisa profunda, …
-
O algoritmo PageRank aplicado a redes de recomendações para seleção de recursos humanos
… procura mostrar-se a aplicabilidade do algoritmo PageRank a redes de recomendações profissionais entre pares no âmbito de processos de recrutamento de recursos humanos. Assim, através de técnicas de data-mining, procedeu-se à extracção de dados de teste do conteúdo HTML de páginas de alguns …
-
Two Problems Involving Random Walks on Graphs: Random surfers, PageRank, and short-time asymptotics for the heat kernel
… graphs. We use the new framework to study the PageRank and show how it can be interpreted as a numerical scheme on a directed graph involving a type of normalized graph Laplacian. We show that the corresponding continuum limit problem, which is taken as the number of webpages grows to infinity, …
-
Webpage rank using Bayes' rule and connected components
… OF MISSOURI-COLUMBIA AT AUTHOR'S REQUEST.] The PageRank is one of the most famous link-structure based webpage ranking algorithm adopted by Google which measures the importance of the webpages by their probability of being visited. However, the bottleneck of the PageRank computing speed is the …
-
Community Detection in Complex Networks
… graph clustering method that uses heat kernel PageRank to efficiently find a local cluster in massive graphs. The heat kernel PageRank provides a quantitative ranking of nodes, and a local cluster is then found by performing a sweep over the heat kernel PageRank vector. But computing an exact …
Page 1 of 8