A new method for constructing networks from binary data.
Ontology highlight
ABSTRACT:
SUBMITTER: van Borkulo CD
PROVIDER: S-EPMC4118196 | biostudies-literature | 2014 Aug
REPOSITORIES: biostudies-literature
Publications
A new method for constructing networks from binary data.
van Borkulo Claudia D CD Borsboom Denny D Epskamp Sacha S Blanken Tessa F TF Boschloo Lynn L Schoevers Robert A RA Waldorp Lourens J LJ
Scientific reports 20140801
Network analysis is entering fields where network structures are unknown, such as psychology and the educational sciences. A crucial step in the application of network models lies in the assessment of network structure. Current methods either have serious drawbacks or are only suitable for Gaussian data. In the present paper, we present a method for assessing network structures from binary data. Although models for binary data are infamous for their computational intractability, we present a com ...[more]
Similar Datasets
Project description:BACKGROUND: DNA microarrays and other genomics-inspired technologies provide large datasets that often include hidden patterns of correlation between genes reflecting the complex processes that underlie cellular metabolism and physiology. The challenge in analyzing large-scale expression data has been to extract biologically meaningful inferences regarding these processes - often represented as networks - in an environment where the datasets are often imperfect and biological noise can obscure the actual signal. Although many techniques have been developed in an attempt to address these issues, to date their ability to extract meaningful and predictive network relationships has been limited. Here we describe a method that draws on prior information about gene-gene interactions to infer biologically relevant pathways from microarray data. Our approach consists of using preliminary networks derived from the literature and/or protein-protein interaction data as seeds for a Bayesian network analysis of microarray results. RESULTS: Through a bootstrap analysis of gene expression data derived from a number of leukemia studies, we demonstrate that seeded Bayesian Networks have the ability to identify high-confidence gene-gene interactions which can then be validated by comparison to other sources of pathway data. CONCLUSION: The use of network seeds greatly improves the ability of Bayesian Network analysis to learn gene interaction networks from gene expression data. We demonstrate that the use of seeds derived from the biomedical literature or high-throughput protein-protein interaction data, or the combination, provides improvement over a standard Bayesian Network analysis, allowing networks involving dynamic processes to be deduced from the static snapshots of biological systems that represent the most common source of microarray data. Software implementing these methods has been included in the widely used TM4 microarray analysis package.
| S-EPMC2474592 | biostudies-literature
Project description:The biological processes that drive cellular function can be represented by a complex network of interactions between regulators (transcription factors) and their targets (genes). A cell's epigenetic state plays an important role in mediating these interactions, primarily by influencing chromatin accessibility. However, how to effectively use epigenetic data when constructing a gene regulatory network remains an open question. Almost all existing network reconstruction approaches focus on estimating transcription factor to gene connections using transcriptomic data. In contrast, computational approaches for analyzing epigenetic data generally focus on improving transcription factor binding site predictions rather than deducing regulatory network relationships. We bridged this gap by developing SPIDER, a network reconstruction approach that incorporates epigenetic data into a message-passing framework to estimate gene regulatory networks. We validated SPIDER's predictions using ChIP-seq data from ENCODE and found that SPIDER networks are both highly accurate and include cell-line-specific regulatory interactions. Notably, SPIDER can recover ChIP-seq verified transcription factor binding events in the regulatory regions of genes that do not have a corresponding sequence motif. The networks estimated by SPIDER have the potential to identify novel hypotheses that will allow us to better characterize cell-type and phenotype specific regulatory mechanisms.
| S-EPMC8660777 | biostudies-literature
Project description:Gene coexpression networks yield critical insights into biological processes, and single-cell RNA sequencing provides an opportunity to target inquiries at the cellular level. However, due to the sparsity and heterogeneity of transcript counts, it is challenging to construct accurate gene networks. We develop an approach, locCSN, that estimates cell-specific networks (CSNs) for each cell, preserving information about cellular heterogeneity that is lost with other approaches. LocCSN is based on a nonparametric investigation of the joint distribution of gene expression; hence it can readily detect nonlinear correlations, and it is more robust to distributional challenges. Although individual CSNs are estimated with considerable noise, average CSNs provide stable estimates of networks, which reveal gene communities better than traditional measures. Additionally, we propose downstream analysis methods using CSNs to utilize more fully the information contained within them. Repeated estimates of gene networks facilitate testing for differences in network structure between cell groups. Notably, with this approach, we can identify differential network genes, which typically do not differ in gene expression, but do differ in terms of the coexpression networks. These genes might help explain the etiology of disease. Finally, to further our understanding of autism spectrum disorder, we examine the evolution of gene networks in fetal brain cells and compare the CSNs of cells sampled from case and control subjects to reveal intriguing patterns in gene coexpression.
| S-EPMC8713783 | biostudies-literature
Project description:MotivationTumor tissue samples often contain an unknown fraction of stromal cells. This problem is widely known as tumor purity heterogeneity (TPH) was recently recognized as a severe issue in omics studies. Specifically, if TPH is ignored when inferring co-expression networks, edges are likely to be estimated among genes with mean shift between non-tumor- and tumor cells rather than among gene pairs interacting with each other in tumor cells. To address this issue, we propose Tumor Specific Net (TSNet), a new method which constructs tumor-cell specific gene/protein co-expression networks based on gene/protein expression profiles of tumor tissues. TSNet treats the observed expression profile as a mixture of expressions from different cell types and explicitly models tumor purity percentage in each tumor sample.ResultsUsing extensive synthetic data experiments, we demonstrate that TSNet outperforms a standard graphical model which does not account for TPH. We then apply TSNet to estimate tumor specific gene co-expression networks based on TCGA ovarian cancer RNAseq data. We identify novel co-expression modules and hub structure specific to tumor cells.Availability and implementationR codes can be found at https://github.com/petraf01/TSNet.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC6022554 | biostudies-literature
Project description:The goal of metabolic association networks is to identify topology of a metabolic network for a better understanding of molecular mechanisms. An accurate metabolic association network enables investigation of the functional behavior of metabolites in a cell or tissue. Gaussian Graphical model (GGM)-based methods have been widely used in genomics to infer biological networks. However, the performance of various GGM-based methods for the construction of metabolic association networks remains unknown in metabolomics. The performance of principle component regression (PCR), independent component regression (ICR), shrinkage covariance estimate (SCE), partial least squares regression (PLSR), and extrinsic similarity (ES) methods in constructing metabolic association networks was compared by estimating partial correlation coefficient matrices when the number of variables is larger than the sample size. To do this, the sample size and the network density (complexity) were considered as variables for network construction. Simulation studies show that PCR and ICR are more stable to the sample size and the network density than SCE and PLSR in terms of F1 scores. These methods were further applied to analysis of experimental metabolomics data acquired from metabolite extract of mouse liver. For the simulated data, the proposed methods PCR and ICR outperform other methods when the network density is large, while PLSR and SCE perform better when the network density is small. As for experimental metabolomics data, PCR and ICR discover more significant edges and perform better than PLSR and SCE when the discovered edges are evaluated using KEGG pathway. These results suggest that the metabolic network is more complex than the genomic network and therefore, PCR and ICR have the advantage over PLSR and SCE in constructing the metabolic association networks.
| S-EPMC4233464 | biostudies-literature
Project description:We quantify the notion of pattern and formalize the process of pattern discovery under the framework of binary bipartite networks. Patterns of particular focus are interrelated global interactions between clusters on its row and column axes. A binary bipartite network is built into a thermodynamic system embracing all up-and-down spin configurations defined by product-permutations on rows and columns. This system is equipped with its ferromagnetic energy ground state under Ising model potential. Such a ground state, also called a macrostate, is postulated to congregate all patterns of interest embedded within the network data in a multiscale fashion. A new computing paradigm for indirect searching for such a macrostate, called Data Mechanics, is devised by iteratively building a surrogate geometric system with a pair of nearly optimal marginal ultrametrics on row and column spaces. The coupling measure minimizing the Gromov-Wasserstein distance of these two marginal geometries is also seen to be in the vicinity of the macrostate. This resultant coupling geometry reveals multiscale block pattern information that characterizes multiple layers of interacting relationships between clusters on row and on column axes. It is the nonparametric information content of a binary bipartite network. This coupling geometry is then demonstrated to shed new light and bring resolution to interaction issues in community ecology and in gene-content-based phylogenetics. Its implied global inferences are expected to have high potential in many scientific areas.
| S-EPMC4149528 | biostudies-literature
Project description:Tools from network science can be utilized to study relations between diseases. Different studies focus on different types of inter-disease linkages. One of them is the comorbidity patterns derived from large-scale longitudinal data of hospital discharge records. Researchers seek to describe comorbidity relations as a network to characterize pathways of disease progressions and to predict future risks. The first step in such studies is the construction of the network itself, which subsequent analyses rest upon. There are different ways to build such a network. In this paper, we provide an overview of several existing statistical approaches in network science applicable to weighted directed networks. We discuss the differences between the null models that these models assume and their applications. We apply these methods to the inpatient data of approximately one million people, spanning approximately 17 years, pertaining to the Montreal Census Metropolitan Area. We discuss the differences in the structure of the networks built by different methods, and different features of the comorbidity relations that they extract. We also present several example applications of these methods.
| S-EPMC6223974 | biostudies-literature
Project description:Reconstructing gene regulatory networks is crucial to understand biological processes and holds potential for developing personalized treatment. Yet, it is still an open problem as state-of-the-art algorithms are often not able to process large amounts of data within reasonable time. Furthermore, many of the existing methods predict numerous false positives and have limited capabilities to integrate other sources of information, such as previously known interactions. Here we introduce KBoost, an algorithm that uses kernel PCA regression, boosting and Bayesian model averaging for fast and accurate reconstruction of gene regulatory networks. We have benchmarked KBoost against other high performing algorithms using three different datasets. The results show that our method compares favorably to other methods across datasets. We have also applied KBoost to a large cohort of close to 2000 breast cancer patients and 24,000 genes in less than 2 h on standard hardware. Our results show that molecularly defined breast cancer subtypes also feature differences in their GRNs. An implementation of KBoost in the form of an R package is available at: https://github.com/Luisiglm/KBoost and as a Bioconductor software package.
| S-EPMC8322418 | biostudies-literature
Project description:AbstractStudying the social behaviour of small or cryptic species often relies on constructing networks from sparse point-based observations of individuals (e.g. live trapping data). A common approach assumes that individuals that have been detected sequentially in the same trapping location will also be more likely to have come into indirect and/or direct contact. However, there is very little guidance on how much data are required for making robust networks from such data. In this study, we highlight that sequential trap sharing networks broadly capture shared space use (and, hence, the potential for contact) and that it may be more parsimonious to directly model shared space use. We first use empirical data to show that characteristics of how animals use space can help us to establish new ways to model the potential for individuals to come into contact. We then show that a method that explicitly models individuals' home ranges and subsequent overlap in space among individuals (spatial overlap networks) requires fewer data for inferring observed networks that are more strongly correlated with the true shared space use network (relative to sequential trap sharing networks). Furthermore, we show that shared space use networks based on estimating spatial overlap are also more powerful for detecting biological effects. Finally, we discuss when it is appropriate to make inferences about social interactions from shared space use. Our study confirms the potential for using sparse trapping data from cryptic species to address a range of important questions in ecology and evolution.Significance statementCharacterising animal social networks requires repeated (co-)observations of individuals. Collecting sufficient data to characterise the connections among individuals represents a major challenge when studying cryptic organisms-such as small rodents. This study draws from existing spatial mark-recapture data to inspire an approach that constructs networks by estimating space use overlap (representing the potential for contact). We then use simulations to demonstrate that the method provides consistently higher correlations between inferred (or observed) networks and the true underlying network compared to current approaches and requires fewer observations to reach higher correlations. We further demonstrate that these improvements translate to greater network accuracy and to more power for statistical hypothesis testing.Supplementary informationThe online version contains supplementary material available at 10.1007/s00265-022-03222-5.
| S-EPMC9418289 | biostudies-literature
Project description:The mechanisms leading to the development and progression of hepatocellular carcinoma (HCC) are complicated and regulated genetically and epigenetically. The recent advancement in high-throughput sequencing has facilitated investigations into the role of genetic and epigenetic regulations in hepatocarcinogenesis. Therefore, we used systems biology and big database mining to construct genetic and epigenetic networks (GENs) using the information about mRNA, miRNA, and methylation profiles of HCC patients. Our approach involves analyzing gene regulatory networks (GRNs), protein-protein networks (PPINs), and epigenetic networks at different stages of hepatocarcinogenesis. The core GENs, influencing each stage of HCC, were extracted via principal network projection (PNP). The pathways during different stages of HCC were compared. We observed that extracellular signals were further transduced to transcription factors (TFs), resulting in the aberrant regulation of their target genes, in turn inducing mechanisms that are responsible for HCC progression, including cell proliferation, anti-apoptosis, aberrant cell cycle, cell survival, and metastasis. We also selected potential multiple drugs specific to prominent epigenetic network markers of each stage of HCC: lestaurtinib, dinaciclib, and perifosine against the NTRK2, MYC, and AKT1 markers influencing HCC progression from stage I to stage II; celecoxib, axitinib, and vinblastine against the DDIT3, PDGFB, and JUN markers influencing HCC progression from stage II to stage III; and atiprimod, celastrol, and bortezomib against STAT3, IL1B, and NFKB1 markers influencing HCC progression from stage III to stage IV.
| S-EPMC5346727 | biostudies-literature