Pariya Behrouzi

dblp:239/1127 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2026
0000-0001-6762-5433ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 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
3 papers
Bioinformatics and computational biology · 76% Computational science and engineering · 24%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 75% Graph learning · 25%

Topics — the 12 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational science and engineering
model selection
1.012026
Multi-omics network reconstruction with collaborative graphical lasso · Bioinform. 2026
Bioinformatics and computational biology
multi-omics data integration
1.012026
Multi-omics network reconstruction with collaborative graphical lasso · Bioinform. 2026
Bioinformatics and computational biology › biological network › network biology
network inference
1.012026
Multi-omics network reconstruction with collaborative graphical lasso · Bioinform. 2026
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › structure learning
bayesian network structure learning
0.812024
Bayesian Structural Learning with Parametric Marginals for Count Data: An Application to Microbiota Systems · J. Mach. Learn. Res. 2024
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.812024
Bayesian Structural Learning with Parametric Marginals for Count Data: An Application to Microbiota Systems · J. Mach. Learn. Res. 2024
Machine learning › Graph learning
graph inference
0.812024
Bayesian Structural Learning with Parametric Marginals for Count Data: An Application to Microbiota Systems · J. Mach. Learn. Res. 2024
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
structure learning
0.812024
Bayesian Structural Learning with Parametric Marginals for Count Data: An Application to Microbiota Systems · J. Mach. Learn. Res. 2024
Bioinformatics and computational biology › population genetics
genetics
0.412019
De novo construction of polyploid linkage maps using discrete graphical models · Bioinform. 2019
Bioinformatics and computational biology › statistical genetics › genetic linkage analysis
linkage map construction
0.412019
De novo construction of polyploid linkage maps using discrete graphical models · Bioinform. 2019
Bioinformatics and computational biology › computational microbiology › microbiome analysis
microbial interaction network
0.212024
Bayesian Structural Learning with Parametric Marginals for Count Data: An Application to Microbiota Systems · J. Mach. Learn. Res. 2024
Bioinformatics and computational biology › computational microbiology
microbiome analysis
0.212024
Bayesian Structural Learning with Parametric Marginals for Count Data: An Application to Microbiota Systems · J. Mach. Learn. Res. 2024
Information theory
graphical models
0.112019
De novo construction of polyploid linkage maps using discrete graphical models · Bioinform. 2019

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

parametric marginals · 1.5gaussian copula · 1.5bayesian inference · 1.5stability selection · 1.0graphical lasso · 1.0collaborative penalty · 1.0sparse gaussian copula · 0.8non-paranormal skeptic · 0.8graphical models · 0.4graphical model · 0.4
YearPublicationVenuePosition
2026 Multi-omics network reconstruction with collaborative graphical lasso
abstract
Abstract Motivation In recent years, the availability of multi-omics data has increased substantially. Multi-omics data integration methods mainly aim to leverage different molecular layers to gain a complete molecular description of biological processes. An attractive integration approach is the reconstruction of multi-omics networks. However, the development of effective multi-omics network reconstruction strategies lags behind. Results In this study, we introduce collaborative graphical lasso, a novel approach that extends graphical lasso by incorporating collaboration between omics layers, thereby improving multi-omics data integration and enhancing network inference. Our method leverages a collaborative penalty term, which harmonizes the contribution of the omics layers to the reconstruction of the network structure. This promotes a cohesive integration of information across modalities, and it is introduced alongside a dual regularization scheme that separately controls sparsity within and between layers. To address the challenge of model selection in this framework, we propose XStARS, a stability-based criterion for multi-dimensional hyperparameter tuning. We assess the performance of collaborative graphical lasso and the corresponding model selection procedure through simulations, and we apply them to publicly available multi-omics data. This application demonstrated collaborative graphical lasso recovers established biological interactions while suggesting novel, biologically coherent connections. Availability and implementation We implemented collaborative graphical lasso as an R package, available on CRAN as coglasso. The results of the manuscript can be reproduced running the code available at https://github.com/DrQuestion/coglasso_reproducible_code, deposited on figshare with DOI: https://doi.org/10.6084/m9.figshare.32324376.
Alessio Albanese, Wouter Kohlen, Pariya Behrouzi
Bioinform.3
2024 Bayesian Structural Learning with Parametric Marginals for Count Data: An Application to Microbiota Systems
abstract
High dimensional and heterogeneous count data are collected in various applied fields. In this paper, we look closely at high-resolution sequencing data on the microbiome, which have enabled researchers to study the genomes of entire microbial communities. Revealing the underlying interactions between these communities is of vital importance to learn how microbes influence human health. To perform structural learning from multivariate count data such as these, we develop a novel Gaussian copula graphical model with two key elements. Firstly, we employ parametric regression to characterize the marginal distributions. This step is crucial for accommodating the impact of external covariates. Neglecting this adjustment could potentially introduce distortions in the inference of the underlying network of dependences. Secondly, we advance a Bayesian structure learning framework, based on a computationally efficient search algorithm that is suited to high dimensionality. The approach returns simultaneous inference of the marginal effects and of the dependence structure, including graph uncertainty estimates. A simulation study and a real data analysis of microbiome data highlight the applicability of the proposed approach at inferring networks from multivariate count data in general, and its relevance to microbiome analyses in particular. The proposed method is implemented in the R package BDgraph.
Veronica Vinciotti, Pariya Behrouzi, Reza Mohammadi 0002
J. Mach. Learn. Res.2
2019 De novo construction of polyploid linkage maps using discrete graphical models
abstract
Abstract Motivation Linkage maps are used to identify the location of genes responsible for traits and diseases. New sequencing techniques have created opportunities to substantially increase the density of genetic markers. Such revolutionary advances in technology have given rise to new challenges, such as creating high-density linkage maps. Current multiple testing approaches based on pairwise recombination fractions are underpowered in the high-dimensional setting and do not extend easily to polyploid species. To remedy these issues, we propose to construct linkage maps using graphical models either via a sparse Gaussian copula or a non-paranormal skeptic approach. Results We determine linkage groups, typically chromosomes, and the order of markers in each linkage group by inferring the conditional independence relationships among large numbers of markers in the genome. Through simulations, we illustrate the utility of our map construction method and compare its performance with other available methods, both when the data are clean and contain no missing observations and when data contain genotyping errors. Our comprehensive map construction method makes full use of the dosage SNP data to reconstruct linkage map for any bi-parental diploid and polyploid species. We apply the proposed method to three genotype datasets: barley, peanut and potato from diploid and polyploid populations. Availability and implementation The method is implemented in the R package netgwas which is freely available at https://cran.r-project.org/web/packages/netgwas. Supplementary information Supplementary data are available at Bioinformatics online.
Pariya Behrouzi, Ernst Wit
Bioinform.1