Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 249-256 |
Number of pages | 8 |
Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Volume | 3512 |
DOIs | |
State | Published - 2005 |
Externally published | Yes |
Event | 8th International Workshop on Artificial Neural Networks, IWANN 2005: Computational Intelligence and Bioinspired Systems - Vilanova i la Geltru, Spain Duration: 8 Jun 2005 → 10 Jun 2005 |