Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

MC(4): a tempering algorithm for large-sample network inference

Tools
- Tools
+ Tools

Barker, D., Hill, Steven (Steven M.) and Mukherjee, Sach (2010) MC(4): a tempering algorithm for large-sample network inference. In: 5th International Conference on Pattern Recognition in Bioinformatics, Nijmegen, The Netherlands, 22-24 Sep 2010. Published in: Pattern Recognition in Bioinformatics, Vol. 6282 pp. 431-442.

Full text not available from this repository.

Abstract

Bayesian networks and their variants are widely used for modelling gene regulatory and protein signalling networks. In many settings, it is the underlying network structure itself that is the object of inference. Within a Bayesian framework inferences regarding network structure are made via a posterior probability distribution over graphs. However, in practical problems, the space of graphs is usually too large to permit exact inference, motivating the use of approximate approaches. An MCMC-based algorithm known as MC(3) is widely used for network inference in this setting. We argue that recent trends towards larger sample size datasets, while otherwise advantageous, call, for reasons related to concentration of posterior mass, render inference by MC(3) harder. We therefore exploit an approach known as parallel tempering to put forward an algorithm for network inference which we call MC(4). We show empirical results on both synthetic and proteomic data which highlight the ability of MC(4) to converge faster and thereby yield demonstrably accurate results, even in challenging settings where MC(3) fails.

Item Type: Conference Item (Paper)
Divisions: Faculty of Science > Centre for Complexity Science
Journal or Publication Title: Pattern Recognition in Bioinformatics
ISSN: 0302-9743
Date: 2010
Volume: Vol. 6282
Page Range: pp. 431-442
Identification Number: 10.1007/978-3-642-16001-1_37
Status: Peer Reviewed
Publication Status: Published
Conference Paper Type: Paper
Title of Event: 5th International Conference on Pattern Recognition in Bioinformatics
Type of Event: Conference
Location of Event: Nijmegen, The Netherlands
Date(s) of Event: 22-24 Sep 2010
URI: http://wrap.warwick.ac.uk/id/eprint/41461

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us