3260 papers • 126 benchmarks • 313 datasets
learning classifier from class-imbalanced data
(Image credit: Papersgraph)
These leaderboards are used to track progress in imbalanced-classification-1
No benchmarks available.
Use these libraries to find imbalanced-classification-1 models and implementations
No subtasks available.
A large scale benchmark for molecular machine learning consisting of multiple public datasets, metrics, featurizations and learning algorithms.
This paper revisits the popular pseudo-labeling methods via a unified sample weighting formulation and demonstrates the inherent quantity-quality trade-off problem of pseudo-labels with thresholding, which may prohibit learning.
A general imbalanced classification model based on deep reinforcement learning, in which the problem is formulated as a sequential decision-making process and solved by a deep Q-learning network, and the agent finally finds an optimal classification policy in imbalanced data.
An integrated OLTR algorithm is developed that maps an image to a feature space such that visual concepts can easily relate to each other based on a learned metric that respects the closed-world classification while acknowledging the novelty of the open world.
A multi-language handwritten digit recognition dataset named MNIST-MIX, which is the largest dataset of the same type in terms of both languages and data samples, and a LeNet model which is pre-trained on MNIST as the baseline is presented.
RIDE aims to reduce both the bias and the variance of a long-tailed classifier by RoutIng Diverse Experts (RIDE), which significantly outperforms the state-of-the-art methods by 5% to 7% on all the benchmarks including CIFAR100-LT, ImageNet-LT and iNaturalist.
This paper introduces a novel ensemble IL framework named MESA, which adaptively resamples the training set in iterations to get multiple classifiers and forms a cascade ensemble model that makes MESA generally applicable to most of the existing learning models and the meta-sampler can be efficiently applied to new tasks.
This work introduces Mal net, the largest public graph database ever constructed, representing a large-scale ontology of software function call graphs, and provides a detailed analysis of MalNet, discussing its properties and provenance.
This work proposes two machine learning algorithms to handle highly imbalanced classification problems, one of which follows a \textit{characterize then discriminate} approach, where the positive class is characterized first by boxes, and then each box boundary becomes a separate discriminative classifier.
It is shown that the assignment of weights to the component classifiers of a boosted ensemble can be thought of as a game of Tug of War between the classes in the margin space, and demonstrated how this insight can be used to attain a good compromise between the rare and abundant classes without having to resort to cost set tuning.
Adding a benchmark result helps the community track progress.