On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms

ISSN： 0885-6125

Source： Machine Learning, Vol.80, Iss.2-3, 2010-09, pp. : 141-163

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the Existence of Linear Weak Learners and Applications to Boosting

By Mannor S.

Machine Learning, Vol. 48, Iss. 1-3, 2002-07 ,pp. : 219-251

Springer Publishing Company

Access to resources Recommend Favorite

Efficient algorithms for checking the equivalence of multistage interconnection networks

By Calamoneri T. Massini A.

Journal of Parallel and Distributed Computing, Vol. 64, Iss. 1, 2004-01 ,pp. : 135-150

Elsevier

Access to resources Recommend Favorite

The Strength of Weak Learnability

By Schapire R.E.

Machine Learning, Vol. 05, Iss. 2, 1990-06 ,pp. : 197-227

Springer Publishing Company

Access to resources Recommend Favorite

Increasing the Robustness of Boosting Algorithms within the Linear-programming Framework

By Sun Yijun

Journal of VLSI Signal Processing, Vol. 48, Iss. 1-2, 2007-08 ,pp. : 5-20

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Graph-Theoretic Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System

By Datta A.

The Journal of Supercomputing, Vol. 23, Iss. 2, 2002-09 ,pp. : 193-211

Springer Publishing Company

Access to resources Recommend Favorite