Biclustering is a technique for clustering rows and columns of a data matrix simultaneously. Over the past few years, we have seen its applications in biology-related fields, as well as in many data mining projects. As opposed to classical clustering methods, biclustering groups objects that are similar only on a subset of variables. Many biclustering algorithms on continuous data have emerged over the last decade. In this dissertation, we will focus on two Bayesian biclustering algorithms we developed for discrete data, more specifically categorical data and ordinal data. / Statistics
| Identifer | oai:union.ndltd.org:harvard.edu/oai:dash.harvard.edu:1/11181216 |
| Date | 18 October 2013 |
| Creators | Guo, Lei |
| Contributors | Liu, Jun |
| Publisher | Harvard University |
| Source Sets | Harvard University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Rights | open |
Page generated in 0.0078 seconds