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)

• Combining initial segments of lists
• Online learning in online auctions
• Mathematical foundations of machine learning. Abstracts from the workshop held March 21--27, 2021 (hybrid meeting)
• Hybrid classification algorithms based on boosting and support vector machines
• Blasso for object categorization and retrieval: towards interpretable visual models
• Predicate logic based image grammars for complex pattern recognition
• Location discriminative vocabulary coding for mobile landmark search
• On the Bayes-risk consistency of regularized boosting methods.
• Learning to compete, coordinate, and cooperate in repeated games using reinforcement learning
• Ternary Bradley-Terry model-based decoding for multi-class classification and its extensions
• A simple extension of boosting for asymmetric mislabeled data
• Online variance minimization
• A game of prediction with expert advice
• Forecasting financial and macroeconomic variables using data reduction methods: new empirical evidence
• Generalized re-weighting local sampling mean discriminant analysis
• Sparse weighted voting classifier selection and its linear programming relaxations
• Risk bounds for CART classifiers under a margin condition
• Negative correlation in incremental learning
• A conversation with Leo Breiman.
• Title not available (Why is that?)
• Further results on the margin explanation of boosting: new algorithm and experiments
• Functional gradient ascent for probit regression
• Hierarchical linear support vector machine
• Improved customer choice predictions using ensemble methods
• Improved second-order bounds for prediction with expert advice
• Information theoretic combination of pattern classifiers
• Generalization bounds for averaged classifiers
• Practical speech emotion recognition based on online learning: from acted data to elicited data
• Stochastic boosting algorithms
• Stochastic boosting algorithms
• On a method for constructing ensembles of regression models
• Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms
• Looking for lumps: boosting and bagging for density estimation.
• Boosted manifold principal angles for image set-based recognition
• An extensive comparison of recent classification tools applied to microarray data
• Reducing forgeries in writer-independent off-line signature verification through ensemble of classifiers
• Direct kernel perceptron (DKP): ultra-fast kernel ELM-based classification with non-iterative closed-form weight calculation
• Method for quickly inferring the mechanisms of large-scale complex networks based on the census of subgraph concentrations
• Multi-label classification and extracting predicted class hierarchies
• Weight-selected attribute bagging for credit scoring
• Greedy optimization classifiers ensemble based on diversity
• Online learning from local features for video-based face recognition
• Mean and quantile boosting for partially linear additive models
• Process consistency for AdaBoost.
• A testing based extraction algorithm for identifying significant communities in networks
• Estimating classification error rate: repeated cross-validation, repeated hold-out and bootstrap
• Concept drift detection via competence models
• Deformation of log-likelihood loss function for multiclass boosting
• From information scaling of natural images to regimes of statistical models
• Variable selection and updating in model-based discriminant analysis for high dimensional data with food authenticity applications
• Cox process functional learning
• A cost-sensitive ensemble method for class-imbalanced datasets
• Supervised projection approach for boosting classifiers
• Analysis of boosting algorithms using the smooth margin function
• Projective morphoogies and their application in structural analysis of digital images
• Boosting conditional probability estimators
• On the difficulty of approximately maximizing agreements.
• Knee joint vibration signal analysis with matching pursuit decomposition and dynamic weighted classifier fusion
• If multi-agent learning is the answer, what is the question?
• Stable feature selection for biomarker discovery
• Hybrid cluster ensemble framework based on the random combination of data transformation operators
• A boosting method for maximization of the area under the ROC curve
• Multiple kernel boosting framework based on information measure for classification
• Linear programming in the semi-streaming model with application to the maximum matching problem
• 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
• 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
• Estimating a sharp convergence bound for randomized ensembles
• Optimization of tree ensembles
• A support vector machine-based ensemble algorithm for breast cancer diagnosis
• Boosting of granular models
• A robust approach to model-based classification based on trimming and constraints. Semi-supervised learning in presence of outliers and label noise
• Detection of differential item functioning in Rasch models by boosting techniques
• Breast cancer prediction using the isotonic separation technique
• Face detection with boosted Gaussian features
• Machine learning approaches for discrimination of extracellular matrix proteins using hybrid feature space
• Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback
• Optimal learning for sequential sampling with non-parametric beliefs
• Knowledge acquisition and development of accurate rules for predicting protein stability changes
• Self-improved gaps almost everywhere for the agnostic approximation of monomials
• A Fisher consistent multiclass loss function with variable margin on positive examples
• Performance improvement of classifier fusion for batch samples based on upper integral
• Committee polyhedral separability: complexity and polynomial approximation
• Deep learning of support vector machines with class probability output networks
• Boosting in the presence of noise
• Machine learning feature selection methods for landslide susceptibility mapping
• Fast pedestrian detection system with a two layer cascade of classifiers
• Soft-max boosting
• A local boosting algorithm for solving classification problems
• Using boosting to prune double-bagging ensembles

This page was built for software: AdaBoost.MH