1994
DOI: 10.1016/0167-9473(94)90132-5
|View full text |Cite
|
Sign up to set email alerts
|

PARAFAC: Parallel factor analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

3
277
0
5

Year Published

1999
1999
2013
2013

Publication Types

Select...
8
1
1

Relationship

1
9

Authors

Journals

citations
Cited by 463 publications
(285 citation statements)
references
References 34 publications
3
277
0
5
Order By: Relevance
“…The orthogonality constraint was implemented by replacing Step 3 of the ALS algorithm in Appendix A with 3. C = Z(Z ′ Z) −1/2 where Z = X c (B ⊙ A) (Harshman & Lundy, 1994). We chose to appy the constraint on C (instead of A or B) to ensure that each component provided non-redundant information concerning interrelationships between the joints, while allowing the components to be linearly related with respect to the subjects and time points.…”
Section: Parallel Factor Analysis Of Joint Angle Datamentioning
confidence: 99%
“…The orthogonality constraint was implemented by replacing Step 3 of the ALS algorithm in Appendix A with 3. C = Z(Z ′ Z) −1/2 where Z = X c (B ⊙ A) (Harshman & Lundy, 1994). We chose to appy the constraint on C (instead of A or B) to ensure that each component provided non-redundant information concerning interrelationships between the joints, while allowing the components to be linearly related with respect to the subjects and time points.…”
Section: Parallel Factor Analysis Of Joint Angle Datamentioning
confidence: 99%
“…1). The first of these models is known as "Parallel Factor Analysis" or "PARAFAC" (Harshman and Lundy, 1994) and extends the bilinear umixing model (Eq. S1 in the Supplement) to a trilinear model (Fig.…”
Section: Three-dimensional Array Factorizationmentioning
confidence: 99%
“…For instance, the singular value decomposition can be expressed as a Tucker decomposition of a second order tensor with orthogonal factor matrices. Furthermore, Candecomp / Parafac (CP) [10,7] can be described as a Tucker decomposition with the additional constraints that the core tensor W is superdiagonal and r 1 = r 2 = · · · = r m . Similarly, the Block-Term decomposition (BTD) [8] can be viewed as imposing the constraint that the core tensor W is block-diagonal.…”
Section: Tensor Factorizationsmentioning
confidence: 99%