Sciweavers

76 search results - page 7 / 16
» New Results for Learning Noisy Parities and Halfspaces
Sort
View
NIPS
2007
13 years 9 months ago
Bayesian Co-Training
We propose a Bayesian undirected graphical model for co-training, or more generally for semi-supervised multi-view learning. This makes explicit the previously unstated assumption...
Shipeng Yu, Balaji Krishnapuram, Rómer Rosa...
EUROCRYPT
1999
Springer
13 years 11 months ago
On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives. We introduce a general model...
Ivan Damgård, Joe Kilian, Louis Salvail
CVPR
2008
IEEE
14 years 9 months ago
Multiple-instance ranking: Learning to rank images for image retrieval
We study the problem of learning to rank images for image retrieval. For a noisy set of images indexed or tagged by the same keyword, we learn a ranking model from some training e...
Yang Hu, Mingjing Li, Nenghai Yu
ISDA
2009
IEEE
14 years 2 months ago
Measures for Unsupervised Fuzzy-Rough Feature Selection
For supervised learning, feature selection algorithms attempt to maximise a given function of predictive accuracy. This function usually considers the ability of feature vectors t...
Neil MacParthalain, Richard Jensen
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 1 months ago
Learning noise
In this paper we propose a genetic programming approach to learning stochastic models with unsymmetrical noise distributions. Most learning algorithms try to learn from noisy data...
Michael D. Schmidt, Hod Lipson