Show simple item record

dc.contributor.authorSalarinezhad, Asefeh
dc.date.accessioned2015-08-27T17:39:08Z
dc.date.available2015-08-27T17:39:08Z
dc.identifier.urihttp://hdl.handle.net/10464/7086
dc.description.abstractIn 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.en_US
dc.language.isoengen_US
dc.publisherBrock Universityen_US
dc.subjectPageRanken_US
dc.subjectDictionary Graphsen_US
dc.subjectDynamic Graphsen_US
dc.titleUsing PageRank Algorithm in Analyzing Dictionary Graphs and PageRank in Dynamic Graphsen_US
dc.typeElectronic Thesis or Dissertationen_US
dc.degree.nameM.Sc. Mathematics and Statisticsen_US
dc.degree.levelMastersen_US
dc.contributor.departmentDepartment of Mathematicsen_US
dc.degree.disciplineFaculty of Mathematics and Scienceen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record