Sciweavers

4131 search results - page 591 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
WWW
2009
ACM
16 years 7 months ago
An axiomatic approach for result diversification
Understanding user intent is key to designing an effective ranking system in a search engine. In the absence of any explicit knowledge of user intent, search engines want to diver...
Sreenivas Gollapudi, Aneesh Sharma
WWW
2005
ACM
16 years 7 months ago
Sampling search-engine results
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 approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
KDD
2009
ACM
167views Data Mining» more  KDD 2009»
16 years 7 months ago
Seven pitfalls to avoid when running controlled experiments on the web
Controlled experiments, also called randomized experiments and A/B tests, have had a profound influence on multiple fields, including medicine, agriculture, manufacturing, and adv...
Thomas Crook, Brian Frasca, Ron Kohavi, Roger Long...
KDD
2003
ACM
109views Data Mining» more  KDD 2003»
16 years 7 months ago
Experimental design for solicitation campaigns
Data mining techniques are routinely used by fundraisers to select those prospects from a large pool of candidates who are most likely to make a financial contribution. These tech...
Uwe F. Mayer, Armand Sarkissian
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 7 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel