Pages that link to "Item:Q1899915"
From MaRDI portal
The following pages link to Boosting a weak learning algorithm by majority (Q1899915):
Displayed 41 items.
- An analysis of diversity measures (Q851877) (← links)
- Learning unions of \(\omega(1)\)-dimensional rectangles (Q950197) (← links)
- EROS: Ensemble rough subspaces (Q996469) (← links)
- Data gravitation based classification (Q1007885) (← 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)
- A note on margin-based loss functions in classification (Q1770065) (← 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)
- Consensus analysis of multiple classifiers using non-repetitive variables: diagnostic application to microarray gene expression data (Q2373280) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- Recursive aggregation of estimators by the mirror descent algorithm with averaging (Q2432961) (← links)
- Maximum patterns in datasets (Q2478429) (← links)
- An efficient modified boosting method for solving classification problems (Q2479397) (← links)
- Model combination for credit risk assessment: a stacked generalization approach (Q2480229) (← links)
- Algorithms for manipulation of level sets of nonparametric density estimates (Q2488405) (← links)
- A general dimension for query learning (Q2641869) (← links)
- Theory of Classification: a Survey of Some Recent Advances (Q3373749) (← links)
- Deterministic Neural Classification (Q3503732) (← links)
- Concept lattice based composite classifiers for high predictability (Q4409023) (← links)
- Aggregating classifiers with ordinal response structure (Q4675843) (← links)
- Boosting with Noisy Data: Some Views from Statistical Theory (Q4819816) (← links)
- Ten More Years of Error Rate Research (Q4831978) (← links)
- FE-CIDIM: fast ensemble of CIDIM classifiers (Q5426631) (← links)
- A Fast Learning Algorithm for Deep Belief Nets (Q5476682) (← links)
- Boosting in the presence of noise (Q5921649) (← links)
- Bayesian partition modelling. (Q5958478) (← links)