Sciweavers

12194 search results - page 393 / 2439
» Numberings Optimal for Learning
Sort
View
ECML
2006
Springer
15 years 10 months ago
Why Is Rule Learning Optimistic and How to Correct It
Abstract. In their search through a huge space of possible hypotheses, rule induction algorithms compare estimations of qualities of a large number of rules to find the one that ap...
Martin Mozina, Janez Demsar, Jure Zabkar, Ivan Bra...
JMLR
2010
198views more  JMLR 2010»
15 years 5 months ago
On Learning with Integral Operators
A large number of learning algorithms, for example, spectral clustering, kernel Principal Components Analysis and many manifold methods are based on estimating eigenvalues and eig...
Lorenzo Rosasco, Mikhail Belkin, Ernesto De Vito
JMLR
2010
143views more  JMLR 2010»
15 years 1 months ago
Rademacher Complexities and Bounding the Excess Risk in Active Learning
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
Vladimir Koltchinskii
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 6 months ago
Polynomial Learning of Distribution Families
Abstract--The question of polynomial learnability of probability distributions, particularly Gaussian mixture distributions, has recently received significant attention in theoreti...
Mikhail Belkin, Kaushik Sinha
ICIP
2003
IEEE
16 years 8 months ago
Statistical learning for effective visual information retrieval
For effective retrieval of visual information, statistical learning plays a pivotal role. Statistical learning in such a context faces at least two major mathematical challenges: ...
Edward Y. Chang, Beitao Li, Gang Wu, Kingshy Goh