Tuning pruning in sparse non-negative matrix factorization

European Signal Processing Conference

Volumn , Issue , 2009, Pages 1923-1927

  Mørup, Morten ^a   Hansen, Lars Kai ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC RELEVANCE DETERMINATION; BAYESIAN MODELLING; EXPLORATORY ANALYSIS; HIERARCHICAL BAYESIAN; INTERPRETABLE REPRESENTATION; MODEL ORDER; NONNEGATIVE MATRIX FACTORIZATION; NONUNIQUENESS; NUMBER OF COMPONENTS; SPARSE NON-NEGATIVE MATRIX FACTORIZATIONS;

ELECTRICAL ENGINEERING;

SIGNAL PROCESSING;

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

References (30)

1. H. Akaike. A new look at the statistical model identification. Automatic Control, IEEE Transactions on, 19(6):716-723, 1974.
2. C. M. Bishop. Pattern Recognition and Machine Learning (Information Science and Statistics). Springer, August 2006.
3. R. Bro and S. de Jong. A fast non-negativity-constrained least squares algorithm. J. of Chemometrics, 11(5):393-401, 1997.
4. A. Cichocki, R. Zdunek, S. Choi, R. Plemmons, and S. Amari. Nonnegative tensor factorization using alpha and beta divergences. ICASSP, 2007.
5. Y. Le Cun, J. S. Denker, and S. A. Solla. Optimal brain damage. In Advances in Neural Information Processing Systems, pages 598-605, 1990.
6. I. Dhillon and S. Sra. Generalized nonnegative matrix approximations with bregman divergences. In Advances in Neural Information Processing Systems 18, pages 283-290, 2005.
7. C. Ding, X. He, and H. D. Simon. On the equivalence of nonnegative matrix factorization and spectral clustering. Proc. SIAM Internat. Conf. Data Min. (SDM'05), pages 606-610, 2005.
8. 1-norm solution is also the sparsest solution. Communications on Pure and Applied Mathematics, 59(6):797-829, 2006.
9. D. Donoho and V. Stodden. When does nonnegative matrix factorization give a correct decomposition into parts? In Advances in Neural Information Processing Systems 16, 2003.
10. J. Eggert and E. Körner. Sparse coding and nmf. In Neural Networks, volume 4, pages 2529-2533, 2004.
11. P. O. Hoyer. Non-negative matrix factorization with sparseness constraints. Journal of Machine Learning Research, 5:1457-1469, 2004.
12. P.O. Hoyer. Non-negative sparse coding. Neural Networks for Signal Processing, 2002. Proceedings of the 2002 12th IEEE Workshop on, pages 557-565, 2002.
13. H. F. Kaiser. The varimax criterion for analytic rotation in factor analysis. Psychometrica, 23:187-200, 1958.
14. D. Kim, S. Sra, and I. S. Dhillon. Fast projection-based methods for the least squares nonnegative matrix approximation problem. Stat. Anal. Data Min., 1(1):38-51, 2008.
15. H. Laurberg, M. G. Christensen, M. D. Plumbley, L. K. Hansen, and S. H. Jensen. Theorems on positive data: On the uniqueness of nmf. Computational Intelligence and Neuroscience, 2008.
16. C.L. Lawson and R.J. Hanson. Solving Least Squares Problems, volume 15 of Classics in Applied Mathematics. SIAM, Philadelphia, PA, 1995, 1974.
17. D. D. Lee and H. S. Seung. Algorithms for nonnegative matrix factorization. In NIPS, pages 556-562, 2000.
18. D.D. Lee and H.S. Seung. Learning the parts of objects by nonnegative matrix factorization. Nature, 401(6755):788-91, 1999.
19. C.-J. Lin. Projected gradient methods for non-negative matrix factorization. Neural Computation, 19:2756-2779, 2007.
20. D. J. C. Mackay. Bayesian interpolation. Neural Computation, 4:415-447, 1992.
21. M. Mørup, L.K. Hansen, and S. M. Arnfred. Erpwavelab a toolbox for multi-channel analysis of time-frequency transformed event related potentials. Journal of Neuroscience Methods, 161(361-368), 2007.
22. M. Mørup, L.K. Hansen, and S. M. Arnfred. Algorithms for sparse non-negative tucker. Neural Computation, 20(8):2112-2131, 2008
23. M. Mørup. Decomposition Methods for Unsupervised Learning. PhD thesis, Technical University of Denmark, 2008.
24. M. Mørup and L. K. Hansen. Automatic relevance determination for multi-way models. accepted for publication, Journal of Chemometrics, 22:1-12, 2009.
25. P Paatero and U Tapper. Positive matrix factorization: A nonnegative factor model with optimal utilization of error estimates of data values. Environmetrics, 5(2):111-126, 1994.
26. Y. Qi, T. P. Minka, R. W. Picard, and Z. Ghahramani. Predictive automatic relevance determination by expectation propagation. In Proceedings of the twenty-first international conference on Machine learning, page 85, New York, NY, USA, 2004. ACM.
27. R. Salakhutdinov, S. Roweis, and Z. Ghahramani. On the convergence of bound optimization algorithms. In Proceedings of the 19th Annual Conference on Uncertainty in Artificial Intelligence (UAI-03), pages 509-516, 2003.
28. M. N. Schmidt, O. Winther, and L. K. Hansen. Bayesian non-negative matrix factorization. accepted for publication ICA 2009.
29. G. Schwarz. Estimating the dimension of a model. Annals of Statistics, 6(2):461-464, 1978.
30. V. Y. F. Tan and C. Fvotte. Automatic relevance determination in nonnegative matrix factorization. In Proc. Workshop on Signal Processing with Adaptative Sparse Structured Representations (SPARS09), 2009.