The paper briefly introduces multiple classifier systems and describes a new algorithm, which improves classification accuracy by means of recommendation of a proper algorithm to an object classification. This recommendation is done assuming that a classifier is likely to predict the label of the object correctly if it…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
169,181 papers · 148 categories
Trend · papers per month
48 results for “multiple classifier systems”
Can we manipulate multiple deep neural networks simultaneously?
problem Selective fooling of multiple machine learning systems.
method Formulated as a novel optimization problem.
result It is easy to selectively manipulate multiple MNIST classifiers simultaneously.
Study focuses on classifying special geometric structures.
problem Classify singular affine structures of integrable systems.
method Classification through simple semitoric systems equivalence.
result Counterexamples exist for multiple pinched fibers.
Paper proposes a new method to compare classifiers across multiple datasets.
problem Comparing classifiers over multiple datasets with multiple criteria.
method Adopting decision theory, the paper introduces generalized stochastic dominance for ranking classifiers.
result Generalized stochastic dominance can be used to rank classifiers and statistically tested.
ICE improves classification performance by leveraging internal patterns among instances.
problem Inconsistent results for different MCS algorithms on specific problems.
method ICE groups training data into overlapping clusters, builds classifiers for each cluster, and predicts class labels by averaging predictions from top-performing models.
result ICE provides a stable improvement on a significant proportion of datasets over existing MCS methods.
A multiple classifiers fusion localization technique using received signal strengths (RSSs) of visible light is proposed, in which the proposed system transmits different intensity modulated sinusoidal signals by LEDs and the signals received by a Photo Diode (PD) placed at various grid points. First, we obtain some {\…
DS techniques outperform K-NN in classification accuracy.
problem Improving classification performance using multiple classifier systems.
method Dynamic Selection (DS) compared to K-NN, focusing on neighborhood quality and instance hardness.
result DS techniques achieve higher classification accuracy than K-NN.
Improves accuracy and fairness in prediction systems with multiple domain experts.
problem Designing unbiased and accurate deferral systems with multiple experts.
method Proposes a framework for learning a classifier and deferral system that chooses to defer to multiple human experts.
result Significantly improves accuracy and fairness of final predictions compared to baselines.
Adversarial Attacks with Multiple Antennas Against Deep Learning-Based Modulation Classifierseess.SP
Adversaries with multiple antennas can fool deep learning modulators more effectively.
problem Improving evasion attacks on deep learning-based modulation classifiers.
method Utilizing multiple antennas to enhance adversarial attacks on deep learning classifiers.
result Adversarial attacks with multiple antennas significantly improve classifier accuracy.
Practical Compositional Fairness: Understanding Fairness in Multi-Component Recommender Systemscs.LG
The paper explores fairness in multi-component recommender systems.
problem How to ensure fairness in recommender systems composed of multiple models.
method Study of fairness ranking metrics, theoretical analysis, and empirical evaluation.
result Fairness in recommendation systems can be achieved by improving individual components.
The Allen-Cahn system on manifolds yields multiple phase distributions.
problem Finding the number of solutions to the Allen-Cahn system on manifolds.
method Volume-fixing variations approach to classify isoperimetric clusters.
result The number of solutions is bounded by topological invariants for parallelizable manifolds.
A deep learning system classifies hyperspectral images using denoising autoencoders and pixel mixtures.
problem Hyperspectral image segmentation and classification challenges.
method Multiple class-based denoising autoencoders, mixed pixel training augmentation, and morphological operations.
result High performance on the Salinas dataset, verified by deep neural network and morphological hole-filling.
Face recognition system trained with noisy labels.
problem Label noise in training deep learning classifiers.
method Review and apply recent methods to manage noisy annotations.
result Improved performance of face recognition system with noisy labels.
Crowdsourcing infers ground truth from multiple annotators, verified for supervised learning.
problem Obtaining universally valid ground truth for supervised learning is challenging and costly.
method Gather multiple annotations from diverse individuals, verify and aggregate for training classifiers.
result Inferred ground truth improves classifier performance in sensitive tasks like mitosis detection.
Brain signal variability in the measurements obtained from different subjects during different sessions significantly deteriorates the accuracy of most brain-computer interface (BCI) systems. Moreover these variabilities, also known as inter-subject or inter-session variabilities, require lengthy calibration sessions b…
This work improves deep learning from noisy crowdsourced labels.
problem Learning label correction and neural classifier from noisy crowdsourced data.
method Coupled Cross-Entropy Minimization (CCEM) with identifiability and regularization.
result The CCEM criterion correctly identifies annotators' confusion and neural classifier under realistic conditions.
Develops counterfactual visual explanations to show how images could change to classify differently.
problem Creating understandable explanations for vision system predictions.
method Selects a distractor image and identifies spatial regions to modify for different classification.
result Users trained with counterfactual explanations perform better in fine-grained bird classification.
We present a probabilistic method for linking multiple datafiles. This task is not trivial in the absence of unique identifiers for the individuals recorded. This is a common scenario when linking census data to coverage measurement surveys for census coverage evaluation, and in general when multiple record-systems nee…
Optimal adversarial noise algorithms for multiple classifiers using game theory.
problem Designing robust attacks against multiple classifiers.
method Formulating the problem as a two-player, zero-sum game and using Multiplicative Weights Update framework with best response oracles.
result Demonstrated the effectiveness of randomization in adversarial attacks and optimal mixed strategies.
New GM functions improve classifier ensemble accuracy.
problem Improving classifier ensemble accuracy.
method Using generalized mixture functions with dynamic weights.
result Gains in performance compared to traditional methods.
System detects multiple patients' behaviors in real-time using mmWave radar and CNN.
problem Real-time patient behavior monitoring in hospitals.
method Used mmWave radar for tracking and collecting Doppler patterns. Created a three-layer CNN model for behavior classification.
result System achieved very good inference accuracy in predicting patient behaviors in real-time.
New classifier combines locally linear kernels for fast and accurate non-linear classification.
problem Developing a fast and accurate non-linear classifier.
method Combines locally linear classifiers using a Multiple Kernel Learning (MKL) problem with scalable MKL training for streaming kernels.
result The resulting classifier achieves high accuracy with fast inference time.
New method defends against multiple perturbation models in adversarial attacks.
problem Defending against multiple types of adversarial attacks.
method Developed a natural generalization of PGD-based procedure to incorporate multiple perturbation models.
result Trained robust models against , , and attacks, achieving 47.0% adversarial accuracy on CIFAR10.
Classifies compact multiplicity free quasi-Hamiltonian manifolds.
problem Classifying compact, multiplicity free, quasi-Hamiltonian manifolds.
method Symplectic reductions and Lie group analysis.
result Recover old and find new examples of these structures.
Interpretable semantic textual similarity (iSTS) task adds a crucial explanatory layer to pairwise sentence similarity. We address various components of this task: chunk level semantic alignment along with assignment of similarity type and score for aligned chunks with a novel system presented in this paper. We propose…
System accurately identifies birds in real-world settings.
problem Identifying birds in diverse, realistic environments.
method Trained kNN and SVM classifiers on crowd-sourced audio data.
result Both classifiers perform similarly, with kNN offering flexibility.
The paper classifies symmetric triads with multiplicities and their applications.
problem Classifying symmetric triads with multiplicities and their applications.
method Developed the theory of symmetric triads with multiplicities, classified abstract triads, and determined corresponding triads for commutative compact triads.
result Classified symmetric triads with multiplicities and their applications.
Optimal adversarial attacks minimize mutual information, revealing classifier vulnerabilities.
problem Designing optimal attacks to degrade machine learning performance.
method Information-theoretic approach to finding optimal perturbations.
result Optimal attacks minimize mutual information between degraded and original signals.
Improved spoken English intelligibility with computer recognition and feature extraction.
problem Improving spoken English pronunciation and intelligibility.
method Automatic speech recognition using PocketSphinx alignment and feature extraction with SVM classifier probability prediction.
result SVM models achieve 82 percent agreement with human transcriptions, up from 75 percent.
This work studies fairness in systems of multiple algorithms, addressing pitfalls and constructing fair compositions.
problem Fairness of scoring and classification algorithms in systems of multiple algorithms.
method Identifying and addressing pitfalls of naive composition, constructing fair compositions for individual and group fairness.
result Fairness properties of systems of multiple fair algorithms are not necessarily preserved under composition.
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…
Paper proposes a time-frequency analysis method for blind modulation classification in MIMO systems.
problem Blind modulation classification in MIMO systems with overlapping signals and unknown channel parameters.
method Time-frequency analysis using windowed short-time Fourier transform, conversion to RGB spectrogram images, convolutional neural network for classification, decision fusion.
result Proposed scheme achieves high classification accuracy at different SNRs, outperforming existing methods.
Transfer Learning and Meta Classification Based Deep Churn Prediction System for Telecom Industrycs.LG
Proposes a deep learning churn prediction system for telecom using TL and meta-classification.
problem Churn prediction challenges in telecom due to large data, high dimensions, and imbalanced data.
method Transfer Learning (TL) and Ensemble-based Meta-Classification. Two stages: TL on Deep CNNs, then GP-AdaBoost meta-classifier.
result TL-DeepE system achieved 75.4% and 68.2% prediction accuracy on Orange and Cell2cell datasets, respectively.
New system detects pain from facial AU combinations using MIL and MCIL.
problem Detecting pain from facial expressions reliably.
method Weakly supervised learning, multiple instance learning, multiple clustered instance learning.
result 87% pain recognition accuracy on UNBC-McMaster Shoulder Pain Expression dataset.
Visualizes information flow in ML systems for better understanding and analysis.
problem Understanding the flow of information in complex ML systems.
method Proposes a visual approach using Sankey Diagrams to analyze flow of information.
result Demonstrates the effectiveness of the proposed technique in diagnosing model performance.
ConvNet classifies whale vocalizations and ambient noise in acoustic recordings.
problem Automated detection and classification of marine mammal vocalizations in acoustic recordings.
method Convolutional Neural Network with a novel acoustic representation.
result Classifier accurately detects and classifies whale vocalizations and ambient noise.
ActiveLab improves classifier accuracy with fewer annotations by re-labeling.
problem Imperfect labels from multiple annotators in real-world data.
method ActiveLab automatically decides when to re-label examples for better classifier training.
result ActiveLab trains more accurate classifiers with fewer annotations.
StylEx trains a GAN to explain classifier decisions in StyleSpace.
problem Creating meaningful image-specific explanations for classifier decisions.
method Training a StyleGAN to learn a classifier-specific StyleSpace, incorporating the classifier model.
result StylEx finds attributes that align with semantic ones and generates human-interpretable explanations.
Introduces Rashomon Capacity to measure predictive multiplicity in probabilistic classifiers.
problem Predictive multiplicity in classification models leading to unjustified decisions.
method Introduces Rashomon Capacity, a metric for probabilistic classifiers, and provides a rigorous derivation.
result Rashomon Capacity captures nuanced score variations and provides strategies for disclosing conflicting models.
Most existing fingerprints-based indoor localization approaches are based on some single fingerprints, such as received signal strength (RSS), channel impulse response (CIR), and signal subspace. However, the localization accuracy obtained by the single fingerprint approach is rather susceptible to the changing environ…
We formalize AURC and develop estimators for SC systems.
problem Evaluation of SC systems' performance.
method Formal statistical formulation, Monte Carlo methods, plug-in estimators.
result Plug-in estimators are consistent, with low bias and bounded MSE.
New classifiers ensure fairness by adjusting a base classifier's operating characteristics.
problem Ensuring fairness in binary classification with multiple group constraints.
method Intervening directly on a base classifier's operating characteristics using group-wise ROC convex hulls and post-processing.
result Methods satisfy multiple fairness constraints (DP, EO, PP) with minimal interventions and near-oracle accuracy.
Mobile agents classify images via reinforcement learning and consensus.
problem Image classification using multiple mobile agents.
method Proposed network architecture for local belief formation and feature extraction. Decentralized consensus protocol using reinforcement learning.
result Effectiveness of the proposed framework demonstrated on MNIST dataset.
Bayesian model fuses multiple classifiers with explicit correlation modeling.
problem Combining outputs of multiple classifiers with explicit correlation.
method Hierarchical Bayesian model with correlated Dirichlet distribution.
result Fused classifier performance can be Bayes optimal even for highly correlated base classifiers.
Proposes a new scoring function for linear classifiers to improve object positioning in feature space.
problem Lack of information about relative positions of recognized objects in feature space.
method Calculates a scoring function based on object distance from decision boundary and class centroid.
result Demonstrates effectiveness of the proposed method compared to other ensemble algorithms on multiple datasets.
Improved average distance classifier for HDLSS settings with multiple population differences.
problem Poor performance of average distance classifier in HDLSS settings with location and scale differences.
method Proposed transformations to the average distance classifier to handle multiple population differences.
result The proposed classifiers perform well even when populations differ in other aspects than location and scale.
The paper introduces a method to find multiple interpretable classifiers from a dataset.
problem Finding multiple accurate classifiers that are also interpretable.
method Introduces a method to identify a maximal set of distinct but accurate models for a dataset.
result Empirically demonstrates simpler, more interpretable classifiers are recovered.
Building Diversified Multiple Trees for Classification in High Dimensional Noisy Biomedical Datacs.LG
It is common that a trained classification model is applied to the operating data that is deviated from the training data because of noise. This paper demonstrates that an ensemble classifier, Diversified Multiple Tree (DMT), is more robust in classifying noisy data than other widely used ensemble methods. DMT is teste…