Full-text resources of PSJD and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl
Preferences help
enabled [disable] Abstract
Number of results

Results found: 2

Number of results on page
first rewind previous Page / 1 next fast forward last

Search results

help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
EN
Naturally, genes interact with each other by forming a complicated network and the relationship between groups of genes can be shown by different functions as gene networks. Recently, there has been a growing concern in uncovering these complex structures from gene expression data by modeling them mathematically. The Gaussian graphical model is one of the very popular parametric approaches for modelling the underlying types of biochemical systems. In this study, we evaluate the performance of this probabilistic model via different criteria, from the change in dimension of the systems to the change in the distribution of the data. Hereby, we generate high dimensional simulated datasets via copulas and apply them in Gaussian graphical model to compare sensitivity, specificity, F-measure and various other accuracy measures. We also assess its performance under real datasets. We consider that such comprehensive analyses can be helpful for assessing the limitation of this common model and for developing alternative approaches, to overcome its disadvantages.
EN
Markov chain Monte Carlo methods (MCMC) are iterative algorithms that are used in many Bayesian simulation studies, where the inference cannot be easily obtained directly through the defined model. Reversible jump MCMC methods belong to a special type of MCMC methods, in which the dimension of parameters can change in each iteration. In this study, we suggest Gibbs sampling in place of RJMCMC, to decrease the computational demand of the calculation of high dimensional systems. We evaluate the performance of the suggested algorithm in three real benchmark datasets, by comparing the accuracy and the computational demand with its strong alternatives, namely, birth-death MCMC, RJMCMC and QUIC algorithms. From the comparative analyses, we detect that Gibbs sampling improves the computational cost of RJMCMC without losing the accuracy.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.