pith. sign in

arxiv: math/0604410 · v1 · submitted 2006-04-18 · 🧮 math.ST · stat.TH

Discrete Component Analysis

classification 🧮 math.ST stat.TH
keywords analysiscomponentdiscretegibbssamplingalgorithmsallocationapplications
0
0 comments X
read the original abstract

This article presents a unified theory for analysis of components in discrete data, and compares the methods with techniques such as independent component analysis, non-negative matrix factorisation and latent Dirichlet allocation. The main families of algorithms discussed are a variational approximation, Gibbs sampling, and Rao-Blackwellised Gibbs sampling. Applications are presented for voting records from the United States Senate for 2003, and for the Reuters-21578 newswire collection.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.