Sciweavers

3668 search results - page 106 / 734
» Margin Distribution and Learning
Sort
View
EUSFLAT
2007
164views Fuzzy Logic» more  EUSFLAT 2007»
15 years 5 months ago
An Aggregate Claims Model Between Independence and Comonotone Dependence
We introduce a simple aggregate claims model, which is able to take into account a continuous range of positive dependence between independence and comonotone dependence. It is ba...
Werner Hürlimann
CORR
2008
Springer
70views Education» more  CORR 2008»
15 years 4 months ago
Universal Coding on Infinite Alphabets: Exponentially Decreasing Envelopes
This paper deals with the problem of universal lossless coding on a countable infinite alphabet. It focuses on some classes of sources defined by an envelope condition on the margi...
Dominique Bontemps
CORR
2006
Springer
105views Education» more  CORR 2006»
15 years 4 months ago
Generalization error bounds in semi-supervised classification under the cluster assumption
We consider semi-supervised classification when part of the available data is unlabeled. These unlabeled data can be useful for the classification problem when we make an assumpti...
Philippe Rigollet
JMIV
2002
72views more  JMIV 2002»
15 years 4 months ago
Estimating Overcomplete Independent Component Bases for Image Windows
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...
Aapo Hyvärinen, Mika Inki
TIT
2010
76views Education» more  TIT 2010»
14 years 11 months ago
Tighter bounds on the capacity of finite-state channels via Markov set-chains
The theory of Markov set-chains is applied to derive upper and lower bounds on the capacity of finite-state channels that are tighter than the classic bounds by Gallager. The new ...
Jun Chen, Haim H. Permuter, Tsachy Weissman