Pages that link to "Item:Q5945698"

The following pages link to An adaptive version of the boost by majority algorithm (Q5945698):

Displaying 15 items.

• Quadratic Majorization for Nonconvex Loss with Applications to the Boosting Algorithm (Q82722) (← links)
• Robust boosting with truncated loss functions (Q82723) (← links)
• Soft-max boosting (Q747255) (← links)
• Drifting games and Brownian motion (Q1604221) (← links)
• Noise peeling methods to improve boosting algorithms (Q1660240) (← links)
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors) (Q1848780) (← links)
• Random classification noise defeats all convex potential boosters (Q1959553) (← links)
• On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms (Q1959594) (← links)
• Utilizing adaptive boosting to detect quantum steerability (Q2142590) (← links)
• Analyzing high dimensional correlated data using feature ranking and classifiers (Q2183360) (← links)
• GA-Ensemble: a genetic algorithm for robust ensembles (Q2259225) (← links)
• Multi-class learning by smoothed boosting (Q2384151) (← links)
• Parsimonious reduction of Gaussian mixture models with a variational-Bayes approach (Q2654252) (← links)
• Boosting the partial least square algorithm for regression modelling (Q3181328) (← links)
• Data reduction in classification: A simulated annealing based projection method (Q4969733) (← links)