Gamma-based clustering via ordered means with application to gene-expression analysis

From MaRDI portal
Publication:620546

DOI10.1214/10-AOS805zbMATH Open1233.62002arXiv0907.3837WikidataQ41561796 ScholiaQ41561796MaRDI QIDQ620546FDOQ620546


Authors: Michael A. Newton, Lisa M. Chung Edit this on Wikidata


Publication date: 19 January 2011

Published in: The Annals of Statistics (Search for Journal in Brave)

Abstract: Discrete mixture models provide a well-known basis for effective clustering algorithms, although technical challenges have limited their scope. In the context of gene-expression data analysis, a model is presented that mixes over a finite catalog of structures, each one representing equality and inequality constraints among latent expected values. Computations depend on the probability that independent gamma-distributed variables attain each of their possible orderings. Each ordering event is equivalent to an event in independent negative-binomial random variables, and this finding guides a dynamic-programming calculation. The structuring of mixture-model components according to constraints among latent means leads to strict concavity of the mixture log likelihood. In addition to its beneficial numerical properties, the clustering method shows promising results in an empirical study.


Full work available at URL: https://arxiv.org/abs/0907.3837




Recommendations




Cites Work


Cited In (4)

Uses Software





This page was built for publication: Gamma-based clustering via ordered means with application to gene-expression analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q620546)