首页> 外文期刊>Advances in data analysis and classification >Generalized GIPSCAL re-revisited: a fast convergent algorithm with acceleration by the minimal polynomial extrapolation
【24h】

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

机译:重新回顾了通用GIPSCAL:一种通过最小多项式外推实现加速的快速收敛算法

获取原文
获取原文并翻译 | 示例
           

摘要

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.
机译:像DEDICOM一样,广义GIPSCAL是用于分析方形不对称表的模型。这是DEDICOM的特例,但与DEDICOM不同,它确保了模型矩阵的非负定性(nnd),从而允许“对象”之间非对称关系的空间表示。通过最小多项式外推法为GIPSCAL开发了一种具有加速功能的快速收敛算法。将该算法与Trendafilov算法的计算速度进行了比较。基本算法已针对GIPSCAL的各种扩展进行了调整,包括非对角DEDICOM / GIPSCAL和三向GIPSCAL。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号