Analysis of Navigability Propertie of the Web-Graph

Student: Drozhilkin Igor

Faculty: Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod)

Educational Programme: Applied Mathematics and Information Science (Master)

Final Grade: 9

Year of Graduation: 2016

The main purpose of this paper was to check how close is Web to the structure of Close Navigable graph. Close Navigable Graph - graph, where any given node can be found starting from any random node using only local information. In this paper nodes of the graph are web pages, local information – text on web page. We wanted to simulate whether it is possible for implemented greedy local search to find a given web page, by using tf-idf transformation and cosine similarity as metric to move in starting node neighborhood. We want to gather statistics of successful search and investigate whether it is possible to use such heuristics to navigate the Web.

Full text (added June 3, 2016)

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses