Computer Science – Data Structures and Algorithms
Scientific paper
2009-02-10
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (2009) 13-30
Computer Science
Data Structures and Algorithms
Scientific paper
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.
Baykan Eda
Castelberg Sebastian de
Henzinger Monika
Keller Stefan F.
Kinzler Markus
No associations
LandOfFree
A Comparison of Techniques for Sampling Web Pages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Comparison of Techniques for Sampling Web Pages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Comparison of Techniques for Sampling Web Pages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-19756