On uniqueness in candecomp/parafac
By J. F. Berge, N. Sidiropoulos. 2002
126 citations recorded by the source corpus.
Subfields: Computational Mathematics, Computer Networks and Communications, Signal Processing
View Paper: https://www.semanticscholar.org/paper/05fc805d4ab89e6b7b1c9e63bb69f870d5564bb5
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mathematics
- Alwin Stegeman
- Moritz Grosse-Wentrup
- Martin Buss
- N. Sidiropoulos
- Lieven De Lathauwer
- Pierre Comon
- Andrzej S. Cichocki
- Anh Huy Phan
In Computer Networks and Communications
In Signal Processing
- Alwin Stegeman
- Moritz Grosse-Wentrup
- Martin Buss
- N. Sidiropoulos
- Lieven De Lathauwer
- Andrzej S. Cichocki
- Pierre Comon
- Anh Huy Phan
Citations in the corpus
- On uniqueness conditions for Candecomp/Parafac and Indscal with full column rank in one mode (2009, methodology): “6 applies to the 3 × 3 × 4 example of Ten Berge and Sidiropoulos [24], that motivated the analysis of Jiang and Sidiropoulos [6].”
- Multiclass Common Spatial Patterns and Information Theoretic Feature Extraction (2008, methodology): “This question of uniqueness has been addressed for orthogonal mixing matrices A (or for sphered data) in [1], and for arbitrary mixing matrices in [ 20 ].”
- Hadamard, Khatri-Rao, Kronecker and Other Matrix Products (2008, unknown): “For further detailed and more results on multi-way data, PARAFAC models, algorithms, validation and constraints, and on other associated models, data analysis and applications in psychometrics, signal processing, chemometrics and food sciences, see e.g. Bro (1998), Ten Berge and Sidiropoulos (2002),”
- On Kruskal's uniqueness condition for the Candecomp/Parafac decomposition (2007, background): “Ten Berge and Sidiropoulos [14] have shown that Kruskal’s sufficient condition (2.”