Sciweavers

2190 search results - page 237 / 438
» Learning with the Set Covering Machine
Sort
View
TNN
2010
143views Management» more  TNN 2010»
13 years 5 months ago
Using unsupervised analysis to constrain generalization bounds for support vector classifiers
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
Sergio Decherchi, Sandro Ridella, Rodolfo Zunino, ...
ICASSP
2011
IEEE
13 years 2 months ago
SVM feature selection for multidimensional EEG data
In many machine learning applications, like Brain - Computer Interfaces (BCI), only high-dimensional noisy data are available rendering the discrimination task non-trivial. In thi...
Nisrine Jrad, Ronald Phlypo, Marco Congedo
ICML
2010
IEEE
13 years 11 months ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan
COLT
2001
Springer
14 years 3 months ago
On Using Extended Statistical Queries to Avoid Membership Queries
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
Nader H. Bshouty, Vitaly Feldman
ICIP
2003
IEEE
15 years 8 days 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