Extended Sparse Nonnegative Matrix Factorization
暂无分享,去创建一个
In sparse nonnegative component analysis (sparse NMF) a given dataset is decomposed into a mixing matrix and a feature data set, which are both nonnegative and fulfill certain sparsity constraints. In this paper, we extend the sparse NMF algorithm to allow for varying sparsity in each feature and discuss the uniqueness of an involved projection step. Furthermore, the eligibility of the extended sparse NMF algorithm for blind source separation is investigated.
[1] H. Sebastian Seung,et al. Learning the parts of objects by non-negative matrix factorization , 1999, Nature.
[2] Patrik O. Hoyer,et al. Non-negative Matrix Factorization with Sparseness Constraints , 2004, J. Mach. Learn. Res..