EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • An efficient algorithm for PAR...
  • More details
Cover Image

An efficient algorithm for PARAFAC of three-way data with large numbers of observation units

Year of publication:
1991
Authors: Kiers, Henk ; Krijnen, Wim
Published in:
Psychometrika. - Springer. - Vol. 56.1991, 1, p. 147-152
Publisher: Springer
Subject: CANDECOMP | PARAFAC
Saved in:
  • More details
Extent:
text/html
Type of publication: Article
Source:
RePEc - Research Papers in Economics
Persistent link: https://ebvufind01.dmz1.zbw.eu/10005757820
    • EndNote
    • BibTeX
    • Zotero, Mendeley, RefWorks, ...
    • Text
Saved in favorites
    Similar items by subject
    • Some additional results on principal components analysis of three-mode data by means of alternating least squares algorithms

      Berge, Jos, (1987)

    • The Assumption of Proportional Components when Candecomp is Applied to Symmetric Matrices in the Context of Indscal

      Dosse, Mohammed, (2008)

    • Degeneracy in Candecomp/Parafac and Indscal Explained For Several Three-Sliced Arrays With A Two-Valued Typical Rank

      Stegeman, Alwin, (2007)

    • More ...
    Similar items by person
    • Computational solutions for the problem of negative saliences and nonsymmetry in INDSCAL

      Berge, Jos, (1993)

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

      Krijnen, Wim, (2008)

    • Implications of Indeterminate Factor-Error Covariances for Factor Construction, Prediction, and Determinacy

      Krijnen, Wim, (2006)

    • More ...
    A service of the
    zbw
    • Sitemap
    • Plain language
    • Accessibility
    • Contact us
    • Imprint
    • Privacy

    Loading...