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
  • Search
  • A modified CANDECOMP method fo...
  • More details
Cover Image

A modified CANDECOMP method for fitting the extended INDSCAL model

Year of publication:
1993
Authors: Soete, Geert ; Carroll, J. ; Chaturvedi, Anil
Published in:
Journal of Classification. - Springer. - Vol. 10.1993, 1, p. 75-92
Publisher: Springer
Subject: Extended INDSCAL model | Extended Euclidean distance model | CANDECOMP | Alternating least squares method | Constrained INDSCAL model
Saved in:
  • More details
Extent:
text/html
Type of publication: Article
Source:
RePEc - Research Papers in Economics
Persistent link: https://www.econbiz.de/10005156025
    • EndNote
    • BibTeX
    • Zotero, Mendeley, RefWorks, ...
    • Text
Saved in favorites
    Similar items by subject
    • Some notes on the diagonalization of the extended three-mode core matrix

      Brouwer, Piet, (1991)

    • Degeneracy in Candecomp/Parafac explained for p × p × 2 arrays of rank p + 1 or higher

      Stegeman, Alwin, (2006)

    • Kruskal's polynomial for 2×2×2 arrays and a generalization to 2×n×n arrays

      Berge, Jos, (1991)

    • More ...
    Similar items by person
    • An alternating combinatorial optimization approach to fitting the INDCLUS and generalized INDCLUS models

      Chaturvedi, Anil, (1994)

    • An evaluation of five algorithms for generating an initial configuration for SINDSCAL

      Carroll, J., (1989)

    • Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data

      Soete, Geert, (1987)

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

    Loading...