1 / 5

Problem Addressed

Problem Addressed. Attempts to prove that Web Crawl is random & biased image of Web Graph and does not assert properties of Web Graph Understanding the Hyperlink structure has allowed the design of Algorithms like PageRank, HITS etc. Approach.

synclair
Download Presentation

Problem Addressed

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Problem Addressed • Attempts to prove that Web Crawl is random & biased image of Web Graph and does not assert properties of Web Graph • Understanding the Hyperlink structure has allowed the design of Algorithms like PageRank, HITS etc

  2. Approach • Generally authors use sociological hypothesis to model the web graphs & compare the graphs with existing crawls • This paper attempts to model the web crawling process using only Zipf’s law but arrive at results comparable to existing web graph models.

  3. Criticism • Uses Zipf’s law to model the crawling process, but also uses Zipf’s law in evaluation • Most of the evaluation criteria used are commonly observed in graphs following Zipf’s law • Concludes that Web Crawls are different from Web Graphs without proving it

  4. Relation to Course • Closely related to Social Networks as it discusses Zipf’s law, Small World Phenomenon, A/H, Page Ranks etc. • Related to the study of Crawlers

More Related