Using PageRank Algorithm in Analyzing Dictionary Graphs and PageRank in Dynamic Graphs
Contribuinte(s) |
Department of Mathematics |
---|---|
Data(s) |
27/08/2015
27/08/2015
|
Resumo |
In this thesis we are going to analyze the dictionary graphs and some other kinds of graphs using the PagerRank algorithm. We calculated 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 some artificial social and random graphs. We found that when we omitted some random nodes from each of the graphs, we have not noticed any significant changes in the ranking of the nodes according to their PageRank. We also discovered that some social graphs selected for our study were less resistant to the changes of PageRank. |
Identificador | |
Idioma(s) |
eng |
Publicador |
Brock University |
Palavras-Chave | #PageRank #Dictionary Graphs #Dynamic Graphs |
Tipo |
Electronic Thesis or Dissertation |