ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2007.11446
  4. Cited By
Simplex-Structured Matrix Factorization: Sparsity-based Identifiability
  and Provably Correct Algorithms

Simplex-Structured Matrix Factorization: Sparsity-based Identifiability and Provably Correct Algorithms

22 July 2020
Maryam Abdolali
Nicolas Gillis
ArXivPDFHTML

Papers citing "Simplex-Structured Matrix Factorization: Sparsity-based Identifiability and Provably Correct Algorithms"

6 / 6 papers shown
Title
On the Robustness of the Successive Projection Algorithm
On the Robustness of the Successive Projection Algorithm
Giovanni Barbarino
Nicolas Gillis
86
0
0
25 Nov 2024
Quadratic Matrix Factorization with Applications to Manifold Learning
Quadratic Matrix Factorization with Applications to Manifold Learning
Zheng Zhai
Hengchao Chen
Qiang Sun
34
4
0
30 Jan 2023
Partial Identifiability for Nonnegative Matrix Factorization
Partial Identifiability for Nonnegative Matrix Factorization
Nicolas Gillis
R. Rajkó
13
2
0
16 Jun 2022
Deep matrix factorizations
Deep matrix factorizations
Pierre De Handschutter
Nicolas Gillis
Xavier Siebert
BDL
28
40
0
01 Oct 2020
Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix
  Factorization
Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization
Nicolas Gillis
S. Vavasis
58
222
0
06 Aug 2012
Factoring nonnegative matrices with linear programs
Factoring nonnegative matrices with linear programs
Victor Bittorf
Benjamin Recht
Christopher Ré
J. Tropp
84
204
0
06 Jun 2012
1