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
ArXiv (abs)PDFHTML

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

5 / 5 papers shown
Title
On the Robustness of the Successive Projection Algorithm
On the Robustness of the Successive Projection Algorithm
Giovanni Barbarino
Nicolas Gillis
166
0
0
25 Nov 2024
Partial Identifiability for Nonnegative Matrix Factorization
Partial Identifiability for Nonnegative Matrix Factorization
Nicolas Gillis
R. Rajkó
38
4
0
16 Jun 2022
Smoothed Separable Nonnegative Matrix Factorization
Smoothed Separable Nonnegative Matrix Factorization
Nicolas Nadisic
Nicolas Gillis
Christophe Kervazo
69
9
0
11 Oct 2021
K-Deep Simplex: Deep Manifold Learning via Local Dictionaries
K-Deep Simplex: Deep Manifold Learning via Local Dictionaries
Pranay Tankala
Abiy Tasissa
James M. Murphy
Demba E. Ba
100
11
0
03 Dec 2020
Deep matrix factorizations
Deep matrix factorizations
Pierre De Handschutter
Nicolas Gillis
Xavier Siebert
BDL
128
47
0
01 Oct 2020
1