Sciweavers

70 search results - page 6 / 14
» Boosting Based on a Smooth Margin
Sort
View
IJAR
2008
161views more  IJAR 2008»
13 years 7 months ago
Bayesian learning for a class of priors with prescribed marginals
We present Bayesian updating of an imprecise probability measure, represented by a class of precise multidimensional probability measures. Choice and analysis of our class are mot...
Hermann Held, Thomas Augustin, Elmar Kriegler
ICCV
2007
IEEE
14 years 9 months ago
Locally Smooth Metric Learning with Application to Image Retrieval
In this paper, we propose a novel metric learning method based on regularized moving least squares. Unlike most previous metric learning methods which learn a global Mahalanobis d...
Dit-Yan Yeung, Hong Chang
CVPR
2004
IEEE
14 years 9 months ago
Learning Distance Functions for Image Retrieval
Image retrieval critically relies on the distance function used to compare a query image to images in the database. We suggest to learn such distance functions by training binary ...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
ICML
2010
IEEE
13 years 8 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
KAIS
2010
144views more  KAIS 2010»
13 years 6 months ago
Boosting support vector machines for imbalanced data sets
Real world data mining applications must address the issue of learning from imbalanced data sets. The problem occurs when the number of instances in one class greatly outnumbers t...
Benjamin X. Wang, Nathalie Japkowicz