Sciweavers

1451 search results - page 160 / 291
» Finding People by Sampling
Sort
View
WWW
2005
ACM
16 years 6 months ago
A framework for determining necessary query set sizes to evaluate web search effectiveness
We describe a framework of bootstrapped hypothesis testing for estimating the confidence in one web search engine outperforming another over any randomly sampled query set of a gi...
Eric C. Jensen, Steven M. Beitzel, Ophir Frieder, ...
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
16 years 6 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
16 years 6 months ago
Optimal outlier removal in high-dimensional
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
John Dunagan, Santosh Vempala
194
Voted
CHI
2010
ACM
16 years 28 days ago
Friends only: examining a privacy-enhancing behavior in facebook
Privacy practices in social network sites often appear paradoxical, as content-sharing behavior stands in conflict with the need to reduce disclosure-related harms. In this study ...
Fred Stutzman, Jacob Kramer-Duffield
ATAL
2009
Springer
16 years 20 days ago
Effects of resource and remembering on social networks
To better represent human interactions in social networks, the authors take a network-oriented simulation approach to analyze the evolution of acquaintance networks based on local...
Chung-Yuan Huang, Yu-Shiuan Tsai, Chuen-Tsai Sun