首页> 外文期刊>Journal of Classification >Optimal Variable Weighting for Ultrametric and Additive Trees and K-means Partitioning: Methods and Software
【24h】

Optimal Variable Weighting for Ultrametric and Additive Trees and K-means Partitioning: Methods and Software

机译:超量树和加性树的最优变量加权和K-均值划分:方法和软件

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

摘要

-means partitioning. We also describe some new features and improvements to the algorithm proposed by De Soete. Monte Carlo simulations have been conducted using different error conditions. In all cases (i.e., ultrametric or additive trees, or K-means partitioning), the simulation results indicate that the optimal weighting procedure should be used for analyzing data containing noisy variables that do not contribute relevant information to the classification structure. However, if the data involve error-perturbed variables that are relevant to the classification or outliers, it seems better to cluster or partition the entities by using variables with equal weights. A new computer program, OVW, which is available to researchers as freeware, implements improved algorithms for optimal variable weighting for ultrametric and additive tree clustering, and includes a new algorithm for optimal variable weighting for K-means partitioning.
机译:-表示分区。我们还描述了De Soete提出的算法的一些新功能和改进。使用不同的误差条件进行了蒙特卡洛模拟。在所有情况下(即超树或加法树或K-均值划分),仿真结果均表明,应使用最佳加权程序来分析包含噪声变量的数据,这些噪声变量不会对分类结构提供相关信息。但是,如果数据涉及与分类或异常值相关的误差扰动变量,则通过使用具有相等权重的变量来对实体进行聚类或分区似乎更好。研究人员可以免费获得一种新的计算机程序OVW,该程序实现了改进的算法,可用于超度量和加性树聚类的最佳变量加权,并包括一种用于K均值分区的最佳变量加权的新算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号