Sciweavers

Share
ADMA
2009
Springer

Crawling Deep Web Using a New Set Covering Algorithm

10 years 4 months ago
Crawling Deep Web Using a New Set Covering Algorithm
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This can be modeled as a set covering problem which has been extensively studied. The conventional set covering algorithms, however, do not work well when applied to deep web crawling due to various special features of this application domain. Typically, most set covering algorithms assume the uniform distribution of the elements being covered, while for deep web crawling, neither the sizes of documents nor the document frequencies of the queries is distributed uniformly. Instead, they follow the power law distribution. Hence, we have developed a new set covering algorithm that targets at web crawling. Compared to our previous deep web crawling method that uses a straightforward greedy set covering algorithm, it introduces weights into the greedy strategy. Our experiment carried out on a variety of corpora shows tha...
Yan Wang, Jianguo Lu, Jessica Chen
Added 25 May 2010
Updated 25 May 2010
Type Conference
Year 2009
Where ADMA
Authors Yan Wang, Jianguo Lu, Jessica Chen
Comments (0)
books