𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Using underapproximations for sparse nonnegative matrix factorization

✍ Scribed by Nicolas Gillis; François Glineur

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
713 KB
Volume
43
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of two-mode network data using
Analysis of two-mode network data using nonnegative matrix factorization
✍ Michael Brusco 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 479 KB

Nonnegative matrix factorization has been offered as a fast and effective method for analyzing nonnegative two-mode proximity data. The goal is to structurally represent a nonnegative proximity matrix as the product of two lower-dimensional nonnegative matrices. Goodness of fit is typically measured

Dynamic levelwise scheduling for sparse
Dynamic levelwise scheduling for sparse matrix factorization on vector computers
✍ M. Montagna; G.P. Granelli; G.T. Vuong; R. Chahine 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 755 KB

In this paper the problem of the efficient implementation of sparse matrix factorization on vector computers is considered. A fine-grain dynamic levelwise scheduling algorithm (DLSA) is proposed. DLSA takes into account the dependences between update operations, thus avoiding the recurrence problem.