Sciweavers

346 search results - page 9 / 70
» A New Approximate Maximal Margin Classification Algorithm
Sort
View
74
Voted
NIPS
2008
14 years 11 months ago
Continuously-adaptive discretization for message-passing algorithms
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
Michael Isard, John MacCormick, Kannan Achan
ALT
2008
Springer
15 years 6 months ago
Smooth Boosting for Margin-Based Ranking
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...
Jun-ichi Moribe, Kohei Hatano, Eiji Takimoto, Masa...
79
Voted
CIMCA
2005
IEEE
15 years 3 months ago
Statistical Learning Procedure in Loopy Belief Propagation for Probabilistic Image Processing
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 ...
Kazuyuki Tanaka
ICML
2010
IEEE
14 years 10 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
CVPR
2003
IEEE
15 years 11 months ago
Classification Based on Symmetric Maximized Minimal Distance in Subspace (SMMS)
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...
Wende Zhang, Tsuhan Chen