Home/EURASIP Journal on Advances in Signal Processing/Article Record
Peer-Reviewed Article September 14, 2014

Overview of constrained PARAFAC models

Are you an author of this work?Link to your sovereign AfriScholar profile
Published in: EURASIP Journal on Advances in Signal Processing
Publisher: Springer Science+Business Media • Egypt • 1110-8657
DOI: https://doi.org/10.1186/1687-6180-2014-142

Abstract

In this paper, we present an overview of constrained parallel factor (PARAFAC) models where the constraints model linear dependencies among columns of the factor matrices of the tensor decomposition or, alternatively, the pattern of interactions between different modes of the tensor which are captured by the equivalent core tensor.Some tensor prerequisites with a particular emphasis on mode combination using Kronecker products of canonical vectors that makes easier matricization operations, are first introduced.This Kronecker product-based approach is also formulated in terms of an index notation, which provides an original and concise formalism for both matricizing tensors and writing tensor models.Then, after a brief reminder of PARAFAC and Tucker models, two families of constrained tensor models, the co-called PARALIND/CONFAC and PARATUCK models, are described in a unified framework, for Nth-order tensors.New tensor models, called nested Tucker models and block PARALIND/CONFAC models, are also introduced.A link between PARATUCK models and constrained PARAFAC models is then established.Finally, new uniqueness properties of PARATUCK models are deduced from sufficient conditions for essential uniqueness of their associated constrained PARAFAC models.

Download Full Text PDFView at PublisherCrossref RecordCrossref XML

Verified Citation Velocity

Recorded scholarly citations in African and international peer-reviewed literature

78
Total Citations

Citations are continuously tracked and harvested across continental OJS endpoints and OpenAlex feeds.