Probabilistic Sparse Matrix Factorization
Delbert Dueck, Brendan J. Frey · 2004
Many kinds of data can be viewed as consisting of a set of vectors, each of which is a noisy combination of a small number of noisy prototype vectors. Physically, these prototype vectors may correspond to different hidden variables that play a role in determining the measured data. For example, a gene’s expression is influenced by the presence of transcription factor proteins, and two genes may be activated by overlapping sets of transcription factors. Consequently, the activity of each gene can be explained by the activities of a small number of transcription factors. This task can be viewed as the problem of factorizing a data matrix, while taking into account hard constraints reflecting structural knowledge of the problem and probabilistic relationships between variables that are induced by known uncertainties in the problem. We present soft-decision probabilistic sparse matrix factorization (PSMF) to better account for uncertainties due to varying levels of noise in the data, varying levels of noise in the prototypes used to explain the data, and uncertainty as to which hidden prototypes are selected to explain each expression vector.
Cited by 38 works.
Authors
References
- An Information-Maximization Approach to Blind Separation and Blind Deconvolution
- On the Statistical Analysis of Dirty Pictures
- An Introduction to Variational Methods for Graphical Models
- Learning in Graphical Models
- Fast and robust fixed-point algorithms for independent component analysis
- Knowledge-based analysis of microarray gene expression data by using support vector machines
- Functional Discovery via a Compendium of Expression Profiles
- Systematic determination of genetic network architecture
- Detecting Protein Function and Protein-Protein Interactions from Genome Sequences
- The functional landscape of mouse gene expression