We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approximate algorithms for several applications, such as:
%0 Conference Paper
%1 Anagnostopoulos05
%A Anagnostopoulos, Aris
%A Broder, Andrei Z.
%A Carmel, David
%B WWW '05: Proceedings of the 14th international conference on World Wide Web
%C New York, NY, USA
%D 2005
%I ACM
%K WebSearch WebSearchResults analysis
%P 245--256
%R http://doi.acm.org/10.1145/1060745.1060784
%T Sampling search-engine results
%U http://portal.acm.org/citation.cfm?id=1060784
%X We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approximate algorithms for several applications, such as:
%@ 1-59593-046-9
@inproceedings{Anagnostopoulos05,
abstract = {We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approximate algorithms for several applications, such as:},
added-at = {2009-01-31T13:05:30.000+0100},
address = {New York, NY, USA},
author = {Anagnostopoulos, Aris and Broder, Andrei Z. and Carmel, David},
biburl = {https://www.bibsonomy.org/bibtex/2c601153c7595dfecffc5575de5aac4a1/mkroell},
booktitle = {WWW '05: Proceedings of the 14th international conference on World Wide Web},
description = {Sampling search-engine results},
doi = {http://doi.acm.org/10.1145/1060745.1060784},
interhash = {e7f51e47d206246d700a1bfeb910192b},
intrahash = {c601153c7595dfecffc5575de5aac4a1},
isbn = {1-59593-046-9},
keywords = {WebSearch WebSearchResults analysis},
location = {Chiba, Japan},
pages = {245--256},
publisher = {ACM},
timestamp = {2009-01-31T13:05:30.000+0100},
title = {Sampling search-engine results},
url = {http://portal.acm.org/citation.cfm?id=1060784},
year = 2005
}