Improved dynamic classifier selection by refining regions of competence.
problem Limited performance of dynamic selection systems due to noisy regions.
method Integrates a filter and an adaptive distance to enhance regions of competence.
result Significant increase in recognition performance and decrease in computational cost.
META-DES.H selects competent classifiers using meta-learning and dynamic weighting.
problem Selecting competent classifiers in dynamic ensemble selection.
method META-DES framework using meta-learning and dynamic weighting.
result Improvements in recognition accuracy on 30 datasets.
Meta-DES uses meta-learning to dynamically select competent classifiers for ensemble learning.
problem Dynamic selection of classifiers based on limited training data.
method Meta-learning approach to estimate competence of classifiers using multiple meta-features.
result Meta-DES significantly improves classification accuracy compared to existing techniques.
New robustness metric helps select reliable classifiers.
problem Evaluating reliability of classifier predictions.
method Proposed new robustness metric for any classifier and feature type.
result Demonstrated ability to distinguish reliable from unreliable predictions.
A meta-learning framework for dynamic ensemble selection.
problem Improving dynamic ensemble selection for classification tasks.
method Proposes a three-step framework using meta-learning to select competent classifiers.
result Problem-dependent scenario yields the best performance.
Prototype selection improves DS techniques' accuracy and reduces computational cost.
problem Improving the performance of dynamic selection techniques.
method Prototype selection techniques that edit validation data to remove noise and redundant instances.
result Improves DS techniques' classification accuracy and reduces computational cost.
Dynamic ensemble selection (DES) techniques work by estimating the level of competence of each classifier from a pool of classifiers. Only the most competent ones are selected to classify a given test sample. Hence, the key issue in DES is the criterion used to estimate the level of competence of the classifiers in pre…
Enhances DES by removing noise and defining regions more accurately.
problem Incompetent classifier selection in noisy regions and true indecision regions.
method FIRE-DES++ uses equal number of samples from each class and removes noise to define regions more accurately.
result FIRE-DES++ outperforms FIRE-DES and state-of-the-art DES frameworks.
A new method selects the best ensemble for concept drift detection.
problem Concept drift detection in data streams.
method Dynamic ensemble selection focusing on decisionspace.
result Highest detection precision and lowest false alarms.
Aerial robot estimates human pose and path using dynamic classifier selection.
problem Estimating human pose and trajectory from aerial video.
method Dynamic classifier selection architecture; perspective correction; HOG and CNN features; 64 pose-viewpoint classes.
result Dynamic classifier selection improves efficiency and accuracy.
META-DES.Oracle uses meta-learning and feature selection to improve ensemble selection accuracy.
problem Dynamic Ensemble Selection (DES) issues with classifier competence estimation.
method META-DES.Oracle integrates multiple criteria and an Oracle-based meta-feature selection scheme.
result META-DES.Oracle significantly improves classification accuracy compared to previous methods.
This paper analyzes dynamic ensemble selection and preprocessing for multi-class imbalanced datasets.
problem Class imbalance in multi-class datasets where majority classes have more instances.
method Examined dynamic selection techniques and data preprocessing methods for multi-class imbalanced problems.
result Dynamic ensemble improves AUC and G-mean compared to static ensemble.
Multiple classifier systems focus on the combination of classifiers to obtain better performance than a single robust one. These systems unfold three major phases: pool generation, selection and integration. One of the most promising MCS approaches is Dynamic Selection (DS), which relies on finding the most competent c…
Class-imbalance refers to classification problems in which many more instances are available for certain classes than for others. Such imbalanced datasets require special attention because traditional classifiers generally favor the majority class which has a large number of instances. Ensemble of classifiers have been…
Proposes dynamic model type recommendation for OLP technique.
problem Limited local competence of base-classifiers in uneven data distributions.
method Builds a multi-label meta-classifier to recommend model types based on local data complexity.
result Statistically similar performance to original OLP with fixed base-classifier model.
Dynamic Ensemble Selection (DES) techniques aim to select locally competent classifiers for the classification of each new test sample. Most DES techniques estimate the competence of classifiers using a given criterion over the region of competence of the test sample (its the nearest neighbors in the validation set). T…
Dealing with uncertainty in Bayesian Network structures using maximum a posteriori (MAP) estimation or Bayesian Model Averaging (BMA) is often intractable due to the superexponential number of possible directed, acyclic graphs. When the prior is decomposable, two classes of graphs where efficient learning can take plac…
Dynamic Classifier Selection (DCS) techniques have difficulty in selecting the most competent classifier in a pool, even when its presence is assured. Since the DCS techniques rely only on local data to estimate a classifier's competence, the manner in which the pool is generated could affect the choice of the best cla…
A novel model-selection method for dynamic networks using synthetic data.
problem Classifying and understanding the growth mechanisms of dynamic networks.
method Training a classifier on synthetic network data generated by nine random graph models, using dynamic features that count new links.
result Achieves near-perfect classification of synthetic networks, outperforming state-of-the-art methods.
AER method improves classifier ensemble for imbalanced data.
problem Overfitting in dynamic ensemble selection for imbalanced data.
method Adaptive ensemble with implicit regularization and global geometry interpolation.
result AER method reduces overfitting and improves performance on imbalanced datasets.
Suppose some classifiers are selected from a set of hypothesis classifiers to form an equally-weighted ensemble that selects a member classifier at random for each input example. Then the ensemble has an error bound consisting of the average error bound for the member classifiers, a term for selectivity that varies fro…
Dynamic econometric models improve trading signals in momentum strategies.
problem Static momentum strategies are inefficient; dynamic models enhance accuracy.
method Dynamic binary classifier model to learn time-varying momentum importance.
result Dynamic classifier outperforms traditional naive time series momentum strategy.
Paper evaluates competence measures for DRS systems.
problem Choosing the best measure to quantify competence in DRS systems is challenging.
method Reviewed and adapted eight competence measures for regression problems, compared them on 15 datasets, and evaluated three DRS systems.
result DRS systems outperform individual regressors and static systems, but competence measure choice depends on the problem.
Temporal networks are ubiquitous and evolve over time by the addition, deletion, and changing of links, nodes, and attributes. Although many relational datasets contain temporal information, the majority of existing techniques in relational learning focus on static snapshots and ignore the temporal dynamics. We propose…
The paper addresses fairness issues in screening classifiers, proposing within-group monotonicity to avoid unfair treatment of qualified candidates.
problem Within-group unfairness in screening classifiers using calibrated models.
method Introducing within-group monotonicity as a property to avoid unfair treatment and developing an efficient post-processing algorithm based on dynamic programming.
result Within-group monotonicity can be achieved efficiently and often at a small cost, improving fairness without significantly compromising prediction accuracy.
Selective classification improves trading strategies by abstaining from predictions.
problem Designing effective trading strategies using selective classification.
method Extends binary or multi-class classifiers to allow abstaining from predictions, evaluates across different feature sets and classifiers.
result Selective classifiers can improve trading performance by avoiding poor predictions.
Improved stock trading model using feature selection and ensemble learning.
problem Challenges in making profit in the US stock market.
method Feature selection from 148 to 30, dynamic selection of top 25 features, ensemble learning with four classifiers.
result Best model generated 54.35% profit over 18 months.
Paper combines RL with classifiers to improve financial trading strategies.
problem Enhancing risk-return trade-offs in trading strategies.
method Combining Reinforcement Learning (RL) models with traditional classifiers like SVM, Decision Trees, and Logistic Regression.
result Ensemble methods often outperform base models in risk-adjusted returns.
Introduces greedy feature selection for classifier-dependent feature ranking.
problem Feature selection for classification tasks.
method Greedy feature selection, identifying the most important feature at each step based on the selected classifier.
result Theoretical and numerical benefits of greedy feature selection.
DiwE uses regional distribution changes to create diverse ensemble classifiers for concept drift.
problem Handling concept drift in evolving data streams.
method DiwE measures diversity based on regional distribution disagreement and uses it to weight instances and select classifiers.
result DiwE outperforms other algorithms on various synthetic and real-world data stream benchmarks.
Novel spam filter improves e-mail classification accuracy.
problem Uneven class distribution, unequal error cost, frequent content change, personalized discrimination.
method TFDCR feature selection, incremental learning, dynamic feature update.
result TFDCR outperforms in feature selection, incremental model improves classification accuracy.
Stability is an important aspect of a classification procedure because unstable predictions can potentially reduce users' trust in a classification system and also harm the reproducibility of scientific conclusions. The major goal of our work is to introduce a novel concept of classification instability, i.e., decision…
Enhances classifier performance through feature space transformations and model selection.
problem Improving the accuracy of classifiers by reducing complexity.
method Combining feature mapping, prototype selection, and kernel function transformations to transform data into a more convenient distribution.
result Our methods produce competitive classifiers and are statistically different among them.
Proposes a gradient-based variable selection method for binary classification in RKHS.
problem Variable selection in high-dimensional data analysis.
method Gradient-based representation of large-margin classifier with group-lasso penalty.
result Selection consistency and risk bound of the estimated classifier.
Subset selection improves weak supervision performance.
problem Optimizing the use of weakly-labeled data.
method Combining pretrained data representations with the cut statistic for subset selection.
result Subset selection improves weak supervision performance by up to 19%.
Sparse nearest-centroid classifiers detect relevant features for classification.
problem Classifying data with low computational cost and feature selection.
method Proposes ℓ1 and ℓ2 sparse variants of nearest-centroid classifiers. result Training sparse classifiers can be done exactly and at quasi-linear cost.
This study evaluates data pre-processing techniques for class imbalance in biomedical data.
problem Class imbalance in biomedical datasets affects model performance.
method Resampling and feature selection techniques evaluated using SVM, C4.5, LDA, and KNN classifiers.
result Feature Selection outperforms other methods in most cases, especially with SVM.
New analysis reveals gaps in selective classifiers, guiding improvements.
problem Improving selective classifiers to match perfect-ordering oracle performance.
method Formalized selective classification gap, decomposed into five sources of looseness.
result Monotone post-hoc calibration has limited impact on closing the gap.
SURI boosts features with high unique relevant information for better health data analysis.
problem Preserving interpretability in health data analysis.
method Mutual information-based feature selection (MIBFS) method called SURI.
result SURI selects more relevant features leading to higher classification performance.
Feature selection from wide datasets leads to misleading results.
problem Feature selection in wide datasets with few samples can lead to misleading results.
method Derived sample size requirement for declaring features different, used real datasets to illustrate issues.
result Feature selection from very wide datasets may lead to misleading results.
Designs an online selective sampling approach for choosing which model to use.
problem Active model selection for pre-trained classifiers in unlabeled data streams.
method Online selective sampling approach to query and label examples.
result High probability of outputting the best model with minimal label queries.
New model improves classifier security against evasion attacks by selecting features.
problem Security of machine learning classifiers against evasion attacks.
method Adversary-aware feature selection model incorporating specific adversary assumptions.
result Classifier security worsens with feature selection, but new model improves it.
Optimal scoring framework for kernel classification with feature selection.
problem Two-group classification problem.
method Optimal scoring framework, structured sparsity using weighted kernels, automated parameter selection.
result Superior classification performance compared to existing nonparametric classifiers.
VFDS selects dynamic features for efficient HAR tasks, optimizing performance-cost trade-offs.
problem Optimizing feature selection for varying costs and dynamic contexts in machine learning tasks.
method Bayesian learning framework with variational dynamic selection policy.
result VFDS selects different features under changing contexts, saving sensory costs while maintaining HAR accuracy.
This paper improves volatility forecasting using dynamic subset selection in genetic programming.
problem Improving accuracy of implied volatility forecasting.
method Dynamic training-subset selection methods applied to genetic programming.
result Dynamic subset selection improves predictive accuracy of genetic programming models.
Support vector data description (SVDD) is a popular technique for detecting anomalies. The SVDD classifier partitions the whole space into an inlier region, which consists of the region near the training data, and an outlier region, which consists of points away from the training data. The computation of the SVDD class…
Bayesian optimization improves classifier selection for acute infection and mortality.
problem Improving accuracy of acute infection and mortality prediction.
method Comparison of hyperparameter optimization methods (grid search, random sampling, Bayesian optimization).
result Bayesian optimization outperforms grid search or random sampling for in-hospital mortality classifiers.
Optimal number of voters for a voting ensemble can be estimated from the distribution of classifier errors.
problem Finding the optimal number of voters for a voting ensemble to minimize error rate.
method Estimate the distribution of classifier errors and infer error rates for different numbers of voters.
result Lower-variance estimates of error rates can be obtained by inferring them for different numbers of voters.