Sciweavers

266 search results - page 47 / 54
» On the variance of random polygons
Sort
View
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
16 years 6 days ago
Efficiently learning the accuracy of labeling sources for selective sampling
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 2 days ago
Practical guide to controlled experiments on the web: listen to your customers not to the hippo
The web provides an unprecedented opportunity to evaluate ideas quickly using controlled experiments, also called randomized experiments (single-factor or factorial designs), A/B ...
Ron Kohavi, Randal M. Henne, Dan Sommerfield
IJCNN
2007
IEEE
15 years 6 months ago
Generalised Kernel Machines
Abstract— The generalised linear model (GLM) is the standard approach in classical statistics for regression tasks where it is appropriate to measure the data misfit using a lik...
Gavin C. Cawley, Gareth J. Janacek, Nicola L. C. T...
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 5 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
JSS
2007
118views more  JSS 2007»
14 years 11 months ago
A new imputation method for small software project data sets
Effort prediction is a very important issue for software project management. Historical project data sets are frequently used to support such prediction. But missing data are oft...
Qinbao Song, Martin J. Shepperd