Demo Data from EDBT 2026 / reviewers in the wild / expert
Sanjeena Subedi
dblp:93/8428
· DBLP profile ↗
3ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0002-2462-7786ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 3 · 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 |
Bioinformatics and computational biology · 92% Computational science and engineering · 8% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › gene expression analysis
gene expression clustering |
0.7 | 1 | 2023 | Finite mixtures of matrix variate Poisson-log normal distributions for three-way count data · Bioinform. 2023 |
Bioinformatics and computational biology
genomics |
0.7 | 1 | 2023 | Finite mixtures of matrix variate Poisson-log normal distributions for three-way count data · Bioinform. 2023 |
Bioinformatics and computational biology
transcriptomics |
0.7 | 1 | 2023 | Finite mixtures of matrix variate Poisson-log normal distributions for three-way count data · Bioinform. 2023 |
Computational science and engineering › latent variable model
mixture model |
0.2 | 1 | 2023 | Finite mixtures of matrix variate Poisson-log normal distributions for three-way count data · Bioinform. 2023 |
Bioinformatics and computational biology
statistical genetics |
0.2 | 1 | 2023 | Finite mixtures of matrix variate Poisson-log normal distributions for three-way count data · Bioinform. 2023 |
Methods — techniques the papers use, named apart from their topics
variational gaussian approximation · 0.7matrix variate poisson-log normal distribution · 0.7markov chain monte carlo · 0.7information criteria · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Finite mixtures of matrix variate Poisson-log normal distributions for three-way count dataabstractMOTIVATION: Three-way data structures, characterized by three entities, the units, the variables and the occasions, are frequent in biological studies. In RNA sequencing, three-way data structures are obtained when high-throughput transcriptome sequencing data are collected for n genes across p conditions at r occasions. Matrix variate distributions offer a natural way to model three-way data and mixtures of matrix variate distributions can be used to cluster three-way data. Clustering of gene expression data is carried out as means of discovering gene co-expression networks. RESULTS: In this work, a mixture of matrix variate Poisson-log normal distributions is proposed for clustering read counts from RNA sequencing. By considering the matrix variate structure, full information on the conditions and occasions of the RNA sequencing dataset is simultaneously considered, and the number of covariance parameters to be estimated is reduced. We propose three different frameworks for parameter estimation: a Markov chain Monte Carlo-based approach, a variational Gaussian approximation-based approach, and a hybrid approach. Various information criteria are used for model selection. The models are applied to both real and simulated data, and we demonstrate that the proposed approaches can recover the underlying cluster structure in both cases. In simulation studies where the true model parameters are known, our proposed approach shows good parameter recovery. AVAILABILITY AND IMPLEMENTATION: The GitHub R package for this work is available at https://github.com/anjalisilva/mixMVPLN and is released under the open source MIT license. Anjali Silva, Xiaoke Qin, Steven J. Rothstein, Paul D. McNicholas, Sanjeena Subedi |
Bioinform. | 5 |
| 2019 | A multivariate Poisson-log normal mixture model for clustering transcriptome sequencing dataabstractBACKGROUND: High-dimensional data of discrete and skewed nature is commonly encountered in high-throughput sequencing studies. Analyzing the network itself or the interplay between genes in this type of data continues to present many challenges. As data visualization techniques become cumbersome for higher dimensions and unconvincing when there is no clear separation between homogeneous subgroups within the data, cluster analysis provides an intuitive alternative. The aim of applying mixture model-based clustering in this context is to discover groups of co-expressed genes, which can shed light on biological functions and pathways of gene products. RESULTS: A mixture of multivariate Poisson-log normal (MPLN) model is developed for clustering of high-throughput transcriptome sequencing data. Parameter estimation is carried out using a Markov chain Monte Carlo expectation-maximization (MCMC-EM) algorithm, and information criteria are used for model selection. CONCLUSIONS: The mixture of MPLN model is able to fit a wide range of correlation and overdispersion situations, and is suited for modeling multivariate count data from RNA sequencing studies. All scripts used for implementing the method can be found at https://github.com/anjalisilva/MPLNClust . Anjali Silva, Steven J. Rothstein, Paul D. McNicholas, Sanjeena Subedi |
BMC Bioinform. | 4 |
| 2012 | The LASSO and Sparse Least Squares Regression Methods for SNP Selection in Predicting Quantitative TraitsabstractRecent work concerning quantitative traits of interest has focused on selecting a small subset of single nucleotide polymorphisms (SNPs) from amongst the SNPs responsible for the phenotypic variation of the trait. When considered as covariates, the large number of variables (SNPs) and their association with those in close proximity pose challenges for variable selection. The features of sparsity and shrinkage of regression coefficients of the least absolute shrinkage and selection operator (LASSO) method appear attractive for SNP selection. Sparse partial least squares (SPLS) is also appealing as it combines the features of sparsity in subset selection and dimension reduction to handle correlations amongst SNPs. In this paper we investigate application of the LASSO and SPLS methods for selecting SNPs that predict quantitative traits. We evaluate the performance of both methods with different criteria and under different scenarios using simulation studies. Results indicate that these methods can be effective in selecting SNPs that predict quantitative traits but are limited by some conditions. Both methods perform similarly overall but each exhibit advantages over the other in given situations. Both methods are applied to Canadian Holstein cattle data to compare their performance. Zeny Z. Feng, Xiaojian Yang, Sanjeena Subedi, Paul D. McNicholas |
IEEE ACM Trans. Comput. Biol. Bioinform. | 3 |