Pith. sign in

REVIEW 1 cited by

A Comparison of Synthetic Oversampling Methods for Multi-class Text Classification

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2008.04636 v1 pith:3LAJIUXO submitted 2020-08-11 cs.CL cs.LG

classification cs.CLcs.LG
keywords oversamplingauthorsclassificationmethodsalgorithmcomparedsmotetext
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The authors compared oversampling methods for the problem of multi-class topic classification. The SMOTE algorithm underlies one of the most popular oversampling methods. It consists in choosing two examples of a minority class and generating a new example based on them. In the paper, the authors compared the basic SMOTE method with its two modifications (Borderline SMOTE and ADASYN) and random oversampling technique on the example of one of text classification tasks. The paper discusses the k-nearest neighbor algorithm, the support vector machine algorithm and three types of neural networks (feedforward network, long short-term memory (LSTM) and bidirectional LSTM). The authors combine these machine learning algorithms with different text representations and compared synthetic oversampling methods. In most cases, the use of oversampling techniques can significantly improve the quality of classification. The authors conclude that for this task, the quality of the KNN and SVM algorithms is more influenced by class imbalance than neural networks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Approximate Borderline Sampling using Granular-Ball for Classification Tasks

    cs.CV 2025-06 conditional novelty 6.0 of 10

    GBABS samples only approximate borderline points detected via non-overlapping granular balls, reporting better classifier accuracy and noise robustness than GB-based and standard sampling baselines.

Pith tools