Sciweavers

295 search results - page 1 / 59
» A Robust Minimax Approach to Classification
Sort
View
JMLR
2002
89views more  JMLR 2002»
13 years 4 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...
WWW
2007
ACM
14 years 5 months ago
Efficient training on biased minimax probability machine for imbalanced text classification
The Biased Minimax Probability Machine (BMPM) constructs a classifier which deals with the imbalanced learning tasks. In this paper, we propose a Second Order Cone Programming (SO...
Xiang Peng, Irwin King
ICML
2006
IEEE
14 years 5 months ago
Nightmare at test time: robust learning by feature deletion
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
Amir Globerson, Sam T. Roweis
TIT
2011
119views more  TIT 2011»
12 years 11 months ago
Minimax Robust Quickest Change Detection
—The popular criteria of optimality for quickest change detection procedures are the Lorden criterion, the Pollak criterion, and the Bayesian criterion. In this paper, a robust v...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli...
ICA
2004
Springer
13 years 10 months ago
Minimax Mutual Information Approach for ICA of Complex-Valued Linear Mixtures
Abstract. Recently, the authors developed the Minimax Mutual Information algorithm for linear ICA of real-valued mixtures, which is based on a density estimate stemming from Jaynes...
Jian-Wu Xu, Deniz Erdogmus, Yadunandana N. Rao, Jo...