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

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.

• Type: Conference
• Year: 2009
• Where: IDA
• Authors: Paris Smaragdis, Madhusudana V. S. Shashanka, Bhiksha Raj, Gautham J. Mysore
• Keywords: Artificial Intelligence, Factorization Algorithms, IDA 2009, Non-negative Data, Non-negative Factorization Algorithms