Results 221 to 230 of about 224,408 (267)

Machine learning for multiple sclerosis classification and disability prediction using clinical and MRI data. [PDF]

open access: yesFront Artif Intell
Valsasina P   +15 more
europepmc   +1 more source

Sparse boosting

2009 IEEE International Conference on Acoustics, Speech and Signal Processing, 2009
We propose a boosting algorithm that seeks to minimize the AdaBoost exponential loss of a composite classifier using only a sparse set of base classifiers. The proposed algorithm is computationally efficient and in test examples produces composite classifiers that are sparser and generalize as well those produced by Adaboost.
Zhen James Xiang, Peter J. Ramadge
openaire   +1 more source

To boost or not to boost, and how to do it

International Journal of Radiation Oncology*Biology*Physics, 1991
Breast cancer, Radiotherapy, Boost, Treatment planning. The function of a “boost” dose in radiotherapy is to give a higher dose to an area thought to have a higher tumor burden than the surrounding tissue. By restricting the high-dose region to a part of the target volume rather than the entire volume, the use of a boost might reduce the incidence of ...
Abram Recht, Jay R. Harris
openaire   +1 more source

Boosting Boosting

2017
Machine learning is becoming prevalent in all aspects of our lives. For some applications, there is a need for simple but accurate white-box systems that are able to train efficiently and with little data. "Boosting" is an intuitive method, combining many simple (possibly inaccurate) predictors to form a powerful, accurate classifier.
openaire   +1 more source

Asymmetric boosting

Proceedings of the 24th international conference on Machine learning, 2007
A cost-sensitive extension of boosting, denoted as asymmetric boosting, is presented. Unlike previous proposals, the new algorithm is derived from sound decision-theoretic principles, which exploit the statistical interpretation of boosting to determine a principled extension of the boosting loss.
Hamed Masnadi-Shirazi, Nuno Vasconcelos
openaire   +1 more source

No-Regret Boosting

2007
Following [4], we analyze boosting from a game-theoretic perspective. We define a wide class of boosting classification algorithms called H-boosting methods, which are based on Hannan-consistent game playing strategies. These strategies tend to minimize the regret of a player, i.e.
Anna Gambin, Ewa Szczurek
openaire   +1 more source

To Boost or Not to Boost Residents and Fellows—That Is the Question

Journal of Graduate Medical Education, 2022
Sofia Zavala   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy