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 number of possible methods of generalizing binary classification to multi-class classification increases exponentially with the number of class labels. Often, the best method of doing so will be highly problem dependent. Here we present classification software in which the partitioning of multi-class classification…
DOC3 learns from contradictions to improve deep one class classification.
problem Deep one class classification problems.
method Formalizes learning from contradictions for one class large-margin loss, proposes DOC3 algorithm.
result DOC3 incurs lower generalization error compared to traditional inductive learning.
Visualizes classification results with class maps.
problem Label bias in classification predictions.
method Class maps reflecting probability, distance, and mislabeling likelihood.
result Insight into classification results and data structure.
New algorithm boosts classification for imbalanced data.
problem Accurately classifying observations in severely imbalanced datasets.
method SAMME.C2 algorithm blending boosting and cost-sensitive techniques.
result Consistently superior performance in imbalanced classification problems.
Estimates neural network errors for classification problems.
problem Binary and multi-class classification problems.
method Rademacher complexity estimates and direct approximation theorems.
result A priori error estimates for regularized loss functionals.
Paper proposes GEG to enhance fairness in binary and multi-class classification.
problem Fairness in multi-class classification tasks is under-explored.
method Formulates multi-objective problem between effectiveness and fairness constraints, proposes GEG algorithm.
result GEG improves fairness up to 92% and decreases accuracy up to 14%.
SWRLDA improves LDA for multi-class classification with edge classes.
problem LDA's vulnerability to edge classes causing biased mean and large distances.
method Self-weighted robust LDA with l21-norm distance criterion.
result SWRLDA outperforms other methods on synthetic and real-world datasets.
Alternative method improves SVM for data classification.
problem SVM's weaknesses in time processing, optimization, multi-class generalization, and unbalanced classes.
method Minimum distance to optimal subspaces containing mapped classes.
result Improved performance with fewer shortcomings.
Improved multiclass classification with class-weighted nearest neighbors.
problem Multiclass classification with large or imbalanced classes.
method Class-weighted k-nearest neighbors algorithm, derived bounds on accuracy and risk.
result Optimized classification metrics like F1 score or Matthew's Correlation Coefficient.
C-HMCNN(h) improves HMC classification by leveraging class hierarchy.
problem Hierarchical multi-label classification with class hierarchy constraints.
method Exploits class hierarchy to produce coherent predictions for multi-label classification.
result C-HMCNN(h) outperforms state-of-the-art models in HMC classification.
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.
Study extends learnability equivalence to multi-class and regression, overcoming binary classification limits.
problem Equivalence of online and private learnability in multi-class and regression settings.
method Introduced a novel Littlestone dimension variant and threshold functions for multi-class classification.
result Online learnability implies private learnability in multi-class classification but not in regression.
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.
Unified approach to non-standard classification tasks.
problem Non-standard classification tasks like semi-supervised, positive-unlabelled, multi-positive-unlabelled and noisy-label learning.
method Probabilistic, unified approach training a classifier to predict label-distributions, then inferring class-distributions.
result Unified model for various non-standard classification tasks.
Paper addresses class imbalance in disk SMART dataset using GANs and genetic algorithms.
problem Class imbalance in disk SMART dataset.
method Data synthesised by multivariate GANs mixed with genetic algorithms.
result Higher disk fault classification prediction accuracy.
Paper investigates methods to improve classification by inducing a hierarchy from flat labels.
problem Improving classification performance on datasets lacking a natural hierarchy.
method The approach involves clustering conditional distributions and using a hierarchical classifier with the induced hierarchy.
result The methods can discover latent hierarchies and improve accuracy in various applications.
Extends PCVM for multi-class classification with improved accuracy.
problem Lack of probabilistic outputs and contradictory predictions in multi-class classification.
method Proposes mPCVM with two learning algorithms: top-down and bottom-up.
result Superior performance, especially with many classes, validated on synthetic and benchmark data.
Two new undersampling methods improve classification accuracy for imbalanced datasets.
problem Class imbalance and distributional differences in large datasets lead to biased models and poor predictive performance.
method Mutual information-based stratified simple random sampling and support points optimization.
result Empirical results show higher balanced classification accuracy compared to traditional techniques.
Study identifies pitfalls in assessing hierarchies for multi-class classification.
problem Lack of understanding in selecting hierarchies for multi-class classification.
method Analyzed and compared popular approaches to extracting hierarchies.
result Hierarchy quality becomes irrelevant when using powerful classifiers.
Due to myriads of classes, designing accurate and efficient classifiers becomes very challenging for multi-class classification. Recent research has shown that class structure learning can greatly facilitate multi-class learning. In this paper, we propose a novel method to learn the class structure for multi-class clas…
This work improves metric learning models by incorporating class hierarchies.
problem Class hierarchies are often ignored in classification-based metric learning models.
method Trained softmax classifier and metric learning models with predefined class hierarchies.
result ProxyDR model performs better in hierarchical inference and hierarchy-informed performance.
ALP outperforms other data descriptors in one-class classification.
problem Challenges in one-class classification using data descriptors.
method Determined optimal default hyperparameters for data descriptors, proposed ALP, evaluated using leave-one-dataset-out procedure.
result ALP outperforms other data descriptors, including IF and SVM.
Paper tackles noisy similarity labels for multi-class classification.
problem Learning multi-class classifiers from noisy similarity-labeled data.
method Proposes a method using a noise transition matrix to learn from noisy data.
result Demonstrates superior performance compared to state-of-the-art methods.
Graph filtering reduces intra-class noise for improved classification accuracy.
problem Noise in training data affects classifier performance.
method Graph filtering to connect similar samples within a class.
result Asymptotic reduction of intra-class variance while maintaining mean.
In recent years, more machine learning algorithms have been applied to odor classification. These odor classification algorithms usually assume that the training datasets are static. However, for some odor recognition tasks, new odor classes continually emerge. That is, the odor datasets are dynamically growing while b…
In classification problems, especially those that categorize data into a large number of classes, the classes often naturally follow a hierarchical structure. That is, some classes are likely to share similar structures and features. Those characteristics can be captured by considering a hierarchical relationship among…
Paper analyzes multiclass classification with high-dimensional data.
problem Understanding statistical properties and behavior of multiclass classification algorithms.
method Asymptotic analysis of linear multiclass classification.
result Test error varies significantly across different training algorithms and data distributions.
This paper proposes a zero-shot learning approach for audio classification based on the textual information about class labels without any audio samples from target classes. We propose an audio classification system built on the bilinear model, which takes audio feature embeddings and semantic class label embeddings as…
We use a geometric digraph family called class cover catch digraphs (CCCDs) to tackle the class imbalance problem in statistical classification. CCCDs provide graph theoretic solutions to the class cover problem and have been employed in classification. We assess the classification performance of CCCD classifiers by ex…
Bottlenecks of binary classification from positive and unlabeled data (PU classification) are the requirements that given unlabeled patterns are drawn from the test marginal distribution, and the penalty of the false positive error is identical to the false negative error. However, such requirements are often not fulfi…
This paper proposes a novel generic one-class feature learning method based on intra-class splitting. In one-class classification, feature learning is challenging, because only samples of one class are available during training. Hence, state-of-the-art methods require reference multi-class datasets to pretrain feature …
IB-GAN improves multivariate time series classification under imbalance.
problem Class imbalance in multivariate time series classification.
method Unified approach combining data augmentation and classification via GANs.
result Significant performance gains for under-observed classes.
A new method for one-class classification using ellipsoidal encapsulation.
problem One-class classification for data optimization.
method Iterative transformation into an optimized subspace with regularization terms.
result Better results in one-class classification compared to existing methods.
This work presents a new strategy for multi-class classification that requires no class-specific labels, but instead leverages pairwise similarity between examples, which is a weaker form of annotation. The proposed method, meta classification learning, optimizes a binary classifier for pairwise similarity prediction a…
The study analyzes performance indices for class-imbalanced data and identifies conditions they must meet.
problem Distortions in performance indices under class imbalance.
method Identified two conditions for performance indices and analyzed four binary and five multi-class indices.
result Recommended appropriate indices for evaluating classifiers in class-imbalanced scenarios.
A number of classification problems need to deal with data imbalance between classes. Often it is desired to have a high recall on the minority class while maintaining a high precision on the majority class. In this paper, we review a number of resampling techniques proposed in literature to handle unbalanced datasets …
We propose a method to visualize class similarity in large-scale classifiers.
problem Analyzing hierarchical structures and relationships in large-scale classification.
method Compute class similarity based on prediction scores and visualize the class similarity matrix.
result Visualizing class similarity matrices reveals hierarchical structures and relationships.
In deep neural network, the cross-entropy loss function is commonly used for classification. Minimizing cross-entropy is equivalent to maximizing likelihood under assumptions of uniform feature and class distributions. It belongs to generative training criteria which does not directly discriminate correct class from co…
This paper tackles worst-class error rate in classification tasks.
problem Minimizing worst-class error rate in classification tasks, especially in medical image classification.
method Designing a boosting approach to bound the worst-class error rate using Deep Neural Networks (DNNs).
result The proposed boosting approach lowers worst-class test error rates while avoiding overfitting.
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.
FROCC uses random projections for fast one-class classification.
problem Efficient one-class classification for large datasets.
method Random projection of data onto random unit vectors, with region bounding.
result Significant improvement in ROC performance with substantial speedup.
Combines neural networks and STL for multi-class time-series classification.
problem Lack of interpretability in neural networks for time-series data.
method Proposes a method that uses neural networks to classify time-series data using STL specifications, introducing margin for multi-class classification and STL-based attributes for interpretability.
result Evaluations show improved interpretability and performance compared to state-of-the-art baselines.
The main approaches for node classification in graphs are information propagation and the association of the class of the node with external information. State of the art methods merge these approaches through Graph Convolutional Networks. We here use the association of topological features of the nodes with their clas…
A new model classifies surface anomalies in 3D point cloud data.
problem Accurate classification of surface anomalies in manufacturing processes.
method Deep subspace learning approach for 3D point cloud data.
result The method effectively identifies new types of anomalies.
The object of investigation are the almost contact manifolds with B-metric in the lowest dimension three, constructed on Lie algebras. It is considered a relation between the classes in the Bianchi classification of three-dimensional real Lie algebras and the classes of a classification of the considered manifolds. The…
Focal loss improves classification but not class-posterior probability estimation.
problem Improving class-posterior probability estimation from focal loss.
method Proved classification-calibration and derived a transformation to recover true class-posterior probabilities.
result A transformation of the confidence score from focal loss minimization allows recovery of true class-posterior probabilities.
Can we learn a binary classifier from only positive data, without any negative data or unlabeled data? We show that if one can equip positive data with confidence (positive-confidence), one can successfully learn a binary classifier, which we name positive-confidence (Pconf) classification. Our work is related to one-c…