Pages that link to "Item:Q1899915"
From MaRDI portal
The following pages link to Boosting a weak learning algorithm by majority (Q1899915):
Displaying 50 items.
- Active classification using belief functions and information gain maximization (Q274429) (← links)
- Finding causative genes from high-dimensional data: an appraisal of statistical and machine learning approaches (Q309421) (← links)
- A time-series modeling method based on the boosting gradient-descent theory (Q412870) (← links)
- Complexity of hard-core set proofs (Q451110) (← links)
- Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms (Q463372) (← links)
- Cox process functional learning (Q500875) (← links)
- Remembering Leo Breiman (Q542912) (← links)
- \(L_{2}\) boosting in kernel regression (Q605014) (← links)
- Preference disaggregation and statistical learning for multicriteria decision support: A review (Q621964) (← links)
- Boosting in Cox regression: a comparison between the likelihood-based and the model-based approaches with focus on the R-packages \textit{CoxBoost} and \textit{mboost} (Q736636) (← links)
- Soft-max boosting (Q747255) (← links)
- An analysis of diversity measures (Q851877) (← links)
- Committee polyhedral separability: complexity and polynomial approximation (Q890319) (← links)
- Deep learning of support vector machines with class probability output networks (Q890735) (← links)
- Boosting local quasi-likelihood estimators (Q904088) (← links)
- Learning unions of \(\omega(1)\)-dimensional rectangles (Q950197) (← links)
- Learning with continuous experts using drifting games (Q982637) (← links)
- EROS: Ensemble rough subspaces (Q996469) (← links)
- Data gravitation based classification (Q1007885) (← links)
- Classification tree analysis using TARGET (Q1023462) (← links)
- On boosting kernel regression (Q1031760) (← links)
- Partial Occam's Razor and its applications (Q1127393) (← links)
- On the boosting ability of top-down decision tree learning algorithms (Q1305926) (← links)
- An overtraining-resistant stochastic modeling method for pattern recognition (Q1354427) (← links)
- A decision-theoretic generalization of on-line learning and an application to boosting (Q1370863) (← links)
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution (Q1384530) (← links)
- The monotone theory for the PAC-model. (Q1426003) (← links)
- Bayesian model averaging: A tutorial. (with comments and a rejoinder). (Q1431179) (← links)
- A geometric approach to leveraging weak learners (Q1603593) (← links)
- Boosting using branching programs (Q1604220) (← links)
- Drifting games and Brownian motion (Q1604221) (← links)
- Ensembling neural networks: Many could be better than all (Q1605287) (← links)
- Noise peeling methods to improve boosting algorithms (Q1660240) (← links)
- Probability estimation for multi-class classification using adaboost (Q1677008) (← links)
- Logical analysis of data as a tool for the analysis of probabilistic discrete choice behavior (Q1734841) (← links)
- A note on margin-based loss functions in classification (Q1770065) (← links)
- BoostWofE: a new sequential weights of evidence model reducing the effect of conditional dependency (Q1789094) (← links)
- Arcing classifiers. (With discussion) (Q1807115) (← links)
- Boosting the margin: a new explanation for the effectiveness of voting methods (Q1807156) (← links)
- Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors) (Q1848780) (← links)
- On weak base hypotheses and their implications for boosting regression and classification (Q1848929) (← links)
- Top-down decision tree learning as information based boosting (Q1870539) (← links)
- On the Bayes-risk consistency of regularized boosting methods. (Q1884602) (← links)
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
- Sharp oracle inequalities for aggregation of affine estimators (Q1940775) (← links)
- Semiparametric regression during 2003--2007 (Q1952023) (← links)
- Random classification noise defeats all convex potential boosters (Q1959553) (← links)
- Multi-vehicle detection algorithm through combining Harr and HOG features (Q1997291) (← links)
- SVM-boosting based on Markov resampling: theory and algorithm (Q2057733) (← links)
- Sampling from non-smooth distributions through Langevin diffusion (Q2065460) (← links)
