Nitesh Chawla

Dr. Nitesh Chawla

Data, Inference, Analytics and Learning Lab, University of Notre Dame, Notre Dame, IN 46556, USA
orcid

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 January 2022 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Open access
DDDamien Dablain
Damien Dablain
BKBartosz Krawczyk
Bartosz Krawczyk
Nitesh ChawlaNitesh Chawla
Nitesh Chawla
Despite over two decades of progress, imbalanced data is still considered a significant challenge for contemporary machine learning models. Modern advances in deep learning have further magnified the importance of the imbalanced data problem, especially when learning from images. Therefore, there is a need for an oversampling method that is specifically tailored to deep learning models, can work on raw images while preserving their properties, and is capable of generating high-quality, artificial images that can enhance minority classes and balance the training set. We propose Deep synthetic minority oversampling technique (SMOTE), a novel oversampling algorithm for deep learning models that leverages the properties of the successful SMOTE algorithm. It is simple, yet effective in its design. It consists of three major components: 1) an encoder/decoder framework; 2) SMOTE-based oversampling; and 3) a dedicated loss function that is enhanced with a penalty term. An important advantage of DeepSMOTE over generative adversarial network (GAN)-based oversampling is that DeepSMOTE does not require a discriminator, and it generates high-quality artificial images that are both information-rich and suitable for visual inspection. DeepSMOTE code is publicly available at https://github.com/dd1github/DeepSMOTE.

1 August 2024
Verified
Conference Paper
Open access
PDF file
TGTaicheng Guo
Taicheng Guo
XCXiuying Chen
Xiuying Chen
YWYaqi Wang
Yaqi Wang
RCRuidi Chang
Ruidi Chang
SPShichao Pei
Shichao Pei
XZXiangliang Zhang
Xiangliang Zhang
Arrhythmia diagnosis using electrocardiogram (ECG) is critical for preventing cardiovascular risks. However, existing deep learning-based methods struggle with label scarcity and contrastive learning-based methods suffer from false-negative samples, which lead to poor model generalization. Besides, due to inter-subject variability, pre-trained models cannot achieve evenly performance across individuals. Conducting model fine-tuning for each individual is computationally expensive and does not guarantee improvement. We propose DiffECG, a diffusion-based self-supervised learning framework for label-efficient and personalized arrhythmia detection. Our method utilizes a diffusion model to extract robust ECG representations, coupled with a novel feature extractor and a multi-modal feature fusion strategy to obtain a well-generalized model. Moreover, we propose an efficient model personalization mechanism based on zeroth-order optimization. It personalizes the model by tuning the noise-adding step t in the diffusion process, significantly reducing computational costs compared to model fine-tuning. Experimental results show that our proposed method outperforms the SOTA method by 37.9% and 23.9% in generalization and personalization performance, respectively. The source code is available at: https://github.com/Auguuust/DiffEC

25 June 2013 in Journal of General Internal Medicine
Verified
Journal Article
Closed access
PDF file
Nitesh ChawlaNitesh Chawla
Nitesh Chawla
DDDarcy A. Davis
Darcy A. Davis

9 October 2014 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
YYYang Yang
Yang Yang
RLRyan N. Lichtenwalter
Ryan N. Lichtenwalter
Nitesh ChawlaNitesh Chawla
Nitesh Chawla

6 May 2016 in Science Advances
Verified
Journal Article
Open access
PDF file
JXJian Xu
Jian Xu
TWThanuka L. Wickramarathne
Thanuka L. Wickramarathne
Nitesh ChawlaNitesh Chawla
Nitesh Chawla
A general method to discover and embed variable orders of dependencies in a network representation.

1 March 2017 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
Alberto Fernández HilarioAlberto Fernández Hilario
Alberto Fernández Hilario
SRSara del Río
Sara del Río
Nitesh ChawlaNitesh Chawla
Nitesh Chawla
Francisco HerreraFrancisco Herrera
Francisco Herrera
Big Data applications are emerging during the last years, and researchers from many disciplines are aware of the high advantages related to the knowledge extraction from this type of problem. However, traditional learning approaches cannot be directly applied due to scalability issues. To overcome this issue, the MapReduce framework has arisen as a “de facto” solution. Basically, it carries out a “divide-and-conquer” distributed procedure in a fault-tolerant way to adapt for commodity hardware. Being still a recent discipline, few research has been conducted on imbalanced classification for Big Data. The reasons behind this are mainly the difficulties in adapting standard techniques to the MapReduce programming style. Additionally, inner problems of imbalanced data, namely lack of data and small disjuncts, are accentuated during the data partitioning to fit the MapReduce programming style. This paper is designed under three main pillars. First, to present the first outcomes for imbalanced classification in Big Data problems, introducing the current research state of this area. Second, to analyze the behavior of standard pre-processing techniques in this particular framework. Finally, taking into account the experimental results obtained throughout this work, we will carry out a discussion on the challenges and future directions for the topic.