Skip to main content

Advertisement

Table 4 Multiple comparisons for the k -AMH algorithm

From: An efficient clustering algorithm for partitioning Y-short tandem repeats data

Accuracy Games–Howell
(I) Algorithm (J) Algorithm Mean Diff. (I-J) Std. Error p -value 95% Confidence Interval
  Lower Bound Upper Bound
k-AMH k-Mode 0.17* 0.01 < 0.00001 0.16 0.19
  k-Mode-RVF 0.12* 0.01 < 0.00001 0.11 0.14
  k-Mode-UAVM 0.23* 0.01 < 0.00001 0.21 0.25
  k-Mode-Hybrid 1 0.17* 0.01 < 0.00001 0.16 0.19
  k-Mode-Hybrid 2 0.18* 0.01 < 0.00001 0.16 0.20
  Fuzzy k-Mode 0.19* 0.01 < 0.00001 0.17 0.21
  k-Population 0.02* 0.00 0.00271 0.01 0.03
  New Fuzzy k-Modes 0.13* 0.01 < 0.00001 0.12 0.15
  1. *Note: p < 0.05.