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
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Bayesian clustering of curves and the search of the partition space

Tools
- Tools
+ Tools

Liverani, Silvia (2009) Bayesian clustering of curves and the search of the partition space. PhD thesis, University of Warwick.

[img] PDF
WRAP_THESIS_Liverani_2009.pdf - Requires a PDF viewer.

Download (14Mb)
Official URL: http://webcat.warwick.ac.uk/record=b2317863~S15

Request Changes to record.

Abstract

This thesis is concerned with the study of a Bayesian clustering algorithm, proposed by Heard et al. (2006), used successfully for microarray experiments over time. It focuses not only on the development of new ways of setting hyperparameters so that inferences both reflect the scientific needs and contribute to the inferential stability of the search, but also on the design of new fast algorithms for the search over the partition space. First we use the explicit forms of the associated Bayes factors to demonstrate that such methods can be unstable under common settings of the associated hyperparameters. We then prove that the regions of instability can be removed by setting the hyperparameters in an unconventional way. Moreover, we demonstrate that MAP (maximum a posteriori) search is satisfied when a utility function is defined according to the scientific interest of the clusters. We then focus on the search over the partition space. In model-based clustering a comprehensive search for the highest scoring partition is usually impossible, due to the huge number of partitions of even a moderately sized dataset. We propose two methods for the partition search. One method encodes the clustering as a weighted MAX-SAT problem, while the other views clusterings as elements of the lattice of partitions. Finally, this thesis includes the full analysis of two microarray experiments for identifying circadian genes.

Item Type: Thesis or Dissertation (PhD)
Subjects: Q Science > QA Mathematics
Q Science > QH Natural history > QH426 Genetics
Library of Congress Subject Headings (LCSH): DNA microarrays -- Statistical methods, Partitions (Mathematics) -- Research, Bayesian statistical decision theory, Genetics -- Mathematical models
Official Date: September 2009
Dates:
DateEvent
September 2009Submitted
Institution: University of Warwick
Theses Department: Department of Statistics
Thesis Type: PhD
Publication Status: Unpublished
Supervisor(s)/Advisor: Smith, Jim Q.
Sponsors: University of Warwick. Dept of Statistics (UoW) ; Engineering and Physical Sciences Research Council (Great Britain) (EPSRC)
Format of File: pdf
Extent: 219 leaves : ill., charts
Language: eng

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

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