Sciweavers

1484 search results - page 236 / 297
» Semi-supervised Learning from General Unlabeled Data
Sort
View
FOCS
2010
IEEE
13 years 6 months ago
Boosting and Differential Privacy
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan
CORR
2011
Springer
186views Education» more  CORR 2011»
12 years 12 months ago
Blind Compressed Sensing Over a Structured Union of Subspaces
—This paper addresses the problem of simultaneous signal recovery and dictionary learning based on compressive measurements. Multiple signals are analyzed jointly, with multiple ...
Jorge Silva, Minhua Chen, Yonina C. Eldar, Guiller...
CIDR
2007
165views Algorithms» more  CIDR 2007»
13 years 9 months ago
A Black-Box Approach to Query Cardinality Estimation
We present a “black-box” approach to estimating query cardinality that has no knowledge of query execution plans and data distribution, yet provides accurate estimates. It doe...
Tanu Malik, Randal C. Burns, Nitesh V. Chawla
HT
2009
ACM
14 years 2 months ago
Hyperincident connected components of tagging networks
Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of c...
Nicolas Neubauer, Klaus Obermayer
JMLR
2006
99views more  JMLR 2006»
13 years 8 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 ...