Generalized GIPSCAL re-revisited: a fast convergent algorithm with acceleration by the minimal polynomial extrapolation

Sébastien Loisel, Yoshio Takane

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)
57 Downloads (Pure)

Abstract

Generalized GIPSCAL, like DEDICOM, is a model for the analysis of square asymmetric tables. It is a special case of DEDICOM, but unlike DEDICOM, it ensures the nonnegative definiteness (nnd) of the model matrix, thereby allowing a spatial representation of the asymmetric relationships among "objects". A fast convergent algorithm was developed for GIPSCAL with acceleration by the minimal polynomial extrapolation. The proposed algorithm was compared with Trendafilov's algorithm in computational speed. The basic algorithm has been adapted to various extensions of GIPSCAL, including off-diagonal DEDICOM/GIPSCAL, and three-way GIPSCAL. © 2011 Springer-Verlag.

Original languageEnglish
Pages (from-to)57-75
Number of pages19
JournalAdvances in Data Analysis and Classification
Volume5
Issue number1
DOIs
Publication statusPublished - Apr 2011

Keywords

  • Asymmetric square tables
  • DEDICOM
  • Diagonal estimation
  • Dynamical system algorithm
  • Singular value decomposition (SVD)
  • Three-way data

Fingerprint

Dive into the research topics of 'Generalized GIPSCAL re-revisited: a fast convergent algorithm with acceleration by the minimal polynomial extrapolation'. Together they form a unique fingerprint.

Cite this