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

V Makarenkov, P Legendre - Journal of Classification, 2001 - Springer
Journal of Classification, 2001Springer
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 (ie, 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 …
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.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果