Discrete PCA

author: Wray Buntine, Faculty of Information Technology, Monash University
published: Feb. 25, 2007,   recorded: February 2005,   views: 7178

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


Methods for analysis of principal components in discrete data have existed for some time under various names such as grade of membership modelling, probabilistic latent semantic indexing, genotype inference with admixture, non-negative matrix factorization, latent Dirichlet allocation, multinomial PCA, and Gamma-Poisson models. Statistical methodologies for developing algorithms are equally as varied, although this talk will focus on the Bayesian framework. The most well published application is genetype inference, but text analysis is now increasingly seeing use because the algorithms cope with very large sparse matrices. This talk will present the general model, a discrete version of both PCA and ICA, present alternative representations, and several algorithms (mean field and Gibbs).

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: