Improved boosting algorithms using confidence-rated predictions
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- The value of agreement a new boosting algorithm
- What can we learn privately?
- Boosting the margin: a new explanation for the effectiveness of voting methods
- A boosting approach for supervised Mahalanobis distance metric learning
- Boosted Bayesian network classifiers
- An unbiased method for constructing multilabel classification trees
- An asymmetric adaptive classification method
- Extensions of stability selection using subsamples of observations and covariates
- Self-improved gaps almost everywhere for the agnostic approximation of monomials
- Learning a priori constrained weighted majority votes
- EROS: Ensemble rough subspaces
- Computational Science - ICCS 2004
- Cost-sensitive ensemble learning: a unifying framework
- Classification by evolutionary ensembles
- Efficient HOG human detection
- Boosting with early stopping: convergence and consistency
- Complexities of convex combinations and bounding the generalization error in classification
- Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
- A time-series modeling method based on the boosting gradient-descent theory
- An improved branch-and-bound method for maximum monomial agreement
- Ternary Bradley-Terry model-based decoding for multi-class classification and its extensions
- Robust Boosting Algorithm Against Mislabeling in Multiclass Problems
- Breast cancer prediction using the isotonic separation technique
- A geometric approach to leveraging weak learners
- Cost-sensitive learning and decision making revisited
- Hellinger distance decision trees are robust and skew-insensitive
- A local boosting algorithm for solving classification problems
- Predicate logic based image grammars for complex pattern recognition
- Reduction from cost-sensitive ordinal ranking to weighted binary classification
- scientific article; zbMATH DE number 2089094 (Why is no real title available?)
- Feature mining and pattern classification for steganalysis of LSB matching steganography in grayscale images
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Component-wisely sparse boosting
- Simultaneous spotting of signs and fingerspellings based on hierarchical conditional random fields and boostmap embeddings
- scientific article; zbMATH DE number 1931825 (Why is no real title available?)
- Soft-max boosting
- New multicategory boosting algorithms based on multicategory Fisher-consistent losses
- Greedy function approximation: A gradient boosting machine.
- Supervised projection approach for boosting classifiers
- Robust regression by boosting the median.
- \(L_{2}\) boosting in kernel regression
- Hybrid classification algorithms based on boosting and support vector machines
- Complexity in the case against accuracy estimation
- Boosted classification trees and class probability/quantile estimation
- Cost-sensitive boosting for classification of imbalanced data
- Deformation of log-likelihood loss function for multiclass boosting
- First order random forests: Learning relational classifiers with complex aggregates
- Boosting random subspace method
- Random classification noise defeats all convex potential boosters
- Angle-based cost-sensitive multicategory classification
- Tune and mix: learning to rank using ensembles of calibrated multi-class classifiers
- scientific article; zbMATH DE number 2013255 (Why is no real title available?)
- Three categories customer churn prediction based on the adjusted real AdaBoost
- Modeling surrender risk in life insurance: theoretical and experimental insight
- ML-KNN: A lazy learning approach to multi-label learning
- A new column generation algorithm for logical analysis of data
- Comment on: Boosting algorithms: regularization, prediction and model fitting
- Population theory for boosting ensembles.
- Multilabel classification through random graph ensembles
- Effect of pruning and early stopping on performance of a boosting ensemble.
- Quadratic boosting
- Cost-sensitive boosting algorithms: do we really need them?
- A dynamic ensemble approach to robust classification in the presence of missing data
- Multicategory large margin classification methods: hinge losses vs. coherence functions
- A noise-detection based AdaBoost algorithm for mislabeled data
- Hierarchical linear support vector machine
- Multi-class boosting with asymmetric binary weak-learners
- Drifting games and Brownian motion
- Online Adaptive Decision Trees: Pattern Classification and Function Approximation
- Multilabel classification with meta-level features in a learning-to-rank framework
- Multilabel classification via calibrated label ranking
- scientific article; zbMATH DE number 2086353 (Why is no real title available?)
- Fully corrective boosting with arbitrary loss and regularization
- Multi-class AdaBoost
- scientific article; zbMATH DE number 1931839 (Why is no real title available?)
- Gene boosting for cancer classification based on gene expression profiles
- Using social media for classifying actionable insights in disaster scenario
- scientific article; zbMATH DE number 1875389 (Why is no real title available?)
- Multiclass boosting with adaptive group-based \(k\)NN and its application in text categorization
- A calibrated multiclass extension of AdaBoost
- On PAC-Bayesian bounds for random forests
- AdaBoost Semiparametric Model Averaging Prediction for Multiple Categories
- Multiclass boosting for weak classifiers
- Boosting with missing predictors
- scientific article; zbMATH DE number 2044190 (Why is no real title available?)
- A Bayesian non-parametric modeling to estimate student response to ICT investment
- Theoretical foundations and experimental results for a hierarchical classifier with overlapping clusters
- AdaBoost and robust one-bit compressed sensing
- scientific article; zbMATH DE number 2043443 (Why is no real title available?)
- Evolution of the Viola-Jones Object Detection Method: A Survey
- Calibrating AdaBoost for phoneme classification
- CORES: fusion of supervised and unsupervised training methods for a multi-class classification problem
- scientific article; zbMATH DE number 1931832 (Why is no real title available?)
- On the measurement complexity of differentially private query answering
- A multi-objective optimisation approach for class imbalance learning
- Top-down decision tree learning as information based boosting
- Classification confidence weighted majority voting using decision tree classifiers
- A reconfigurable architecture for rotation invariant multi-view face detection based on a novel two-stage boosting method
- Boosting GARCH and neural networks for the prediction of heteroskedastic time series
- Adaptive sampling for large scale boosting
This page was built for publication: Improved boosting algorithms using confidence-rated predictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969321)
