Sciweavers

227 search results - page 33 / 46
» A PAC Bound for Approximate Support Vector Machines
Sort
View
JMLR
2002
89views more  JMLR 2002»
13 years 7 months ago
A Robust Minimax Approach to Classification
When constructing a classifier, the probability of correct classification of future data points should be maximized. We consider a binary classification problem where the mean and...
Gert R. G. Lanckriet, Laurent El Ghaoui, Chiranjib...
AIA
2007
13 years 8 months ago
Improving the aggregating algorithm for regression
Kernel Ridge Regression (KRR) and the recently developed Kernel Aggregating Algorithm for Regression (KAAR) are regression methods based on Least Squares. KAAR has theoretical adv...
Steven Busuttil, Yuri Kalnishkan, Alexander Gammer...
ICCV
2009
IEEE
13 years 5 months ago
Realtime background subtraction from dynamic scenes
This paper examines the problem of moving object detection. More precisely, it addresses the difficult scenarios where background scene textures in the video might change over tim...
Li Cheng, Minglun Gong
COLT
2004
Springer
14 years 23 days ago
Sparseness Versus Estimating Conditional Probabilities: Some Asymptotic Results
One of the nice properties of kernel classifiers such as SVMs is that they often produce sparse solutions. However, the decision functions of these classifiers cannot always be u...
Peter L. Bartlett, Ambuj Tewari
ICIAR
2004
Springer
14 years 22 days ago
Learning an Information Theoretic Transform for Object Detection
We present an information theoretic approach for learning a linear dimension reduction transform for object classification. The theoretic guidance of the approach is that the trans...
Jianzhong Fang, Guoping Qiu