Simultaneous clustering and dimensionality reduction using variational bayesian mixture model

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Exponential principal component analysis (e-PCA) provides a framework for appropriately dealing with various data types such as binary and integer for which the Gaussian assumption on the data distribution is inappropriate. In this paper, we develop a simultaneous dimensionality reduction and clustering technique based on a latent variable model for the e-PCA. Assuming the discrete distribution on the latent variable leads to mixture models with constraint on their parameters. We derive a learning algorithm for those mixture models based on the variational Bayes method. Although intractable integration is required to implement the algorithm, an approximation technique using Laplace's method allows us to carry out clustering on an arbitrary subspace. Numerical experiments on handwritten digits data demonstrate its effectiveness for extracting the structures of data as a visualization technique and its high generalization ability as a density estimation model. © Springer-Verlag Berlin Heidelberg 2010.

Cite

CITATION STYLE

APA

Watanabe, K., Akaho, S., Omachi, S., & Okada, M. (2010). Simultaneous clustering and dimensionality reduction using variational bayesian mixture model. In Studies in Classification, Data Analysis, and Knowledge Organization (pp. 81–89). Kluwer Academic Publishers. https://doi.org/10.1007/978-3-642-10745-0_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free