Pages that link to "Item:Q1969321"

The following pages link to Improved boosting algorithms using confidence-rated predictions (Q1969321):

Displayed 44 items.

• Greedy function approximation: A gradient boosting machine. (Q127532) ‎ (← links)
• Breast cancer prediction using the isotonic separation technique (Q877069) ‎ (← links)
• ML-KNN: A lazy learning approach to multi-label learning (Q882226) ‎ (← links)
• Self-improved gaps almost everywhere for the agnostic approximation of monomials (Q884469) ‎ (← links)
• An unbiased method for constructing multilabel classification trees (Q956995) ‎ (← links)
• Cost-sensitive boosting for classification of imbalanced data (Q996413) ‎ (← links)
• EROS: Ensemble rough subspaces (Q996469) ‎ (← links)
• New multicategory boosting algorithms based on multicategory Fisher-consistent losses (Q999662) ‎ (← links)
• Learning \((k,l)\)-contextual tree languages for information extraction from web pages (Q1009259) ‎ (← links)
• Improved MCMC sampling methods for estimating weighted sums in Winnow with application to DNF learning (Q1009287) ‎ (← links)
• Multilabel classification via calibrated label ranking (Q1009289) ‎ (← links)
• Boosted Bayesian network classifiers (Q1009291) ‎ (← links)
• Surrogate maximization/minimization algorithms and extensions (Q1009342) ‎ (← links)
• A local boosting algorithm for solving classification problems (Q1023522) ‎ (← links)
• A \(\mathbb R\)eal generalization of discrete AdaBoost (Q1028894) ‎ (← links)
• A hybrid filter/wrapper approach of feature selection using information theory (Q1347722) ‎ (← links)
• Complexity in the case against accuracy estimation (Q1399985) ‎ (← links)
• A geometric approach to leveraging weak learners (Q1603593) ‎ (← links)
• Drifting games and Brownian motion (Q1604221) ‎ (← links)
• Cost-sensitive learning and decision making revisited (Q1779549) ‎ (← 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)
• Top-down decision tree learning as information based boosting (Q1870539) ‎ (← links)
• On approximating weighted sums with exponentially many terms (Q1880781) ‎ (← links)
• Population theory for boosting ensembles. (Q1884600) ‎ (← links)
• Statistical behavior and consistency of classification methods based on convex risk minimization. (Q1884603) ‎ (← links)
• Supervised projection approach for boosting classifiers (Q2270792) ‎ (← links)
• Gene boosting for cancer classification based on gene expression profiles (Q2270794) ‎ (← links)
• Classification by evolutionary ensembles (Q2369589) ‎ (← links)
• Multi-class learning by smoothed boosting (Q2384151) ‎ (← links)
• Feature mining and pattern classification for steganalysis of LSB matching steganography in grayscale images (Q2384947) ‎ (← links)
• Quadratic boosting (Q2384982) ‎ (← links)
• First order random forests: Learning relational classifiers with complex aggregates (Q2433184) ‎ (← links)
• Using natural class hierarchies in multi-class visual classification (Q2495923) ‎ (← links)
• Complexities of convex combinations and bounding the generalization error in classification (Q2583410) ‎ (← links)
• Boosting with early stopping: convergence and consistency (Q2583412) ‎ (← links)
• Boosting the partial least square algorithm for regression modelling (Q3181328) ‎ (← links)
• Robust Boosting Algorithm Against Mislabeling in Multiclass Problems (Q3503733) ‎ (← links)
• A Hybrid Approach of Boosting Against Noisy Data (Q3627899) ‎ (← links)
• Theory and Algorithm for Learning with Dissimilarity Functions (Q3628019) ‎ (← links)
• Online Adaptive Decision Trees: Pattern Classification and Function Approximation (Q5488505) ‎ (← links)
• The synergy between PAV and AdaBoost (Q5896776) ‎ (← links)
• The synergy between PAV and AdaBoost (Q5920546) ‎ (← links)
• Effect of pruning and early stopping on performance of a boosting ensemble. (Q5958472) ‎ (← links)