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. 2505.12713
  4. Cited By
Identifiability of Nonnegative Tucker Decompositions -- Part I: Theory

Identifiability of Nonnegative Tucker Decompositions -- Part I: Theory

19 May 2025
Subhayan Saha
Giovanni Barbarino
Nicolas Gillis
ArXiv (abs)PDFHTML

Papers citing "Identifiability of Nonnegative Tucker Decompositions -- Part I: Theory"

11 / 11 papers shown
Title
Low-Rank Matrix Factorizations with Volume-based Constraints and
  Regularizations
Low-Rank Matrix Factorizations with Volume-based Constraints and Regularizations
Olivier Vu Thanh
75
1
0
09 Dec 2024
HyperNTF: A Hypergraph Regularized Nonnegative Tensor Factorization for
  Dimensionality Reduction
HyperNTF: A Hypergraph Regularized Nonnegative Tensor Factorization for Dimensionality Reduction
Wanguang Yin
Youzhi Qu
Zhengming Ma
Quanying Liu
35
14
0
18 Jan 2021
Multiway clustering via tensor block models
Multiway clustering via tensor block models
Miaoyan Wang
Yuchen Zeng
45
42
0
10 Jun 2019
On Identifiability of Nonnegative Matrix Factorization
On Identifiability of Nonnegative Matrix Factorization
Xiao Fu
Kejun Huang
N. Sidiropoulos
70
95
0
02 Sep 2017
TensorLy: Tensor Learning in Python
TensorLy: Tensor Learning in Python
Jean Kossaifi
Yannis Panagakis
Anima Anandkumar
Maja Pantic
84
355
0
29 Oct 2016
Robust Volume Minimization-Based Matrix Factorization for Remote Sensing
  and Document Clustering
Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering
Xiao Fu
Kejun Huang
Bo Yang
Wing-Kin Ma
N. Sidiropoulos
30
103
0
15 Aug 2016
A Flexible and Efficient Algorithmic Framework for Constrained Matrix
  and Tensor Factorization
A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization
Kejun Huang
N. Sidiropoulos
A. Liavas
73
172
0
13 Jun 2015
When are Overcomplete Topic Models Identifiable? Uniqueness of Tensor
  Tucker Decompositions with Structured Sparsity
When are Overcomplete Topic Models Identifiable? Uniqueness of Tensor Tucker Decompositions with Structured Sparsity
Anima Anandkumar
Daniel J. Hsu
Majid Janzamin
Sham Kakade
74
51
0
13 Aug 2013
A Practical Algorithm for Topic Modeling with Provable Guarantees
A Practical Algorithm for Topic Modeling with Provable Guarantees
Sanjeev Arora
Rong Ge
Yoni Halpern
David M. Mimno
Ankur Moitra
David Sontag
Yichen Wu
Michael Zhu
89
437
0
19 Dec 2012
Computing a Nonnegative Matrix Factorization -- Provably
Computing a Nonnegative Matrix Factorization -- Provably
Sanjeev Arora
Rong Ge
R. Kannan
Ankur Moitra
309
399
0
03 Nov 2011
Mixed membership stochastic blockmodels
Mixed membership stochastic blockmodels
E. Airoldi
David M. Blei
S. Fienberg
Eric Xing
511
2,122
0
30 May 2007
1