Probabilistic Factorization of Non-negative Data with Entropic Co-occurrence Constraints

Authors:
Paris Smaragdis;Madhusudana Shashanka;Bhiksha Raj;Gautham J. Mysore
Affiliations:
Adobe Systems Inc.,;Mars Incorporated,;Mitsubishi Electric Research Laboratories,;Stanford University,
Venue:
ICA '09 Proceedings of the 8th International Conference on Independent Component Analysis and Signal Separation
Year:
2009

Citing 4
Cited 0

Comparison of discriminative training criteria and optimization methods for speech recognition

Speech Communication
A Unified View of Matrix Factorization Models

ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
Algorithms for nonnegative independent component analysis

IEEE Transactions on Neural Networks
A "nonnegative PCA" algorithm for independent component analysis

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a probabilistic algorithm which factorizes non-negative data. We employ entropic priors to additionally satisfy that user specified pairs of factors in this model will have their cross entropy maximized or minimized. These priors allow us to construct factorization algorithms that result in maximally statistically different factors, something that generic non-negative factorization algorithms cannot explicitly guarantee. We further show how this approach can be used to discover clusters of factors which allow a richer description of data while still effectively performing a low rank analysis.