Probabilistic factorization of non-negative data with entropic co-occurrence constraints

Paris Smaragdis; Madhusudana Shashanka; Bhiksha Raj; Gautham J. Mysore

doi:10.1007/978-3-642-00599-2_42

Probabilistic factorization of non-negative data with entropic co-occurrence constraints

Paris Smaragdis, Madhusudana Shashanka, Bhiksha Raj, Gautham J. Mysore

Research output: Contribution to journal › Conference article › peer-review

Abstract

In this paper we present a probabilistic algorithm which fac- torizes 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.

Original language	English (US)
Pages (from-to)	330-337
Number of pages	8
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5441
DOIs	https://doi.org/10.1007/978-3-642-00599-2_42
State	Published - 2009
Externally published	Yes
Event	8th International Conference on Independent Component Analysis and Signal Separation, ICA 2009 - Paraty, Brazil Duration: Mar 15 2009 → Mar 18 2009

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Online availability

10.1007/978-3-642-00599-2_42

Library availability

Discover UIUC Full Text

Cite this

Probabilistic factorization of non-negative data with entropic co-occurrence constraints. / Smaragdis, Paris; Shashanka, Madhusudana; Raj, Bhiksha et al.
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 5441, 2009, p. 330-337.

Research output: Contribution to journal › Conference article › peer-review

@article{eb394c3180a44e56b66a9690ec0aefa9,

title = "Probabilistic factorization of non-negative data with entropic co-occurrence constraints",

abstract = "In this paper we present a probabilistic algorithm which fac- torizes 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.",

author = "Paris Smaragdis and Madhusudana Shashanka and Bhiksha Raj and Mysore, {Gautham J.}",

year = "2009",

doi = "10.1007/978-3-642-00599-2_42",

language = "English (US)",

volume = "5441",

pages = "330--337",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

publisher = "Springer",

note = "8th International Conference on Independent Component Analysis and Signal Separation, ICA 2009 ; Conference date: 15-03-2009 Through 18-03-2009",

}

TY - JOUR

T1 - Probabilistic factorization of non-negative data with entropic co-occurrence constraints

AU - Smaragdis, Paris

AU - Shashanka, Madhusudana

AU - Raj, Bhiksha

AU - Mysore, Gautham J.

PY - 2009

Y1 - 2009

N2 - In this paper we present a probabilistic algorithm which fac- torizes 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.

AB - In this paper we present a probabilistic algorithm which fac- torizes 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.

UR - http://www.scopus.com/inward/record.url?scp=67149144202&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67149144202&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-00599-2_42

DO - 10.1007/978-3-642-00599-2_42

M3 - Conference article

AN - SCOPUS:67149144202

SN - 0302-9743

VL - 5441

SP - 330

EP - 337

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

T2 - 8th International Conference on Independent Component Analysis and Signal Separation, ICA 2009

Y2 - 15 March 2009 through 18 March 2009

ER -

Probabilistic factorization of non-negative data with entropic co-occurrence constraints

Abstract

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this