A robust procedure for Gaussian graphical model search from microarray data with p larger than n

  • Castelo R
  • Roverato A
  • 53


    Mendeley users who have this article in their library.
  • 60


    Citations of this article.


Learning of large-scale networks of interactions from microarray data is an important and challeng- ing problem in bioinformatics. A widely used approach is to assume that the available data consti- tute a random sample from a multivariate distribution belonging to a Gaussian graphical model. As a consequence, the prime objects of inference are full-order partial correlations which are partial correlations between two variables given the remaining ones. In the context of microarray data the number of variables exceed the sample size and this precludes the application of traditional structure learning procedures because a sampling version of full-order partial correlations does not exist. In this paper we consider limited-order partial correlations, these are partial correlations computed on marginal distributions of manageable size, and provide a set of rules that allow one to assess the usefulness of these quantities to derive the independence structure of the underlying Gaussian graphical model. Furthermore, we introduce a novel structure learning procedure based on a quantity, obtained from limited-order partial correlations, that we call the non-rejection rate. The applicability and usefulness of the procedure are demonstrated by both simulated and real data.

Author-supplied keywords

  • Gaussian distribution
  • gene network
  • graphical model
  • microarray data
  • non-rejection rate
  • partial correlation
  • small-sample inference

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • R Castelo

  • A Roverato

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free