...
首页> 外文期刊>Journal of Mathematical Psychology >ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses
【24h】

ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses

机译:CONPAR:用于识别后续多维缩放分析的协调主题邻近矩阵组的方法

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

摘要

A common representation of data within the context of multidimensional scaling (MDS) is a collection of symmetric proximity (similarity or dissimilarity) matrices for each of M subjects. There are a number of possible alternatives for analyzing these data, which include: (a) conducting an MDS analysis on a single matrix obtained by pooling (averaging) the M subject matrices, (b) fitting a separate MDS structure for each of the M matrices, or (c) employing an individual differences MDS model. We discuss each of these approaches, and subsequently propose a straightforward new method (CONcordance PARtitioning-ConPar), which can be used to identify groups of individual-subject matrices with concordant proximity structures. This method collapses the three-way data into a subject x subject dissimilarity matrix, which is subsequently clustered using a branch-and-bound algorithm that minimizes partition diameter. Extensive Monte Carlo testing revealed that, when compared to K-means clustering of the proximity data, ConPar generally provided better recovery of the true subject cluster memberships. A demonstration using empirical three-way data is also provided to illustrate the efficacy of the proposed method. 2005 Elsevier Inc. All rights reserved.
机译:在多维缩放(MDS)的上下文中的常见数据表示是M个科目中的每一个的对称接近度(相似性或不相似性)矩阵的集合。有许多可能的替代方案用于分析这些数据,其包括:(a)对通过汇集(平均)Moction矩阵而获得的单个矩阵进行MDS分析,(b)为每个mds拟合单独的MDS结构矩阵,或(c)采用个体差异MDS模型。我们讨论这些方法中的每一种,随后提出了一种简单的新方法(Concordance Partitioning-Conpar),其可用于识别具有辅助接近结构的个体主题矩阵的组。该方法将三通数据崩溃到对象X对象异化矩阵中,随后使用分支和绑定算法群集,该算法最小化分区直径。广泛的Monte Carlo测试显示,与K-Means聚类相比,与近距离数据相比,Conpar通常提供了更好地恢复真正的主题集群成员资格。还提供了使用经验三向数据的示范,以说明所提出的方法的功效。 2005年elestvier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号