346 search results - page 9 / 70 » A New Approximate Maximal Margin Classification Algorithm |
107
click to vote
NIPS
2008
15 years 3 months ago
2008
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
118
click to vote
ALT
2008
Springer
15 years 10 months ago
2008
Springer
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
116
Voted
CIMCA
2005
IEEE
15 years 7 months ago
2005
IEEE
We give a fast and practical algorithm for statistical learning hyperparameters from observable data in probabilistic image processing, which is based on Gaussian graphical model ...
117
click to vote
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
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 ...
106
click to vote
CVPR
2003
IEEE
16 years 3 months ago
2003
IEEE
We introduce a new classification algorithm based on the concept of Symmetric Maximized Minimal distance in Subspace (SMMS). Given the training data of authentic samples and impos...