Sciweavers

780 search results - page 22 / 156
» Learning Low-Density Separators
Sort
View
ICML
2003
IEEE
16 years 7 months ago
Probabilistic Classifiers and the Concepts They Recognize
We investigate algebraic, logical, and geometric properties of concepts recognized by various classes of probabilistic classifiers. For this we introduce a natural hierarchy of pr...
Manfred Jaeger
ECML
2005
Springer
16 years 10 days ago
Margin-Sparsity Trade-Off for the Set Covering Machine
We propose a new learning algorithm for the set covering machine and a tight data-compression risk bound that the learner can use for choosing the appropriate tradeoff between the ...
François Laviolette, Mario Marchand, Mohak ...
COLT
2003
Springer
16 years 1 days ago
Preference Elicitation and Query Learning
Abstract. In this paper we initiate an exploration of relationships between “preference elicitation”, a learning-style problem that arises in combinatorial auctions, and the pr...
Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, M...
JMLR
2008
117views more  JMLR 2008»
15 years 6 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
ICASSP
2009
IEEE
16 years 1 months ago
A variational EM algorithm for learning eigenvoice parameters in mixed signals
We derive an efficient learning algorithm for model-based source separation for use on single channel speech mixtures where the precise source characteristics are not known a pri...
Ron J. Weiss, Daniel P. W. Ellis