Results 261 to 270 of about 839,459 (306)
Some of the next articles are maybe not open access.
Boosting Selective Nitrate Electroreduction to Ammonium by Constructing Oxygen Vacancies in TiO2
, 2020Electrocatalytic nitrate reduction into recyclable ammonium under benign conditions is significant.
Ranran Jia +5 more
semanticscholar +1 more source
Feature selection based on artificial bee colony and gradient boosting decision tree
Applied Soft Computing, 2019Data from many real-world applications can be high dimensional and features of such data are usually highly redundant. Identifying informative features has become an important step for data mining to not only circumvent the curse of dimensionality but to
H. Rao +7 more
semanticscholar +1 more source
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
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
2005
Martingale boosting is a simple and easily understood technique with a simple and easily understood analysis. A slight variant of the approach provably achieves optimal accuracy in the presence of random misclassification noise.
Philip M. Long, Rocco A. Servedio
openaire +1 more source
Martingale boosting is a simple and easily understood technique with a simple and easily understood analysis. A slight variant of the approach provably achieves optimal accuracy in the presence of random misclassification noise.
Philip M. Long, Rocco A. Servedio
openaire +1 more source
To Boost or Not to Boost Residents and Fellows—That Is the Question
Journal of Graduate Medical Education, 2022Sofia Zavala +2 more
openaire +2 more sources
2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05), 2005
In this paper, we described an efficient feature pursuit scheme for boosting. The proposed method is based on the infomax principle, which seeks optimal feature that achieves maximal mutual information with class labels. Direct feature pursuit with infomax is computationally prohibitive, so an efficient gradient ascent algorithm is further proposed ...
openaire +1 more source
In this paper, we described an efficient feature pursuit scheme for boosting. The proposed method is based on the infomax principle, which seeks optimal feature that achieves maximal mutual information with class labels. Direct feature pursuit with infomax is computationally prohibitive, so an efficient gradient ascent algorithm is further proposed ...
openaire +1 more source
To Boost or Not to Boost? That is the Question
SSRN Electronic Journal, 2023Ye Lu, Adrian Pagan
openaire +1 more source
The Arabian journal for science and engineering, 2022
T. Kavzoglu, A. Teke
semanticscholar +1 more source
T. Kavzoglu, A. Teke
semanticscholar +1 more source
Special Invited Paper-Additive logistic regression: A statistical view of boosting
, 2000J. Friedman
semanticscholar +1 more source

