LIPIcs.STACS.2009.1809.pdf
- Filesize: 245 kB
- 18 pages
Document
A Comparison of Techniques for Sampling Web Pages
Authors
-
Part of:
Volume:
26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Theoretical Aspects of Computer Science (STACS) - License:
Creative Commons Attribution-NoDerivs 3.0 Unported license
- Publication Date: 2009-02-19
Cite AsGet BibTex
Eda Baykan, Monika Henzinger, Stefan F. Keller, Sebastian de Castelberg, and Markus Kinzler. A Comparison of Techniques for Sampling Web Pages. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 13-30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/LIPIcs.STACS.2009.1809
https://doi.org/10.4230/LIPIcs.STACS.2009.1809
Abstract
As the World Wide Web is growing rapidly, it is getting increasingly challenging to gather representative information about it. Instead of crawling the web exhaustively one has to resort to other techniques like sampling to determine the properties of the web. A uniform random sample of the web would be useful to determine the percentage of web pages in a specific language, on a topic or in a top level domain. Unfortunately, no approach has been shown to sample the web pages in an unbiased way. Three promising web sampling algorithms are based on random walks. They each have been evaluated individually, but making a comparison on different data sets is not possible. We directly compare these algorithms in this paper. We performed three random walks on the web under the same conditions and analyzed their outcomes in detail. We discuss the strengths and the weaknesses of each algorithm and propose improvements based on experimental results.
Keywords
- Random walks
- Sampling web pages
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads