AdaBoost.MH

swMATH8517MaRDI QIDQ20526FDOQ20526

Author name not available (Why is that?)

Described by source

• A decision-theoretic generalization of on-line learning and an application to boosting

Cited In (only showing first 100 items - show all)

• Multi-group support vector machines with measurement costs: A biobjective approach
• Least angle regression. (With discussion)
• Regularization of case-specific parameters for robustness and efficiency
• Modeling churn using customer lifetime value
• A reference model for customer-centric data mining with support vector machines
• Improving nonparametric regression methods by bagging and boosting.
• Title not available (Why is that?)
• Extracting certainty from uncertainty: regret bounded by variation in costs
• Boosting the margin: a new explanation for the effectiveness of voting methods
• The Application of Hidden Markov Models in Speech Recognition
• Does modeling lead to more accurate classification? A study of relative efficiency in linear classification
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• Supervised classification and mathematical optimization
• \textsc{Rankboost} \(+\): an improvement to \textsc{Rankboost}
• Statistical challenges with high dimensionality: feature selection in knowledge discovery
• Support vector machines based on convex risk functions and general norms
• The boosting approach to machine learning: an overview
• Evidential calibration of binary SVM classifiers
• Not so naive Bayes: Aggregating one-dependence estimators
• Arcing classifiers. (With discussion)
• Measures of diversity in classifier ensembles and their relationship with the ensemble accuracy
• Ensembling neural networks: Many could be better than all
• Performance of empirical risk minimization in linear aggregation
• Inducing wavelets into random fields via generative boosting
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Quadratic boosting
• Boosting and instability for regression trees
• Improved boosting algorithms using confidence-rated predictions
• Multicategory large margin classification methods: hinge losses vs. coherence functions
• A likelihood-based boosting algorithm for factor analysis models with binary data
• Cross-conformal predictors
• Variable selection for nonparametric Gaussian process priors: Models and computational strategies
• ADtreesLogit model for customer churn prediction
• Boosting with early stopping: convergence and consistency
• T3C: improving a decision tree classification algorithm's interval splits on continuous attributes
• Accelerated gradient boosting
• Estimator selection and combination in scalar-on-function regression
• Feature selection filter for classification of power system operating states
• Comment on: Boosting algorithms: regularization, prediction and model fitting
• Ensemble quantile classifier
• Title not available (Why is that?)
• An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
• Step decision rules for multistage stochastic programming: a heuristic approach
• BART: Bayesian additive regression trees
• Cost-sensitive boosting algorithms: do we really need them?
• Small area estimation of the homeless in Los Angeles: an application of cost-sensitive stochastic gradient boosting
• PBoostGA: pseudo-boosting genetic algorithm for variable ranking and selection
• Robust boosting with truncated loss functions
• Regret in the on-line decision problem
• Computer Vision - ECCV 2004
• A probabilistic model of classifier competence for dynamic ensemble selection
• Title not available (Why is that?)
• On PAC learning algorithms for rich Boolean function classes
• Accurate tree-based missing data imputation and data fusion within the statistical learning paradigm
• ML-KNN: A lazy learning approach to multi-label learning
• An iterative mixed integer programming method for classification accuracy maximizing discriminant analysis
• Cost-sensitive boosting for classification of imbalanced data
• Boosting algorithms: regularization, prediction and model fitting
• Online multiple kernel classification
• Boosting. Foundations and algorithms.
• Simultaneous adaptation to the margin and to complexity in classification
• Random classification noise defeats all convex potential boosters
• Randomized Gradient Boosting Machine
• Combining Pattern Classifiers
• Multi-class AdaBoost
• Nonparametric multiple expectile regression via ER-Boost
• Learn\(^{++}\).MF: A random subspace approach for the missing feature problem
• A stochastic approximation view of boosting
• Classification in general finite dimensional spaces with the \(k\)-nearest neighbor rule
• 10.1162/15324430260185628
• Conditional validity of inductive conformal predictors
• The Bayesian additive classification tree applied to credit risk modelling
• Another Look at Distance-Weighted Discrimination
• Wrappers for feature subset selection
• Angle-based cost-sensitive multicategory classification
• Veridical data science
• LPiTrack: eye movement pattern recognition algorithm and application to biometric identification
• Classification of imbalanced data with a geometric digraph family
• Learning customized and optimized lists of rules with mathematical programming
• gBoost: a mathematical programming approach to graph classification and regression
• A combination selection algorithm on forecasting
• Theory of Classification: a Survey of Some Recent Advances
• Extremely randomized trees
• The composite absolute penalties family for grouped and hierarchical variable selection
• Boosting additive models using component-wise P-splines
• Recent developments in bootstrap methodology
• Robust regression using biased objectives
• Learning to Rank for Information Retrieval
• Mathematical optimization in classification and regression trees
• Cost-sensitive ensemble learning: a unifying framework
• No regret learning in oligopolies: Cournot vs. Bertrand
• Statistical Learning of Multi-view Face Detection
• Identifying the interacting positions of a protein using Boolean learning and support vector machines
• Labeled Compression Schemes for Extremal Classes
• An improved branch-and-bound method for maximum monomial agreement
• Tutorial series on brain-inspired computing. VI: Geometrical structure of boosting algorithm
• Terminated Ramp--Support Vector machines: A nonparametric data dependent kernel
• From cluster ensemble to structure ensemble
• Tree models for difference and change detection in a complex environment
• Deep neural networks, gradient-boosted trees, random forests: statistical arbitrage on the S\&P 500

This page was built for software: AdaBoost.MH