Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dushyant Sahoo

dblp:165/4211 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
3since 2021 · last 2021
0000-0002-7155-4145ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Medical and health informatics › neuroimaging › neuroimaging analysis
fMRI analysis
0.512021
Learning Robust Hierarchical Patterns of Human Brain across Many fMRI Studies · NeurIPS 2021
Medical and health informatics › neuroimaging
neuroimaging analysis
0.512021
Learning Robust Hierarchical Patterns of Human Brain across Many fMRI Studies · NeurIPS 2021

Methods — techniques the papers use, named apart from their topics

sparsity connectivity patterns · 1.0matrix factorization · 1.0adversarial learning · 1.0
YearPublicationVenuePosition
2021 Learning Robust Hierarchical Patterns of Human Brain across Many fMRI Studies
abstract
Multi-site fMRI studies face the challenge that the pooling introduces systematic non-biological site-specific variance due to hardware, software, and environment. In this paper, we propose to reduce site-specific variance in the estimation of hierarchical Sparsity Connectivity Patterns (hSCPs) in fMRI data via a simple yet effective matrix factorization while preserving biologically relevant variations. Our method leverages unsupervised adversarial learning to improve the reproducibility of the components. Experiments on simulated datasets display that the proposed method can estimate components with higher accuracy and reproducibility, while preserving age-related variation on a multi-center clinical data set.
Dushyant Sahoo, Christos Davatzikos
NeurIPS1
2021 Variance Reduced Stochastic Proximal Algorithm for AUC Maximization
Soham Dan, Dushyant Sahoo
ECML/PKDD (3)2
2021 Hierarchical Extraction of Functional Connectivity Components in Human Brain Using Resting-State fMRI
abstract
The study of functional networks of the human brain has been of significant interest in cognitive neuroscience for over two decades, albeit they are typically extracted at a single scale using various methods, including decompositions like ICA. However, since numerous studies have suggested that the functional organization of the brain is hierarchical, analogous decompositions might better capture functional connectivity patterns. Moreover, hierarchical decompositions can efficiently reduce the very high dimensionality of functional connectivity data. This paper provides a novel method for the extraction of hierarchical connectivity components in the human brain using resting-state fMRI. The method builds upon prior work of Sparse Connectivity Patterns (SCPs) by introducing a hierarchy of sparse, potentially overlapping patterns. The components are estimated by cascaded factorization of correlation matrices generated from fMRI. The goal of the paper is to extract sparse interpretable hierarchically-organized patterns using correlation matrices where a low rank decomposition is formed by a linear combination of a higher rank decomposition. We formulate the decomposition as a non-convex optimization problem and solve it using gradient descent algorithms with adaptive step size. Along with the hierarchy, our method aims to capture the heterogeneity of the set of common patterns across individuals. We first validate our model through simulated experiments. We then demonstrate the effectiveness of the developed method on two different real-world datasets by showing that multi-scale hierarchical SCPs are reproducible between sub-samples and are more reproducible as compared to single scale patterns. We also compare our method with an existing hierarchical community detection approach.
Dushyant Sahoo, Theodore D. Satterthwaite, Christos Davatzikos
IEEE Trans. Medical Imaging1
2017 Effects of MRI scanner parameters on breast cancer radiomics
Ashirbani Saha, Xiaozhi Yu, Dushyant Sahoo, Maciej A. Mazurowski
Expert Syst. Appl.3