Sciweavers

22 search results - page 2 / 5
» Cost-Based Sampling of Individual Instances
Sort
View
JMLR
2006
99views more  JMLR 2006»
13 years 6 months ago
Worst-Case Analysis of Selective Sampling for Linear Classification
A selective sampling algorithm is a learning algorithm for classification that, based on the past observed data, decides whether to ask the label of each new instance to be classi...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
TCC
2010
Springer
173views Cryptology» more  TCC 2010»
14 years 3 months ago
Bounds on the Sample Complexity for Private Learning and Private Data Release
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi N...
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
14 years 6 months ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
14 years 6 months 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
CEC
2009
IEEE
14 years 1 months ago
Particle Swarm CMA Evolution Strategy for the optimization of multi-funnel landscapes
— We extend the Evolution Strategy with Covariance Matrix Adaptation (CMA-ES) by collaborative concepts from Particle Swarm Optimization (PSO). The proposed Particle Swarm CMA-ES...
Christian L. Müller, Benedikt Baumgartner, Iv...