Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Alwin Stegeman is active.

Publication


Featured researches published by Alwin Stegeman.


Psychometrika | 2006

Sufficient conditions for uniqueness in Candecomp/Parafac and Indscal with random component matrices

Alwin Stegeman; Jos M. F. ten Berge; Lieven De Lathauwer

A key feature of the analysis of three-way arrays by Candecomp/Parafac is the essential uniqueness of the trilinear decomposition. We examine the uniqueness of the Candecomp/Parafac and Indscal decompositions. In the latter, the array to be decomposed has symmetric slices. We consider the case where two component matrices are randomly sampled from a continuous distribution, and the third component matrix has full column rank. In this context, we obtain almost sure sufficient uniqueness conditions for the Candecomp/Parafac and Indscal models separately, involving only the order of the three-way array and the number of components in the decomposition. Both uniqueness conditions are closer to necessity than the classical uniqueness condition by Kruskal.


Psychometrika | 2008

On the Non-Existence of Optimal Solutions and the Occurrence of “Degeneracy” in the CANDECOMP/PARAFAC Model

Wim P. Krijnen; Theo K. Dijkstra; Alwin Stegeman

The CANDECOMP/PARAFAC (CP) model decomposes a three-way array into a prespecified number of R factors and a residual array by minimizing the sum of squares of the latter. It is well known that an optimal solution for CP need not exist. We show that if an optimal CP solution does not exist, then any sequence of CP factors monotonically decreasing the CP criterion value to its infimum will exhibit the features of a so-called “degeneracy”. That is, the parameter matrices become nearly rank deficient and the Euclidean norm of some factors tends to infinity. We also show that the CP criterion function does attain its infimum if one of the parameter matrices is constrained to be column-wise orthonormal.


SIAM Journal on Matrix Analysis and Applications | 2008

Low-Rank Approximation of Generic

Alwin Stegeman

We consider the low-rank approximation over the real field of generic


SIAM Journal on Matrix Analysis and Applications | 2008

p \timesq \times2

Alwin Stegeman; Lieven De Lathauwer

p \times q \times 2


SIAM Journal on Matrix Analysis and Applications | 2012

Arrays and Diverging Components in the Candecomp/Parafac Model

Xijing Guo; Sebastian Miron; David Brie; Alwin Stegeman

arrays. For all possible combinations of


SIAM Journal on Matrix Analysis and Applications | 2012

A Method to Avoid Diverging Components in the Candecomp/Parafac Model for Generic

Alwin Stegeman

p


SIAM Journal on Matrix Analysis and Applications | 2010

I\timesJ\times2

Alwin Stegeman

,


SIAM Journal on Matrix Analysis and Applications | 2009

Arrays

Alwin Stegeman; André L. F. de Almeida

q


IEEE Transactions on Signal Processing | 2012

Uni-mode and Partial Uniqueness Conditions for CANDECOMP/PARAFAC of Three-Way Arrays with Linearly Dependent Loadings

A.L.F. de Almeida; Xavier Luciani; Alwin Stegeman; Pierre Comon

, and


Computational Statistics & Data Analysis | 2006

Candecomp/Parafac: From Diverging Components to a Decomposition in Block Terms

Alwin Stegeman; Jos M. F. ten Berge

R

Collaboration


Dive into the Alwin Stegeman's collaboration.

Top Co-Authors

Avatar

Lieven De Lathauwer

Katholieke Universiteit Leuven

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Tom Postmes

University of Groningen

View shared research outputs
Top Co-Authors

Avatar

Pierre Comon

Centre national de la recherche scientifique

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

David Brie

University of Lorraine

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Xavier Luciani

Aix-Marseille University

View shared research outputs
Researchain Logo
Decentralizing Knowledge