Title
Novel approaches to crawling important pages early.
Abstract
Abstract Web crawlers are essential to many Web applications, such as Web search engines, Web archives, and Web directories, which maintain Web pages in their local repositories. In this paper, we study the problem of crawl scheduling that biases crawl ordering toward important pages. We propose a set of crawling algorithms for effective and efficient crawl ordering by prioritizing important pages with the well-known PageRank as the importance metric. In order to score URLs, the proposed algorithms utilize various features, including partial link structure, inter-host links, page titles, and topic relevance. We conduct a large-scale experiment using publicly available data sets to examine the effect of each feature on crawl ordering and evaluate the performance of many algorithms. The experimental results verify the efficacy of our schemes. In particular, compared with the representative RankMass crawler, the FPR-title-host algorithm reduces computational overhead by a factor as great as three in running time while improving effectiveness by 5 % in cumulative PageRank.
Year
DOI
Venue
2012
10.1007/s10115-012-0535-4
Knowl. Inf. Syst.
Keywords
Field
DocType
Web crawler,Crawl ordering,PageRank,Fractional PageRank
PageRank,Data mining,Overhead (computing),Crawling,Web page,Information retrieval,Scheduling (computing),Computer science,Focused crawler,Web application,Web crawler
Journal
Volume
Issue
ISSN
33
3
0219-3116
Citations 
PageRank 
References 
5
0.44
33
Authors
3
Name
Order
Citations
PageRank
Md. Hijbul Alam1263.88
JongWoo Ha2556.79
Sangkeun Lee349865.59