Sciweavers

56 search results - page 10 / 12
» Semi-supervised Learning by Entropy Minimization
Sort
View
NIPS
2008
13 years 7 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari
ECML
2005
Springer
13 years 11 months ago
Estimation of Mixture Models Using Co-EM
We study estimation of mixture models for problems in which multiple views of the instances are available. Examples of this setting include clustering web pages or research papers ...
Steffen Bickel, Tobias Scheffer
JMLR
2010
101views more  JMLR 2010»
13 years 17 days ago
Classification Using Geometric Level Sets
A variational level set method is developed for the supervised classification problem. Nonlinear classifier decision boundaries are obtained by minimizing an energy functional tha...
Kush R. Varshney, Alan S. Willsky
COLT
2000
Springer
13 years 10 months ago
Model Selection and Error Estimation
We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalizatio...
Peter L. Bartlett, Stéphane Boucheron, G&aa...
VLSISP
1998
111views more  VLSISP 1998»
13 years 5 months ago
Quantitative Analysis of MR Brain Image Sequences by Adaptive Self-Organizing Finite Mixtures
This paper presents an adaptive structure self-organizing finite mixture network for quantification of magnetic resonance (MR) brain image sequences. We present justification fo...
Yue Wang, Tülay Adali, Chi-Ming Lau, Sun-Yuan...