Sparse overcomplete latent variable decomposition of counts data

Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference

Volumn , Issue , 2008, Pages

  Shashanka, Madhusudana ^a   Raj, Bhiksha ^b   Smaragdis, Paris ^c  

^a MARS INC   (United States)

^b MITSUBISHI ELECTRIC RESEARCH LABORATORIES   (United States)

^c ADOBE RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; STATISTICS;

ANALYSIS FRAMEWORKS; COUNT DATUM; EXPERIMENTAL EVIDENCE; LATENT DIRICHLET ALLOCATION; LATENT VARIABLE; LEARNING FORMULATION; MAXIMUM A POSTERIORI; NUMBER OF COMPONENTS; OVER-COMPLETE; PROBABILISTIC LATENT SEMANTIC ANALYSIS;

SEMANTICS;

EID: 85162005859     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. DM Blei and JD Lafferty. Correlated Topic Models. In NIPS, 2006.
2. DM Blei, AY Ng, and MI Jordan. Latent Dirichlet Allocation. Journal of Machine Learning Research, 3:993-1022, 2003.
3. ME Brand. Pattern Discovery via EntropyMinimization. In Uncertainty 99: AISTATS 99, 1999.
4. RM Corless, GH Gonnet, DEG Hare, DJ Jeffrey, and DE Knuth. On the LambertW Function. Advances in Computational mathematics, 1996.
5. DJ Field. What is the Goal of Sensory Coding? Neural Computation, 1994.
6. T Hofmann. Unsupervised Learning by Probabilistic Latent Semantic Analysis. Machine Learning, 42:177-196, 2001. (Pubitemid 32872403)
7. PO Hoyer. Non-negativeMatrix Factorization with Sparseness Constraints. Journal of Machine Learning Research, 5, 2004.
8. DD Lee and HS Seung. Algorithms for Non-negativeMatrix Factorization. In NIPS, 2001.
9. J Skilling. Classic Maximum Entropy. In J Skilling, editor, Maximum Entropy and Bayesian Methods. Kluwer Academic, 1989.