Applying Discrete PCA in Data Analysis
Abstract
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 analysis, and genotype inference with admixture. In this paper we explore a number of extensions to the common theory, and present some application of these methods to some common statistical tasks. We show that these methods can be interpreted as a discrete version of ICA. We develop a hierarchical version yielding components at different levels of detail, and additional techniques for Gibbs sampling. We compare the algorithms on a text prediction task using support vector machines, and to information retrieval.
Cite
Text
Buntine and Jakulin. "Applying Discrete PCA in Data Analysis." Conference on Uncertainty in Artificial Intelligence, 2004.Markdown
[Buntine and Jakulin. "Applying Discrete PCA in Data Analysis." Conference on Uncertainty in Artificial Intelligence, 2004.](https://mlanthology.org/uai/2004/buntine2004uai-applying/)BibTeX
@inproceedings{buntine2004uai-applying,
title = {{Applying Discrete PCA in Data Analysis}},
author = {Buntine, Wray L. and Jakulin, Aleks},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2004},
pages = {59-66},
url = {https://mlanthology.org/uai/2004/buntine2004uai-applying/}
}