Aashi Jindal

Aashi Jindal

Auto-generated profile, based on publicly available information

Aashi Jindal

Department of Electrical Engineering, Indian Institute of Technology Delhi, Hauz Khas, Delhi 110016, India

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
9 November 2018 in Nature Communications
Verified
Journal Article
Open access
PDF file
AJAashi Jindal
Aashi Jindal
PGPrashant Gupta
Prashant Gupta
JAJayadeva
Jayadeva
Debarka SenguptaDebarka Sengupta
Debarka Sengupta
Single cell messenger RNA sequencing (scRNA-seq) provides a window into transcriptional landscapes in complex tissues. The recent introduction of droplet based transcriptomics platforms has enabled the parallel screening of thousands of cells. Large-scale single cell transcriptomics is advantageous as it promises the discovery of a number of rare cell sub-populations. Existing algorithms to find rare cells scale unbearably slowly or terminate, as the sample size grows to the order of tens of thousands. We propose Finder of Rare Entities (FiRE), an algorithm that, in a matter of seconds, assigns a rareness score to every individual expression profile under study. We demonstrate how FiRE scores can help bioinformaticians focus the downstream analyses only on a fraction of expression profiles within ultra-large scRNA-seq data. When applied to a large scRNA-seq dataset of mouse brain cells, FiRE recovered a novel sub-type of the pars tuberalis lineage.

1 July 2021 in Big Data Research
Verified
Journal Article
Closed access
PGPrashant Gupta
Prashant Gupta
AJAashi Jindal
Aashi Jindal
JAJayadeva
Jayadeva
DSDebarka Sengupta
Debarka Sengupta

7 November 2020 in arXiv
Verified
Preprint
Open access
PDF file
AJAashi Jindal
Aashi Jindal
PGPrashant Gupta
Prashant Gupta
Debarka SenguptaDebarka Sengupta
Debarka Sengupta
•J• Jayadeva
• Jayadeva
We propose Enhash, a fast ensemble learner that detects \textit{concept drift} in a data stream. A stream may consist of abrupt, gradual, virtual, or recurring events, or a mixture of various types of drift. Enhash employs projection hash to insert an incoming sample. We show empirically that the proposed method has competitive performance to existing ensemble learners in much lesser time. Also, Enhash has moderate resource requirements. Experiments relevant to performance comparison were performed on 6 artificial and 4 real data sets consisting of various types of drifts.

2 January 2019
Verified
Dataset
Closed access
PGPrashant Gupta
Prashant Gupta
JAJayadeva
Jayadeva
AJAashi Jindal
Aashi Jindal
Debarka SenguptaDebarka Sengupta
Debarka Sengupta

10 April 2020 in bioRxiv
Verified
Preprint
Open access
PDF file
PGPrashant Gupta
Prashant Gupta
AJAashi Jindal
Aashi Jindal
JAJayadeva
Jayadeva
Debarka SenguptaDebarka Sengupta
Debarka Sengupta
The exclusivity of a vast majority of cancer mutations remains poorly understood, despite the availability of large amounts of whole genome and exome sequencing data. In clinical settings, this markedly hinders the identification of the previously uncharacterized deleterious mutations due to the unavailability of matched normal samples. We employed state of the art deep learning algorithms for cross-exome learning of mutational embeddings and demonstrated their utility in sequence based detection of cancer-specific Single Nucleotide Variants (SNVs).

2 September 2019 in arXiv
Verified
Preprint
Open access
PDF file
PGPrashant Gupta
Prashant Gupta
AJAashi Jindal
Aashi Jindal
JAJayadeva
Jayadeva
Debarka SenguptaDebarka Sengupta
Debarka Sengupta
We present a new way of constructing an ensemble classifier, named the Guided Random Forest (GRAF) in the sequel. GRAF extends the idea of building oblique decision trees with localized partitioning to obtain a global partitioning. We show that global partitioning bridges the gap between decision trees and boosting algorithms. We empirically demonstrate that global partitioning reduces the generalization error bound. Results on 115 benchmark datasets show that GRAF yields comparable or better results on a majority of datasets. We also present a new way of approximating the datasets in the framework of random forests.