paper-with-me

홈 › Papers

New Hard-thresholding Rules based on Data Splitting in High-dimensional Imbalanced Classification

2021-11-05 · Arezou Mojiri, Abbas Khalili, Ali Zeinal Hamadani

In binary classification, imbalance refers to situations in which one class is heavily under-represented. This issue is due to either a data collection process or because one class is indeed rare in a population. Imbalanced classification frequently arises in applications such as biology, medicine, engineering, and social sciences. In this paper, for the first time, we theoretically study the impact of imbalance class sizes on the linear discriminant analysis (LDA) in high dimensions. We show that due to data scarcity in one class, referred to as the minority class, and high-dimensionality of the feature space, the LDA ignores the minority class yielding a maximum misclassification rate. We then propose a new construction of hard-thresholding rules based on a data splitting technique that reduces the large difference between the misclassification rates. We show that the proposed method is asymptotically optimal. We further study two well-known sparse versions of the LDA in imbalanced cases. We evaluate the finite-sample performance of different methods using simulations and by analyzing two real data sets. The results show that our method either outperforms its competitors or has comparable performance based on a much smaller subset of selected features, while being computationally more efficient.

📄 PDF Abstract BibTeX arXiv:2111.03306

Code (0)

등록된 구현이 없습니다.

Tasks

Binary Classificationimbalanced classification

Methods 이 논문이 사용한 방법론

LDA Linear discriminant analysis (LDA), normal discriminant analysis (NDA), or discriminant function analysis is a generalization of Fisher's linear discriminant, a method used in…

Similar Papers 제목 키워드 기반

Iterative Log Thresholding

2013-12-05 · Dmitry Malioutov, Aleksandr Aravkin

Sparse reconstruction approaches using the re-weighted l1-penalty have been shown, both empirically and theoretically, to provide a significant improvement in recovering sparse signals in comparison to the l1-relaxation.…

Global hard thresholding algorithms for joint sparse image representation and denoising

2017-05-27 · Reza Borhani, Jeremy Watt, Aggelos Katsaggelos

Sparse coding of images is traditionally done by cutting them into small patches and representing each patch individually over some dictionary given a pre-determined number of nonzero coefficients to use for each patch. …

AllDenoising

Sanskrit Sandhi Splitting using seq2(seq)^2

2018-01-01 · Rahul Aralikatte, Neelamadhav Gantayat, Naveen Panwar, Anush Sankaran 외

In Sanskrit, small words (morphemes) are combined to form compound words through a process known as Sandhi. Sandhi splitting is the process of splitting a given compound word into its constituent morphemes. Although rule…

Chinese Word SegmentationDecoder

Sanskrit Sandhi Splitting using seq2(seq)2

2018-10-01 · EMNLP 2018 10 · Rahul Aralikatte, Neelamadhav Gantayat, Naveen Panwar, Anush Sankaran 외

In Sanskrit, small words (morphemes) are combined to form compound words through a process known as Sandhi. Sandhi splitting is the process of splitting a given compound word into its constituent morphemes. Although rule…

Chinese Word SegmentationDecoder

Neyman-Pearson classification: parametrics and sample size requirement

2018-02-07 · Xin Tong, Lucy Xia, Jiacheng Wang, Yang Feng

The Neyman-Pearson (NP) paradigm in binary classification seeks classifiers that achieve a minimal type II error while enforcing the prioritized type I error controlled under some user-specified level $\alpha$. This para…

Binary ClassificationClassificationGeneral ClassificationSpam detection+1