This paper reviews metrics for evaluating multi-class classification models.
problem Evaluating and comparing multi-class classification models.
method Review and analysis of metrics.
result Promising multi-class metrics are highlighted and their usages are demonstrated.
The paper discusses building ETF risk models using a multilevel classification taxonomy.
problem Building accurate risk models for ETFs.
method First, build a multilevel classification taxonomy for ETFs. Then, use this taxonomy to define risk factors and build risk models.
result The approach can accurately classify and model ETF risks.
New method uses graph generative models for graph classification.
problem Graph classification for non-relational i.i.d. data.
method Derive classification formulas from GGM, train generative graph auto-encoder model.
result New conditional ELBO for training graph auto-encoder model.
New machine learning model faster, more accurate, and can identify hard-to-classify samples.
problem Improving classification models in machine learning.
method Quadratic Multiform Separation approach.
result Produces comparable predictive accuracy, runs faster, and identifies hard-to-classify samples.
In Bayesian classification, it is important to establish a probabilistic model for each class for likelihood estimation. Most of the previous methods modeled the probability distribution in the whole sample space. However, real-world problems are usually too complex to model in the whole sample space; some fundamental …
This thesis evaluates text-based vs audio-based classification of mental health interviews.
problem Classifying psychiatric illness using text-based methods.
method Design and evaluate a text classification network on mental health interviews, using belabBERT.
result Text-based classification is a strong alternative to audio-based methods.
Graphs can be fooled by small edge changes, but this work protects them.
problem Adversaries can manipulate graph data to mislead graph classification models.
method We introduce a smoothed graph classification model with a robustness guarantee.
result The smoothed model maintains consistent predictions under small adversarial perturbations.
This work bounds classification error in machine learning for low Bayes error conditions.
problem Understanding the error mismatch between Bayes error and model-based classification error.
method Applying classification error bounds to study the relationship with Kullback-Leibler divergence and proposing a linear approximation for low Bayes error conditions.
result A linear approximation of the classification error bound for low Bayes error conditions is proposed.
Sentiment classification is an important process in understanding people's perception towards a product, service, or topic. Many natural language processing models have been proposed to solve the sentiment classification problem. However, most of them have focused on binary sentiment classification. In this paper, we u…
This study integrates cost-sensitive and causal classification methods.
problem Improving classification model performance in business decision-making.
method A unifying evaluation framework for cost-sensitive and causal classification.
result Conventional classification is a specific case of causal classification.
Enhances graph classification models on small datasets.
problem Over-fitting and undergeneralization on small-scale benchmark datasets.
method Data augmentation via graph structure transformation and model evolution framework.
result Average improvement of 3 - 13% accuracy on graph classification tasks.
Deep learning models outperform classical methods in text classification.
problem Improving text classification accuracy using deep learning.
method Comprehensive review of deep learning models and datasets for text classification.
result Deep learning models outperform classical methods on various text classification tasks.
Evaluates deep learning models in histopathology for robustness and classification strategies.
problem Lack of comprehensive evaluation of histopathology models beyond accuracy.
method Developed a new methodology to evaluate models on five histopathology datasets, including vision transformers and CNNs.
result Identified insights into cancer classification strategies and robustness against stain variations.
New scoring rules improve probabilistic classification model evaluation.
problem Traditional scoring rules misalign with the preference for correct classifications.
method Introduces Penalized Brier Score (PBS) and Penalized Logarithmic Loss (PLL) to modify proper scoring rules.
result PBS and PLL better identify optimal checkpoints and early stopping points, leading to superior F1 scores.
Paper reduces neural network complexity for image classification.
problem High computational complexity in deep neural networks.
method Proposes a two-step classification process: coarse-grain and fine-grain.
result Achieves similar accuracy with less computational complexity.
Recent algorithms with state-of-the-art few-shot classification results start their procedure by computing data features output by a large pretrained model. In this paper we systematically investigate which models provide the best representations for a few-shot image classification task when pretrained on the Imagenet …
Comment classification on cookery channels using BERT and traditional models.
problem Volume of multilingual comments, variable lengths, slang, symbols, and abbreviations make comment classification challenging.
method Evaluated traditional machine learning models (Naive Bayes, KNN, SVM, Random Forest, Decision Trees) and BERT-based models (BERT, DISTILBERT, XLM) for multilingual comment classification.
result XLM was the top-performing BERT model with an accuracy of 67.31, while Random Forest with Term Frequency Vectorizer was the best traditional model with 63.59 accuracy.
GE2E-AC improves accent classification by focusing on accent embeddings.
problem Training models to predict accent type can lead to learning irrelevant features.
method GE2E-AC trains models to extract accent embeddings, making them closer for the same accent class.
result GE2E-AC outperforms baseline models trained with conventional loss.
We develop a novel probabilistic generative model based on the variational autoencoder approach. Notable aspects of our architecture are: a novel way of specifying the latent variables prior, and the introduction of an ordinality enforcing unit. We describe how to do supervised, unsupervised and semi-supervised learnin…
Over the past decade, multivariate time series classification has received great attention. We propose transforming the existing univariate time series classification models, the Long Short Term Memory Fully Convolutional Network (LSTM-FCN) and Attention LSTM-FCN (ALSTM-FCN), into a multivariate time series classificat…
Bayesian framework improves ML classification models' uncertainty estimates.
problem Ensuring trustworthy AI predictions with explicit uncertainty quantification.
method Proposes a Bayesian framework for generative ML classification models that accounts for input measurement uncertainty.
result The BQDA model outperforms other models in terms of interpretability, explicit uncertainty modeling, and computational efficiency.
Music genre classification is an essential tool for music information retrieval systems and it has been finding critical applications in various media platforms. Two important problems of the automatic music genre classification are feature extraction and classifier design. This paper investigates inter-genre similarit…
Interactive tool helps choose and understand classification metrics.
problem Common metrics for binary classification have limitations.
method Graphical application to visualize and explore evaluation metrics.
result Promotes careful attention to interpretation of metrics.
The paper analyzes how overparameterized models can generalize well in multiclass classification.
problem Generalization in multiclass classification with overparameterized models.
method Survival/contamination analysis framework adapted for multiclass classification.
result Multiclass classification can generalize well even with many classes, unlike regression tasks.
A framework for causal classification using uplift and causal heterogeneity methods.
problem Predicting the effect of interventions on different individuals from data.
method Causal classification framework using off-the-shelf supervised methods.
result Framework works for causal classification and uplift modelling, competitive with other methods.
Classification on imbalanced datasets is a challenging task in real-world applications. Training conventional classification algorithms directly by minimizing classification error in this scenario can compromise model performance for minority class while optimizing performance for majority class. Traditional approaches…
This work proposes the Bregman-Tweedie classification model and analyzes the domain structure of the extended exponential function, an extension of the classic generalized exponential function with additional scaling parameter, and related high-level mathematical structures, such as the Bregman-Tweedie loss function an…
Develops logic programs for explaining classification model decisions.
problem Creating explanations for decisions made by classification models.
method Answer-set programs for computing counterfactual interventions.
result Maximum responsibility causal explanations can be computed.
Selective classification can worsen accuracy disparities between groups.
problem Selective classification can magnify existing accuracy disparities between various groups.
method Study of margin distribution and distributionally-robust models.
result Selective classification can uniformly improve each group on distributionally-robust models.
Directly compute classification by learning features with class scores.
problem Classification efficiency and accuracy on various datasets.
method PCA for feature encoding, supervised learning model with encoder-decoder structure.
result Effective classification performance on multiple datasets.
New method visualizes decision boundaries of classification models.
problem Difficulty in understanding how classification models interpret data.
method Hybrid supervised-unsupervised technique for visualizing decision boundaries.
result Provides interpretable maps for qualitative and quantitative analysis.
Adversarial Reprogramming has demonstrated success in utilizing pre-trained neural network classifiers for alternative classification tasks without modification to the original network. An adversary in such an attack scenario trains an additive contribution to the inputs to repurpose the neural network for the new clas…
UniShape improves time series classification by selecting relevant subsequences.
problem Classifying time series data requires capturing interpretable shapelets.
method UniShape uses a shape-aware adapter to aggregate multiscale subsequences into class tokens.
result UniShape achieves state-of-the-art classification performance.
Unified framework improves fair classification by selecting representative data points.
problem Improving fair classification outcomes in the presence of unintentional biases.
method Develops a unified framework to jointly optimize accuracy and fairness, recasting as mixed-integer convex programs.
result The framework can be used to enhance classification fairness by selecting more representative data points.
Bayesian optimisation method targets graph classification models against adversarial attacks.
problem Adversarial attacks on graph classification models, especially for graph-level tasks.
method Bayesian optimisation-based attack method for graph classification models.
result Effectiveness and flexibility of the proposed method validated on various graph classification tasks.
Diffusion models learn balanced data representations, unlike classification models.
problem Understanding feature learning in diffusion models.
method Proposed a feature learning framework to analyze diffusion models' training dynamics.
result Diffusion models encourage learning balanced and comprehensive representations.
GMM-HMMs improve malware classification compared to discrete HMMs.
problem Improving malware classification accuracy using GMM-HMM models.
method Used GMM-HMM models for opcode and entropy-based features comparison with discrete HMMs.
result GMM-HMMs generally improve significantly on entropy-based features classification results.
Study improves adversarial classification using distributionally robust models.
problem Improving robustness against adversarial attacks in classification models.
method Distributionally robust chance constraints with Wasserstein ambiguity, reformulated as a regularized ramp loss minimization problem.
result Standard descent methods can converge to the global minimizer for the distributionally robust adversarial classification model.
MPSA-DenseNet improves accent classification accuracy.
problem Accurate English accent identification.
method Combines multi-task learning and PSA attention mechanism with DenseNet.
result MPSA-DenseNet outperforms other models in accent classification.
This paper discovers classification models from sequential data without prior knowledge.
problem Lack of prior knowledge in defining kernels for online classification.
method Adapts GP-based time-series structure discovery with SMC to learn new features from sequential data.
result Improves classification accuracy by 10% on real-world data.
A new network-based high-level data classification method using betweenness centrality.
problem Traditional data classification techniques focus on physical features, while high-level classification considers semantic meaning.
method Proposes a network-based high-level classification technique using betweenness centrality.
result Competent classification performance in nine real datasets compared to traditional models.
Time series classification models have been garnering significant importance in the research community. However, not much research has been done on generating adversarial samples for these models. These adversarial samples can become a security concern. In this paper, we propose utilizing an adversarial transformation …
Neural networks improve functional data classification.
problem Lack of effective classification methods for functional data.
method Extended deep learning methodologies to functional data for classification.
result Demonstrated superior performance in spectrographic data classification.
This paper explores vulnerabilities in hierarchical graph pooling neural networks for graph classification.
problem Vulnerability of hierarchical graph pooling neural networks in graph classification tasks.
method Proposes an adversarial attack framework using a surrogate model to generate adversarial samples.
result Adversarial samples can fool hierarchical GNN-based graph classification models, demonstrating their vulnerability.
Study selective classification with halfspaces, achieving error bounds under Gaussian distributions.
problem Modeling relationships in subsets of data defined by selection rules.
method Sparse linear classifiers for subsets defined by halfspaces, focusing on Gaussian feature distributions.
result First PAC-learning algorithm for homogeneous halfspace selectors with error guarantee $\bigO*{\sqrt{\mathrm{opt}}}$.
DeepJet improves jet flavor classification and quark-gluon tagging.
problem Jet flavor classification in high-energy physics experiments.
method Proposes a novel deep learning architecture, DeepJet, for improved performance.
result Improves heavy flavor classification performance and extends to quark-gluon tagging.
Data in real-world application often exhibit skewed class distribution which poses an intense challenge for machine learning. Conventional classification algorithms are not effective in the case of imbalanced data distribution, and may fail when the data distribution is highly imbalanced. To address this issue, we prop…
Pattern sampling reduces time series classification complexity.
problem High computational complexity of exhaustive search for shapelets.
method Pattern sampling using a weighted trie to extract discriminative patterns.
result Significant reduction in computational and memory resources.